checkTryParse(Double.POSITIVE_INFINITY, "Infinity");
    checkTryParse(Double.POSITIVE_INFINITY, "+Infinity");
    checkTryParse(Double.NEGATIVE_INFINITY, "-Infinity");
  }

  private static final String[] BAD_TRY_PARSE_INPUTS = {
    "",
    "+-",
    "+-0",
    " 5",
    "32 ",
    " 55 ",
    "infinity",
    "POSITIVE_INFINITY",
    "0x9A",
    "0x9A.bE-5",
    ".",

        return readShort() & 0xffff;
    }

    /**
     * Reads a Windows FILETIME value and converts it to a Date.
     * @return the Date object, or null if the time represents infinity
     * @throws IOException if an I/O error occurs
     */
    public Date readFiletime() throws IOException {
        Date date = null;

        final long last = readUnsignedInt();

    String hex = "(?:[0-9a-fA-F]+#(?:\\.[0-9a-fA-F]*#)?|\\.[0-9a-fA-F]+#)";
    String completeHex = "0[xX]" + hex + "[pP][+-]?\\d+#[fFdD]?";
    String fpPattern = "[+-]?(?:NaN|Infinity|" + completeDec + "|" + completeHex + ")";
    fpPattern =
        fpPattern.replace(
            "#",
            "+"
            );
    return
    java.util.regex.Pattern
        .compile(fpPattern);

  // algorithm would lead to an overflow.

  static boolean fitsInInt(long x) {
    return (int) x == x;
  }

  /**
   * Returns the arithmetic mean of {@code x} and {@code y}, rounded toward negative infinity. This
   * method is resilient to overflow.
   *
   * @since 14.0
   */
  public static long mean(long x, long y) {
    // Efficient method for computing the arithmetic mean.

    }

    private ChannelInfo selectWithAffinity(CommonServerMessageBlock message, Collection<ChannelInfo> channels) {
        // Use file handle or tree ID for affinity
        long affinityKey = 0;

        // Use tree ID for SMB2 requests for affinity
        if (message instanceof ServerMessageBlock2Request) {
            ServerMessageBlock2Request smb2Request = (ServerMessageBlock2Request) message;

    PAST(Timeout.MIN, Timeout.MINUS_SMALL, Timeout.ZERO),
    FUTURE(Timeout.SMALL, Timeout.MAX),
    SMALL(Timeout.SMALL),
    FINITE(Timeout.MIN, Timeout.MINUS_SMALL, Timeout.ZERO, Timeout.SMALL),
    INFINITE(Timeout.LARGE, Timeout.MAX);

    final ImmutableList<Timeout> timeouts;

    TimeoutsToUse(Timeout... timeouts) {
      this.timeouts = ImmutableList.copyOf(timeouts);
    }
  }

   * otherwise, the rounding will choose between the two nearest representable values with {@code
   * mode}.
   *
   * <p>For the case of {@link RoundingMode#HALF_DOWN}, {@code HALF_UP}, and {@code HALF_EVEN},
   * infinite {@code double} values are considered infinitely far away. For example, 2^2000 is not
   * representable as a double, but {@code roundToDouble(BigDecimal.valueOf(2).pow(2000), HALF_UP)}

    /**
     * Maximum timeout for durable handles (5 minutes)
     */
    public static final long MAX_DURABLE_TIMEOUT = 300000;

    /**
     * Persistent handles have infinite timeout
     */
    public static final long PERSISTENT_TIMEOUT = 0;

    /**
     * Private constructor to prevent instantiation
     */
    private Smb2HandleCapabilities() {
        // Utility class
    }

        loadBalancer.setStrategy(LoadBalancingStrategy.AFFINITY_BASED);

        Smb2ReadRequest readRequest = mock(Smb2ReadRequest.class);
        when(readRequest.getTreeId()).thenReturn(123); // Set consistent tree ID for affinity

        when(mockChannelManager.getHealthyChannels()).thenReturn(Arrays.asList(channel1, channel2));

        // Multiple calls with same file ID should return same channel

     * Select the least busy channel based on pending operations
     */
    LEAST_LOADED,

    /**
     * Weighted random selection based on channel scores
     */
    WEIGHTED_RANDOM,

    /**
     * Affinity-based selection for related operations
     */
    AFFINITY_BASED,

    /**
     * Adaptive selection based on operation type and performance
     */
    ADAPTIVE