buf.enc_ndr_small(5); /* RPC version */
        buf.enc_ndr_small(0); /* minor version */
        buf.enc_ndr_small(ptype);
        buf.enc_ndr_small(flags);
        buf.enc_ndr_long(0x00000010); /* Little-endian / ASCII / IEEE */
        buf.enc_ndr_short(length);
        buf.enc_ndr_short(0); /* length of auth_value */
        buf.enc_ndr_long(call_id);
    }

    assertEquals(expected, murmur3_128(seed).hashBytes(input));
    assertEquals(expected, murmur3_128(seed).newHasher().putBytes(input).hash());
  }

  /** Returns a {@link HashCode} for a sequence of longs, in big-endian order. */
  private static HashCode toHashCode(long... longs) {
    ByteBuffer bb = ByteBuffer.wrap(new byte[longs.length * 8]).order(ByteOrder.LITTLE_ENDIAN);
    for (long x : longs) {
      bb.putLong(x);
    }

        @DisplayName("Reads structure size 4 and returns 4 for various start indexes")
        void returnsFour_whenStructureSizeIsFour(int start) throws Exception {
            // Arrange: build a buffer that has the little-endian value 4 at 'start'
            int len = start + 2; // need at least two bytes from start
            byte[] buffer = new byte[len + 3];
            SMBUtil.writeInt2(4, buffer, start);

        ndrBuffer.enc_ndr_short(0xABCD);
        assertEquals(2, ndrBuffer.getIndex()); // Aligned to 2, then advanced by 2
        assertEquals(2, ndrBuffer.getLength());
        assertEquals((byte) 0xCD, buffer[0]); // Little-endian
        assertEquals((byte) 0xAB, buffer[1]);

        ndrBuffer.setIndex(0);
        int val = ndrBuffer.dec_ndr_short() & 0xFFFF;
        assertEquals(0xABCD, val);
        assertEquals(2, ndrBuffer.getIndex());

        buf[i++] = tokId[0];
        buf[i++] = tokId[1];
        // MECH_OID_LEN (2 bytes big-endian)
        buf[i++] = (byte) ((oidLen >>> 8) & 0xFF);
        buf[i++] = (byte) (oidLen & 0xFF);
        // MECH_OID
        System.arraycopy(oidDer, 0, buf, i, oidLen);
        i += oidLen;
        // NAME_LEN (4 bytes big-endian)
        buf[i++] = (byte) ((nameLen >>> 24) & 0xFF);
        buf[i++] = (byte) ((nameLen >>> 16) & 0xFF);

            verify(mockBuffer).enc_ndr_small(DcerpcConstants.RPC_C_PF_BROADCAST); // flags
            verify(mockBuffer).enc_ndr_long(0x00000010); // Little-endian / ASCII / IEEE
            verify(mockBuffer).enc_ndr_short(message.length);
            verify(mockBuffer, times(1)).enc_ndr_short(0); // auth_value length
            verify(mockBuffer).enc_ndr_long(message.call_id);

   * {@code int} value, interpreted in little-endian byte order. The implementation <i>might</i>
   * perform better than its longhand equivalent, but should not perform worse.
   *
   * @since 12.0
   */
  HashCode hashInt(int input);

  /**
   * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given
   * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>

    /*
     * These arrays are set up to test that the comparator compares bytes within a word in the
     * correct order—in order words, that it doesn't mix up big-endian and little-endian. The first
     * array has a smaller element at one index, and then the second array has a smaller element at
     * the next.
     */
    byte[] a0 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 99, 15, 16, 17};

        assertTrue(resp.toString().contains(new Date(1630000000000L).toString()));
    }

    // Buffer helpers to build SMB basic file info wire format.
    // SMB uses little-endian byte order
    private static void writeLong(byte[] buf, int offset, long val) {
        for (int i = 0; i < 8; i++) {
            buf[offset + i] = (byte) ((val >>> (8 * i)) & 0xFF);
        }
    }

// making zero values useful and gmp's decision not to.
func (z *Int) doinit() {
	if z.init {
		return
	}
	z.init = true
	C.mpz_init(&z.i[0])
}

// Bytes returns z's representation as a big-endian byte array.
func (z *Int) Bytes() []byte {
	b := make([]byte, (z.Len()+7)/8)
	n := C.size_t(len(b))
	C.mpz_export(unsafe.Pointer(&b[0]), &n, 1, 1, 1, 0, &z.i[0])
	return b[0:n]
}