writeLittleEndianInt(baos, 10); // size
        writeLittleEndianLong(baos, 25); // Unaligned offset (not multiple of 8)
        // Add enough data to avoid array bounds issues
        while (baos.size() < 35) {
            baos.write(0);
        }
        byte[] pacData = baos.toByteArray();

        PACDecodingException e = assertThrows(PACDecodingException.class, () -> new Pac(pacData, keys));

"2.1 OK"
"2.10 OK"
"2.11 OK"
"2.2 OK"
"2.3 OK"
"2.4 OK"
"2.5 OK"
"2.6 OK"
"2.7 OK"
"2.8 OK"
"2.9 OK"
"3.1 OK"
"3.2 NON-STRICT"
"3.3 NON-STRICT"
"3.4 NON-STRICT"
"3.5 OK"
"3.6 OK"
"3.7 OK"
"4.1.1 OK"
"4.1.2 OK"
"4.1.3 NON-STRICT"
"4.1.4 NON-STRICT"
"4.1.5 OK"
"4.2.1 OK"
"4.2.2 OK"
"4.2.3 NON-STRICT"
"4.2.4 OK"
"4.2.5 OK"
"5.1 OK"
"5.10 OK"

        // Verify data offset (4 bytes at position 31)
        assertEquals(130, SMBUtil.readInt4(dst, 31));

        // Verify setup count
        assertEquals(1, dst[35]);

        // Verify function (2 bytes at position 36)
        assertEquals(SmbComNtTransaction.NT_TRANSACT_QUERY_SECURITY_DESC, SMBUtil.readInt2(dst, 36));
    }

    @Test

            (byte) 49, (byte) 41, (byte) 33, (byte) 25, (byte) 17, (byte) 9, (byte) 1, (byte) 58, (byte) 50, (byte) 42, (byte) 34,
            (byte) 26, (byte) 18, (byte) 10, (byte) 2, (byte) 59, (byte) 51, (byte) 43, (byte) 35, (byte) 62, (byte) 54, (byte) 46,
            (byte) 38, (byte) 30, (byte) 22, (byte) 14, (byte) 6, (byte) 61, (byte) 53, (byte) 45, (byte) 37, (byte) 29, (byte) 21,

        // Entry 2: IPC$, type 3 (IPC), remark "Inter-Process Communication"
        System.arraycopy("IPC$".getBytes(StandardCharsets.US_ASCII), 0, data, 20, 4);
        data[34] = 0x03;
        data[35] = 0x00; // type = 3
        data[36] = 60;
        data[37] = 0;
        data[38] = 0;
        data[39] = 0; // remark offset

        // Remarks data

 *
 * <ol>
 *   <li>remove();
 *   <li>hasNext()
 *   <li>hasNext();
 *   <li>remove();
 *   <li>next();
 * </ol>
 *
 * <p>This particular order of operations may be unrealistic, and testing all 3^5 of them may be
 * thought of as overkill; however, it's difficult to determine which proper subset of this massive
 * set would be sufficient to expose any possible bug. Brute force is simpler.
 *

   * <p>For example, if {@code rangeMap} had the entries {@code [1, 5] => "foo", (6, 8) => "bar",
   * (10, ∞) => "baz"} then {@code rangeMap.subRangeMap(Range.open(3, 12))} would return a range map
   * with the entries {@code (3, 5] => "foo", (6, 8) => "bar", (10, 12) => "baz"}.
   *
   * <p>The returned range map supports all optional operations that this range map supports, except
   * for {@code asMapOfRanges().iterator().remove()}.
   *

    assertFalse(rangeSet.encloses(Range.greaterThan(5)));

    RangeSet<Integer> expectedComplement =
        ImmutableRangeSet.<Integer>builder()
            .add(Range.lessThan(1))
            .add(Range.closedOpen(3, 5))
            .add(Range.greaterThan(8))
            .build();

    assertEquals(expectedComplement, rangeSet.complement());
  }

  public void testMultipleBoundedBelowRanges() {

        String name2 = "DOMAIN          ";
        System.arraycopy(name2.getBytes("US-ASCII"), 0, src, srcIndex + 19, 16);
        src[srcIndex + 34] = 0x00; // hex code
        src[srcIndex + 35] = (byte) 0x84; // flags: group, active

        // Third name entry (18 bytes) - matching queryAddress
        String name3 = "TEST            ";
        System.arraycopy(name3.getBytes("US-ASCII"), 0, src, srcIndex + 37, 16);

    assertThat(
      mergeAdjacentDeltaMappedRanges(
        mutableListOf(
          InlineDelta(1, 5),
          InlineDelta(2, 5),
          InlineDelta(3, 5),
          MappedRange.External(4, "a".encodeUtf8()),
        ),
      ),
    ).containsExactly(
      InlineDelta(1, 5),
      MappedRange.External(4, "a".encodeUtf8()),
    )
  }