for (SmbTransportImpl transport : connections) {
            try {
                // Check if connection has been idle too long
                // Note: getLastUseTime() method would need to be added to SmbTransportImpl
                // For now, we'll use a simple disconnected check
                if (transport.isDisconnected()) {
                    idle.add(transport);

 *       hunt through classes like {@link Arrays} and {@link Ints} for them.
 *   <li>Supports a copy-free {@link #subArray} view, so methods that accept this type don't need to
 *       add overloads that accept start and end indexes.
 *   <li>Can be streamed without "breaking the chain": {@code foo.getBarInts().stream()...}.

 *       hunt through classes like {@link Arrays} and {@link Longs} for them.
 *   <li>Supports a copy-free {@link #subArray} view, so methods that accept this type don't need to
 *       add overloads that accept start and end indexes.
 *   <li>Can be streamed without "breaking the chain": {@code foo.getBarLongs().stream()...}.

   * matches.
   *
   * <p>On the other hand, if for example we are resolving {@code List<A extends B>} to {@code
   * List<A extends String>}, we need to compare that {@code <A extends B>} is unequal to {@code <A
   * extends String>} in order to decide to use the transformed type instead of the original type.
   */
  static final class TypeVariableKey {

        int off = 0;
        final int tot = buf.getLength() - 24;
        while (off < tot) {
            int fragSize = tot - off;
            if (24 + fragSize > this.max_xmit) {
                // need fragementation
                msg.flags &= ~DCERPC_LAST_FRAG;
                fragSize = this.max_xmit - 24;
            } else {
                msg.flags |= DCERPC_LAST_FRAG;
                msg.alloc_hint = fragSize;

    assertThat(result).containsExactly(1, 15, 13, 8, 14);
  }

  /**
   * This tests a special case of the removeAt() call. Moving an element sideways on the heap could
   * break the invariants. Sometimes we need to bubble an element up instead of trickling down. See
   * implementation.
   */
  public void testInvalidatingRemove() {
    MinMaxPriorityQueue<Integer> mmHeap = MinMaxPriorityQueue.create();
    mmHeap.addAll(

    * If you have to use the legacy in-tree cloud providers, you can rearrange your config like the example below. In case you need the `cloud-config` file (located in `{cloud-config-path}`), you can mount it into the API Server and controller-manager containers using ExtraVolumes like the example below.

   * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each
   * having a hash table of size eight. Providing a large enough estimate at construction time
   * avoids the need for expensive resizing operations later, but setting this value unnecessarily
   * high wastes memory.
   *
   * @return this {@code CacheBuilder} instance (for chaining)

        when(response.getHeaderStart()).thenReturn(0);

        // Note: Due to bug in line 96 (commented out bufferIndex = bufferOffset),
        // the decode starts at bufferIndex=8 instead of dataOffset=80
        // So we need to write data at bufferIndex=8

        // Write first FileBothDirectoryInfo at bufferIndex=8
        SMBUtil.writeInt4(104, buffer, 8); // NextEntryOffset to second entry
        SMBUtil.writeInt4(0, buffer, 12); // FileIndex

    }
    
    @Override
    public RdmaMemoryRegion registerMemory(ByteBuffer buffer, 
                                          EnumSet<RdmaAccess> access) throws IOException {
        // TCP doesn't need real memory registration
        return new TcpMemoryRegion(buffer, access);
    }
    
    @Override
    public String getProviderName() {
        return "TCP Fallback";
    }
    
    @Override