}
            return maxBandwidthChannel != null ? maxBandwidthChannel : channels.iterator().next();
        }

        if (isMetadataOperation(message)) {
            // For metadata operations, prefer low-latency channels
            return selectLeastLoaded(channels);
        }

        // Default to weighted random for general operations
        return selectWeightedRandom(channels);
    }

        dst[++dstIndex] = (byte) (val >> 8);
    }

    static long readTime(final byte[] src, final int srcIndex) {
        final int low = readInt4(src, srcIndex);
        final int hi = readInt4(src, srcIndex + 4);
        final long t = (long) hi << 32L | low & 0xFFFFFFFFL;
        return t / 10000L - MILLISECONDS_BETWEEN_1970_AND_1601;
    }

    static void writeTime(long t, final byte[] dst, final int dstIndex) {

she stood watching them, and he checked himself suddenly:  the
others looked round also, and all of them bowed low.

  `Would you tell me,' said Alice, a little timidly, `why you are
painting those roses?'

  Five and Seven said nothing, but looked at Two.  Two began in a
low voice, `Why the fact is, you see, Miss, this here ought to
have been a RED rose-tree, and we put a white one in by mistake;

        }
    }

    @Test
    @DisplayName("Should evict oldest leases when max limit reached")
    void testMaxLeaseEviction() throws InterruptedException {
        // Create a context with low max lease limit
        Configuration limitedConfig = mock(Configuration.class);
        CIFSContext limitedContext = mock(CIFSContext.class);
        when(limitedContext.getConfig()).thenReturn(limitedConfig);

   * and because threads are typically not bound to CPUS forever,
   * may not occur at all. However, despite these limitations,
   * observed contention rates are typically low in these cases.
   *
   * It is possible for a Cell to become unused when threads that
   * once hashed to it terminate, as well as in the case where
   * doubling the table causes no thread to hash to it under

        // Fill with basic SMB header structure
        System.arraycopy(new byte[] { (byte) 0xFF, 'S', 'M', 'B' }, 0, buffer, 0, 4);
        buffer[4] = 1; // wordCount
        buffer[7] = 0; // byteCount low
        buffer[8] = 0; // byteCount high

        assertDoesNotThrow(() -> response.decode(buffer, 0));
    }

    @Test
    @DisplayName("Test writeParameterWordsWireFormat")

        .withFeatures(features)
        .suppressing(parentBuilder.getSuppressedTests())
        .createTestSuite();
  }

  /**
   * Returns an array of four bogus elements that will always be too high or too low for the
   * display. This includes two values for each extreme.
   *
   * <p>This method (dangerously) assume that the strings {@code "!! a"} and {@code "~~ z"} will

  /** True if this connect was canceled; typically because it lost a race. */
  @Volatile private var canceled = false

  // These properties are initialized by connect() and never reassigned.

  /** The low-level TCP socket. */
  private var rawSocket: JavaNetSocket? = null

  /**
   * The application layer socket. Either an [SSLSocket] layered over [rawSocket], or [rawSocket]
   * itself if this connection does not use SSL.

    boolean set(long bitIndex) {
      if (get(bitIndex)) {
        return false;
      }

      int longIndex = (int) (bitIndex >>> LONG_ADDRESSABLE_BITS);
      long mask = 1L << bitIndex; // only cares about low 6 bits of bitIndex

      long oldValue;
      long newValue;
      do {
        oldValue = data.get(longIndex);
        newValue = oldValue | mask;
        if (oldValue == newValue) {

        assertEquals((byte) 0xFF, buf[1], "AndX command should be 0xFF when no chaining");
        assertEquals((byte) 0x00, buf[2], "Reserved byte must be 0");
        assertEquals((byte) 0xDE, buf[3], "Sentinel low offset when no chaining");
        assertEquals((byte) 0xDE, buf[4], "Sentinel high offset when no chaining");
        assertNull(block.andx, "andx should be cleared when not chaining");
    }

    @Test