SMBUtil.writeInt2(445, buffer, offset + 2); // sin_port
            System.arraycopy(address.getAddress(), 0, buffer, offset + 4, 4); // sin_addr
            // Remaining bytes stay zero-filled
        }
    }

    private static InetAddress parseSockaddr(byte[] data, int offset) {
        try {
            int family = SMBUtil.readInt2(data, offset);

        assertEquals((byte) 'S', SMBUtil.SMB_HEADER[1]);
        assertEquals((byte) 'M', SMBUtil.SMB_HEADER[2]);
        assertEquals((byte) 'B', SMBUtil.SMB_HEADER[3]);

        // Verify remaining bytes are zeros
        for (int i = 4; i < 24; i++) {
            assertEquals((byte) 0x00, SMBUtil.SMB_HEADER[i]);
        }
    }

    @Test
    void testSMB2Header() {

                final SmbComReadAndX request = new SmbComReadAndX(file.fid, fp, r, null);
                if (file.type == SmbFile.TYPE_NAMED_PIPE) {
                    request.minCount = request.maxCount = request.remaining = 1024;
                }
                file.send(request, response);
            } catch (final SmbException se) {

    // that have the same key. Then a second pass will remove all but the first of the slots that
    // have this Entry. The value in the map becomes false when this first entry has been copied, so
    // we know not to copy the remaining ones.
    IdentityHashMap<Entry<K, V>, Boolean> duplicates = null;
    int dupCount = 0;
    for (int entryIndex = n - 1; entryIndex >= 0; entryIndex--) {

		if s.Len() > 0 {
			s.WriteByte(',')
		}
		s.WriteString("Inline")
	}
	return s.String()
}

// checkXL2V1 will check if the metadata has correct header and is a known major version.
// The remaining payload and versions are returned.
func checkXL2V1(buf []byte) (payload []byte, major, minor uint16, err error) {
	if len(buf) <= 8 {
		return payload, 0, 0, fmt.Errorf("xlMeta: no data")
	}

   * @param array the array of elements to append
   * @return an array whose size is one larger than {@code array}, with {@code element} occupying
   *     the first position, and the elements of {@code array} occupying the remaining elements.
   */
  public static <T extends @Nullable Object> T[] concat(@ParametricNullness T element, T[] array) {
    T[] result = newArray(array, array.length + 1);
    result[0] = element;

   * We are currently considering the elements in buffer in the range [0, bufferSize) as candidates
   * for the top k elements. Whenever the buffer is filled, we quickselect the top k elements to the
   * range [0, k) and ignore the remaining elements.
   */
  private final @Nullable T[] buffer;
  private int bufferSize;

  /**
   * The largest of the lowest k elements we've seen so far relative to this comparator. If

   * trailers are available to read.
   *
   * It is not safe to call this concurrently with code that is processing the response body. If you
   * call this without consuming the complete response body, any remaining bytes in the response
   * body will be discarded before trailers are returned.
   *
   * If [Call.cancel] is called while this is blocking, this call will immediately throw.
   *

   * @param array the array of elements to append
   * @return an array whose size is one larger than {@code array}, with {@code element} occupying
   *     the first position, and the elements of {@code array} occupying the remaining elements.
   */
  public static <T extends @Nullable Object> T[] concat(@ParametricNullness T element, T[] array) {
    T[] result = newArray(array, array.length + 1);
    result[0] = element;

        .addEqualityGroup(EnumBiMap.create(ImmutableMap.of(Currency.DOLLAR, Country.CHILE)))
        .addEqualityGroup(EnumBiMap.create(ImmutableMap.of(Currency.FRANC, Country.CANADA)))
        .testEquals();
  }

  /* Remaining behavior tested by AbstractBiMapTest. */