new ExpectedHashCode(
              new byte[] {
                (byte) 0xef, (byte) 0xcd, (byte) 0xab, (byte) 0x89,
                (byte) 0x67, (byte) 0x45, (byte) 0x23, (byte) 0x01
              },
              0x89abcdef,
              0x0123456789abcdefL,
              "efcdab8967452301"),
          new ExpectedHashCode(
              new byte[] {
                (byte) 0xef, (byte) 0xcd, (byte) 0xab, (byte) 0x89,

                (byte) 0xEF, (byte) 0xCD, (byte) 0xAB, (byte) 0x89 // 0x89ABCDEF
        };

        assertEquals(0x12345678, SMBUtil.readInt4(src, 0));
        assertEquals(0xFFFFFFFF, SMBUtil.readInt4(src, 4));
        assertEquals(0x00000000, SMBUtil.readInt4(src, 8));
        assertEquals(0x89ABCDEF, SMBUtil.readInt4(src, 12));
    }

    @Test
    void testReadInt8() {

          new ExpectedHashCode(
              new byte[] {
                (byte) 0xef, (byte) 0xcd, (byte) 0xab, (byte) 0x89,
                (byte) 0x67, (byte) 0x45, (byte) 0x23, (byte) 0x01
              },
              0x89abcdef,
              0x0123456789abcdefL,
              "efcdab8967452301"),
          new ExpectedHashCode(
              new byte[] {
                (byte) 0xef, (byte) 0xcd, (byte) 0xab, (byte) 0x89,

     */
    @Test
    void testWriteParametersWireFormat() {
        // Given
        int sid = 0x1234;
        int resumeKey = 0x89ABCDEF; // LE expected: EF CD AB 89
        String name = "file.txt";
        Trans2FindNext2 next = new Trans2FindNext2(sid, resumeKey, name);

        int expectedLen = 2 + 2 + 2 + 4 + 2 + name.length() + 1;

  // is masked in order to correspond to the current table size. For example, if the table size
  // is 128 then the mask is 127 == 0x7f, keeping the bottom 7 bits of the hash value.
  // If a key hashes to 0x89abcdef the mask reduces it to 0x89abcdef & 0x7f == 0x6f. We'll call this
  // the "short hash".
  //
  // The `keys`, `values`, and `entries` arrays always have the same size as each other. They can be

  // is masked in order to correspond to the current table size. For example, if the table size
  // is 128 then the mask is 127 == 0x7f, keeping the bottom 7 bits of the hash value.
  // If a key hashes to 0x89abcdef the mask reduces it to 0x89abcdef & 0x7f == 0x6f. We'll call this
  // the "short hash".
  //
  // The `keys`, `values`, and `entries` arrays always have the same size as each other. They can be

        assertTrue(result.contains("maxNumberVcs=2"));
        assertTrue(result.contains("maxBufferSize=4096"));
        assertTrue(result.contains("maxRawSize=8192"));
        assertTrue(result.contains("sessionKey=0x00ABCDEF"));
        // CAP_UNICODE is 0x0004, when formatted as 8 hex digits = 0x00000004
        assertTrue(result.contains("capabilities=0x00000004"));

		{"320330\x00 ", 0320330, true},
		{"0000660\x00 ", 0660, true},
		{"\x00 0000660\x00 ", 0660, true},
		{"0123456789abcdef", 0, false},
		{"0123456789\x00abcdef", 0, false},
		{"01234567\x0089abcdef", 342391, true},
		{"0123\x7e\x5f\x264123", 0, false},
	}

	for _, v := range vectors {
		var p parser
		got := p.parseNumeric([]byte(v.in))
		ok := (p.err == nil)
		if ok != v.ok {
			if v.ok {

	SCALL						// 73000000
	EBREAK						// 73001000
	SBREAK						// 73001000

	// Arbitrary bytes (entered in little-endian mode)
	WORD	$0x12345678	// WORD $305419896	// 78563412
	WORD	$0x9abcdef0	// WORD $2596069104	// f0debc9a

	// MOV pseudo-instructions
	MOV	X5, X6								// 13830200
	MOV	$2047, X5							// 9302f07f
	MOV	$-2048, X5							// 93020080
	MOV	$2048, X5							// b71200009b820280