*/
  @CanIgnoreReturnValue
  @Override
  public int drainTo(Collection<? super E> c, int maxElements) {
    checkNotNull(c);
    checkArgument(c != this);
    if (maxElements <= 0) return 0;
    E[] items = this.items;
    Monitor monitor = this.monitor;
    monitor.enter();
    try {
      int i = takeIndex;
      int n = 0;
      int max = (maxElements < count) ? maxElements : count;
      while (n < max) {

     */
    @Override
    public int decode(final byte[] buffer, int bufferIndex, final int len) throws SMBProtocolDecodingException {
        final int start = bufferIndex;
        this.chunksWritten = SMBUtil.readInt4(buffer, bufferIndex);
        bufferIndex += 4;
        this.chunkBytesWritten = SMBUtil.readInt4(buffer, bufferIndex);
        bufferIndex += 4;
        this.totalBytesWritten = SMBUtil.readInt4(buffer, bufferIndex);

    private static final int MAX_INTITEM_LENGTH = 9;

    private static final int MAX_LONGITEM_LENGTH = 18;

    private String value;

    private String canonical;

    private ListItem items;

    private interface Item {
        int INT_ITEM = 3;
        int LONG_ITEM = 4;
        int BIGINTEGER_ITEM = 0;
        int STRING_ITEM = 1;
        int LIST_ITEM = 2;
        int COMBINATION_ITEM = 5;

   *     such index exists.
   */
  public static int indexOf(double[] array, double target) {
    return indexOf(array, target, 0, array.length);
  }

  // TODO(kevinb): consider making this public
  private static int indexOf(double[] array, double target, int start, int end) {
    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }

    mmHeap.add(2);
    mmHeap.add(3);
    assertEquals(4, (int) mmHeap.pollLast());
    assertEquals(3, (int) mmHeap.peekLast());
    assertEquals(3, (int) mmHeap.pollLast());
    assertEquals(1, (int) mmHeap.peek());
    assertEquals(2, (int) mmHeap.peekLast());
    assertEquals(2, (int) mmHeap.pollLast());
    assertEquals(1, (int) mmHeap.peek());
    assertEquals(1, (int) mmHeap.peekLast());
    assertEquals(1, (int) mmHeap.pollLast());

    private int flags;
    private String newNodeAddress;

    // Notification flags
    /** Resource state is unknown */
    public static final int WITNESS_RESOURCE_STATE_UNKNOWN = 0x00000000;
    /** Resource is available for use */
    public static final int WITNESS_RESOURCE_STATE_AVAILABLE = 0x00000001;
    /** Resource is unavailable */
    public static final int WITNESS_RESOURCE_STATE_UNAVAILABLE = 0x000000FF;

        long overallStart = System.nanoTime();

        for (int t = 0; t < threadCount; t++) {
            final int threadId = t;
            executor.submit(() -> {
                try {
                    startLatch.await();

                    long threadStart = System.nanoTime();
                    for (int i = 0; i < operationsPerThread; i++) {
                        try {

 *     inserting the element at `insertionPoint` will retain sorted order.
 */
inline fun binarySearch(
  position: Int,
  limit: Int,
  compare: (Int) -> Int,
): Int {
  // Do the binary searching bit.
  var low = position
  var high = limit - 1
  while (low <= high) {
    val mid = (low + high) / 2
    val compareResult = compare(mid)

     * result[2] = "root5"
     * result[3] = "link2\foo\bar.txt"
     */
    private static int dfsPathSplit(final String path, final String[] result) {
        int ri = 0;
        final int rlast = result.length - 1;
        int i = 0, b = 0;
        final int len = path.length();
        int strip = 0;

        do {
            if (ri == rlast) {
                result[rlast] = path.substring(b);

    void writeParametersWireFormat_writesCorrectly(int fid, int securityInformation) {
        NtTransQuerySecurityDesc cmd = new NtTransQuerySecurityDesc(fid, securityInformation);
        byte[] dst = new byte[15]; // Increased buffer size to accommodate offset + 8 bytes
        int offset = 3; // start in the middle to ensure no tail is overwritten
        int bytesWritten = cmd.writeParametersWireFormat(dst, offset);