return longBitsToDouble(significand | ONE_BITS);
  }

  static double bigToDouble(BigInteger x) {
    // This is an extremely fast implementation of BigInteger.doubleValue(). JDK patch pending.
    BigInteger absX = x.abs();
    int exponent = absX.bitLength() - 1;
    // exponent == floor(log2(abs(x)))
    if (exponent < Long.SIZE - 1) {
      return x.longValue();
    } else if (exponent > MAX_EXPONENT) {

    /**
     * Fetches more entries from the server.
     *
     * @return true if more entries were fetched, false otherwise
     * @throws CIFSException if an error occurs during fetching
     */
    protected abstract boolean fetchMore() throws CIFSException;

    /**
     * Gets the current batch of results.
     *
     * @return array of file entries in the current batch
     */

    /** Available send credits for flow control */
    protected final AtomicInteger sendCredits;
    /** Available receive credits for flow control */
    protected final AtomicInteger receiveCredits;
    /** Queue of pending RDMA work requests */
    protected final BlockingQueue<RdmaWorkRequest> pendingRequests;

    // Connection state
    /** Current connection state */
    protected volatile RdmaConnectionState state;

   */
  private static final SuccessorsFunction<Character> TWO_CYCLES_GRAPH =
      createDirectedGraph("ab", "ac", "bc", "cd", "da");

  /**
   * A tree-shaped graph that looks as follows (all edges are directed facing downwards):
   *
   * {@snippet :
   *        h
   *       /|\
   *      / | \
   *     /  |  \
   *    d   e   g
   *   /|\      |
   *  / | \     |
   * a  b  c    f
   * }
   */

   */
  private static final SuccessorsFunction<Character> TWO_CYCLES_GRAPH =
      createDirectedGraph("ab", "ac", "bc", "cd", "da");

  /**
   * A tree-shaped graph that looks as follows (all edges are directed facing downwards):
   *
   * {@snippet :
   *        h
   *       /|\
   *      / | \
   *     /  |  \
   *    d   e   g
   *   /|\      |
   *  / | \     |
   * a  b  c    f
   * }
   */

                availableReceiveRegions.size());
    }

    /**
     * Get a send region from the pool or allocate a new one
     *
     * @param minSize minimum required size
     * @return memory region for sending
     * @throws IOException if allocation fails
     */
    public RdmaMemoryRegion getSendRegion(int minSize) throws IOException {
        if (minSize <= sendBufferSize) {

///

/// tip

If you want to call `async` functions in your tests apart from sending requests to your FastAPI application (e.g. asynchronous database functions), have a look at the [Async Tests](../advanced/async-tests.md){.internal-link target=_blank} in the advanced tutorial.

///

    
    private void redistributePendingOperations(ChannelInfo failedChannel) {
        // Get pending operations from failed channel
        List<SMBMessage> pendingOps = failedChannel.getPendingOperations();
        
        if (pendingOps.isEmpty()) {
            return;
        }
        
        log.info("Redistributing {} pending operations from failed channel", 
            pendingOps.size());
        

# Contributing guidelines

## Pull Request Checklist

Before sending your pull requests, make sure you do the following:

-   Read the [contributing guidelines](CONTRIBUTING.md).
-   Read the [Code of Conduct](CODE_OF_CONDUCT.md).
-   Ensure you have signed the
    [Contributor License Agreement (CLA)](https://cla.developers.google.com/).
-   Check if your changes are consistent with the

            }
        }
        return target;
    }

    /**
     * Commits any remaining documents in the cache to the index.
     * This method ensures all pending documents are processed.
     */
    @Override
    public void commit() {
        synchronized (docList) {
            if (!docList.isEmpty()) {