bb.putShort((short) 3); // version
            bb.putShort((short) 34); // size
            bb.putShort((short) 1); // serverType
            bb.putShort((short) 2); // rflags
            bb.putShort((short) 10); // proximity
            bb.putShort((short) 300); // ttl
            bb.putShort((short) 20); // pathOffset
            bb.putShort((short) 24); // altPathOffset
            bb.putShort((short) 28); // nodeOffset

        ByteBuffer bb = ByteBuffer.wrap(testBuffer).order(ByteOrder.LITTLE_ENDIAN);

        bb.putShort((short) 3);
        bb.putShort((short) 34);
        bb.putShort((short) 1);
        bb.putShort((short) 0);
        bb.putShort((short) 5);
        bb.putShort((short) 300);
        bb.putShort((short) 22);
        bb.putShort((short) 24);
        bb.putShort((short) 26);

            // Verify encoded data
            ByteBuffer bb = ByteBuffer.wrap(dst).order(ByteOrder.LITTLE_ENDIAN);
            assertEquals(maxReferralLevel, bb.getShort());

            // Verify path encoding (UTF-16LE)
            byte[] pathBytes = path.getBytes(StandardCharsets.UTF_16LE);
            byte[] encodedPath = new byte[pathBytes.length];
            bb.get(encodedPath);
            assertArrayEquals(pathBytes, encodedPath);

        ByteBuffer bb = ByteBuffer.wrap(buffer).order(ByteOrder.LITTLE_ENDIAN);

        // Next field (4 bytes) - offset to next entry (0 for last entry)
        bb.putInt(0);

        // InterfaceIndex (4 bytes)
        bb.putInt(interfaceIndex);

        // Capability (4 bytes)
        bb.putInt(capability);

        // Reserved (4 bytes) - must be 0

    assertTrue(Arrays.equals(expectedHashCode.bytes, hash.asBytes()));
    byte[] bb = new byte[hash.bits() / 8];
    hash.writeBytesTo(bb, 0, bb.length);
    assertTrue(Arrays.equals(expectedHashCode.bytes, bb));
    assertEquals(expectedHashCode.asInt, hash.asInt());
    if (expectedHashCode.asLong == null) {
      try {
        hash.asLong();
        fail();

    assertTrue(Arrays.equals(expectedHashCode.bytes, hash.asBytes()));
    byte[] bb = new byte[hash.bits() / 8];
    hash.writeBytesTo(bb, 0, bb.length);
    assertTrue(Arrays.equals(expectedHashCode.bytes, bb));
    assertEquals(expectedHashCode.asInt, hash.asInt());
    if (expectedHashCode.asLong == null) {
      try {
        hash.asLong();
        fail();

            // Given - larger buffer than needed
            byte[] buffer = new byte[100];
            ByteBuffer bb = ByteBuffer.wrap(buffer).order(ByteOrder.LITTLE_ENDIAN);
            bb.putLong(1000L);
            bb.putLong(500L);
            bb.putLong(500L);
            bb.putInt(8);
            bb.putInt(512);

            // When
            int bytesConsumed = fileFsFullSizeInfo.decode(buffer, 0, buffer.length);

            // Given - larger buffer than needed
            byte[] buffer = new byte[100];
            ByteBuffer bb = ByteBuffer.wrap(buffer).order(ByteOrder.LITTLE_ENDIAN);
            bb.putLong(1000L);
            bb.putLong(500L);
            bb.putInt(8);
            bb.putInt(512);

            // When
            int bytesConsumed = fileFsSizeInfo.decode(buffer, 0, buffer.length);

        crc0 ^= bb.getInt();
        crc1 ^= bb.getInt();
        crc2 ^= bb.getInt();
        crc3 ^= bb.getInt();
      }
    }

    @Override
    protected void processRemaining(ByteBuffer bb) {
      if (finished) {
        return;
      }
      crc0 = combine(0, crc0);
      crc0 = combine(crc0, crc1);
      crc0 = combine(crc0, crc2);
      crc0 = combine(crc0, crc3);

			b.ReportAllocs()
			for i := 0; i < b.N; i++ {
				var bb Buffer
				for bb.Len() < n {
					bb.Write(block)
				}
			}
		})
	}
}

func BenchmarkBufferAppendNoCopy(b *testing.B) {
	var bb Buffer
	bb.Grow(16 << 20)
	b.SetBytes(int64(bb.Available()))
	b.ReportAllocs()
	for i := 0; i < b.N; i++ {
		bb.Reset()
		b := bb.AvailableBuffer()