"DCERPC_FAULT_NDR should be in standard range");

        // Extended fault codes (0x1C000000 range)
        assertTrue((DcerpcError.DCERPC_FAULT_INVALID_TAG & 0xFF000000) == 0x1C000000, "DCERPC_FAULT_INVALID_TAG should be in 0x1C range");
        assertTrue((DcerpcError.DCERPC_FAULT_CONTEXT_MISMATCH & 0xFF000000) == 0x1C000000,
                "DCERPC_FAULT_CONTEXT_MISMATCH should be in 0x1C range");

 *
 * @author Louis Wasserman
 */
@NullUnmarked
public class HashMultisetAddPresentBenchmark {
  private static final int ARRAY_MASK = 0x0ffff;
  private static final int ARRAY_SIZE = 0x10000;
  List<Multiset<Integer>> multisets = new ArrayList<>(0x10000);
  int[] queries = new int[ARRAY_SIZE];

  @BeforeExperiment
  void setUp() {
    Random random = new Random();
    multisets.clear();
    for (int i = 0; i < ARRAY_SIZE; i++) {

        // The validation in getBuffer() ensures size is within bounds (0 < size <= 1MB)
        assertTrue(buffer.length > 0, "Buffer size should be positive");
        assertTrue(buffer.length <= 0x100000, "Buffer size should not exceed 1MB");
    }

    /**
     * Test that releaseBuffer validates buffer before accepting it.
     */
    @Test
    public void testReleaseBufferValidation() {

    private BufferCache() {
        // Utility class - not instantiable
    }

    private static final int MAX_BUFFERS = Config.getInt("jcifs.smb1.smb.maxBuffers", 16);
    private static final int MAX_BUFFER_SIZE = 0x100000; // 1MB maximum

    // Use concurrent queue for lock-free operations
    private static final java.util.concurrent.ConcurrentLinkedQueue<byte[]> bufferQueue =
            new java.util.concurrent.ConcurrentLinkedQueue<>();

     */
    int NTLMSSP_NEGOTIATE_TARGET_INFO = 0x00800000;

    /**
     * Indicates that the NTLM version is included in the message.
     */
    int NTLMSSP_NEGOTIATE_VERSION = 0x2000000;

    /**
     * Indicates that 128-bit encryption is supported.
     */
    int NTLMSSP_NEGOTIATE_128 = 0x20000000;

    /**
     * Request explicit key exchange
     */

 * the order of magnitude of the generated values uniformly at random.
 *
 * @author Louis Wasserman
 */
@NullUnmarked
final class MathBenchmarking {
  static final int ARRAY_SIZE = 0x10000;
  static final int ARRAY_MASK = 0x0ffff;
  static final Random RANDOM_SOURCE = new Random(314159265358979L);
  static final int MAX_EXPONENT = 100;

  /*
   * Duplicated from LongMath.

    /**
     * Permission to synchronize with the file
     */
    int SYNCHRONIZE = 0x00100000; // 20
    /**
     * Generic all permissions
     */
    int GENERIC_ALL = 0x10000000; // 28
    /**
     * Generic execute permission
     */
    int GENERIC_EXECUTE = 0x20000000; // 29
    /**
     * Generic write permission
     */
    int GENERIC_WRITE = 0x40000000; // 30
    /**

      table.map(-1, Buffer())
    }
    table.map(0, Buffer()) // Lowest legal code point.
    table.map(0x10ffff, Buffer()) // Highest legal code point.
    assertFailsWith<IllegalArgumentException> {
      table.map(0x110000, Buffer())
    }
  }

  @Test fun binarySearchEvenSizedRange() {
    val table = listOf(1, 3, 5, 7, 9, 11)

    // Search for matches.

    /** Permission to synchronize with the file */
    public static final int SYNCHRONIZE = 0x00100000; // 20
    /** Generic all permissions */
    public static final int GENERIC_ALL = 0x10000000; // 28
    /** Generic execute permission */
    public static final int GENERIC_EXECUTE = 0x20000000; // 29
    /** Generic write permission */
    public static final int GENERIC_WRITE = 0x40000000; // 30

            val low = (if (i + 1 < limit) this[i + 1] else '\u0000')
            if (c.isLowSurrogate() || !low.isLowSurrogate()) {
              '?'.code
            } else {
              i++
              0x010000 + (c.code and 0x03ff shl 10 or (low.code and 0x03ff))
            }
          }

          else -> c.code
        }
      i++
    }
    return result
  }