int elements = Queues.drain(q, buf, -1, MAX_VALUE, NANOSECONDS);
    assertEquals(0, elements);
    assertThat(buf).isEmpty();

    // Free the producer thread, and give subsequent tests a clean slate.
    q.take();
  }

  public void testDrain_throws() throws Exception {
    for (BlockingQueue<Object> q : blockingQueues()) {
      checkDrainThrows(q);
    }
  }

     */
    private String getConnectionKey(SmbTransportImpl transport) {
        // Use toString() method which includes port information
        // Format is typically: Transport[address:port,state=...]
        String transportStr = transport.toString();
        int startBracket = transportStr.indexOf('[');
        int endBracket = transportStr.indexOf(',');

            try {
                return send0(loc, request, response, params);
            } catch (final SmbException smbe) {
                // Retrying only makes sense if the invalid parameter is an tree id. If we have a stale file descriptor
                // retrying make no sense, as it will never become available again.
                if (params.contains(RequestParam.NO_RETRY)

#### Content Encryption

    protected LogHelper logHelper;

    /**
     * Factory for creating crawler clients.
     */
    protected CrawlerClientFactory clientFactory;

    /**
     * Context object containing crawler state and configuration.
     */
    protected CrawlerContext crawlerContext;

    /**
     * Flag indicating whether to wait on folder operations.
     */
    protected boolean noWaitOnFolder = false;

            } catch (RuntimeException e) {
                // Accept runtime exceptions that might be thrown due to closed state
                assertTrue(e.getMessage() != null, "Exception should have a message: " + e.getClass().getSimpleName());
            }

            try {
                digest.verify(data, 0, data.length, 0, response);

	done := ctx.Done()
	scannerLogPrefix := color.Green("folder-scanner:")

	noWait := func() {}

	thisHash := hashPath(folder.name)
	// Store initial compaction state.
	wasCompacted := into.Compacted

	for {
		select {
		case <-done:
			return ctx.Err()
		default:
		}
		var abandonedChildren dataUsageHashMap
		if !into.Compacted {

		}
	}
	tx.Statement.RaiseErrorOnNotFound = true
	tx.Statement.Dest = dest
	return tx.callbacks.Query().Execute(tx)
}

// Take finds the first record returned by the database in no specified order, matching given conditions conds
func (db *DB) Take(dest interface{}, conds ...interface{}) (tx *DB) {
	tx = db.Limit(1)
	if len(conds) > 0 {

      } finally {
        monitor.leave();
      }
    } else {
      return null;
    }
  }

  @CanIgnoreReturnValue // pushed down from class to method
  @Override
  public E take() throws InterruptedException {
    Monitor monitor = this.monitor;
    monitor.enterWhen(notEmpty);
    try {
      return q.poll();
    } finally {
      monitor.leave();
    }
  }

        @SuppressWarnings("nullness") // safe because we pass sort() a range that contains real Ts
        T[] castBuffer = (T[]) buffer;
        // We've already taken O(k log k), let's make sure we don't take longer than O(k log k).
        sort(castBuffer, left, right + 1, comparator);
        break;
      }
    }
    bufferSize = k;

    threshold = uncheckedCastNullableTToT(buffer[minThresholdPosition]);