* that this method will return a different number of chars than would be returned by reading all
   * of the chars.
   *
   * <p>Additionally, for mutable sources such as {@code StringBuilder}s, a subsequent read may
   * return a different number of chars if the contents are changed.
   *
   * @since 19.0
   */
  public Optional<Long> lengthIfKnown() {

   * that this method will return a different number of chars than would be returned by reading all
   * of the chars.
   *
   * <p>Additionally, for mutable sources such as {@code StringBuilder}s, a subsequent read may
   * return a different number of chars if the contents are changed.
   *
   * @since 19.0
   */
  public Optional<Long> lengthIfKnown() {

   * value in the manner of {@link Number#shortValue}.
   *
   * <p>Elements are copied from the argument collection as if by {@code collection.toArray()}.
   * Calling this method is as thread-safe as calling that method.
   *
   * @param collection a collection of {@code Number} instances

   * value in the manner of {@link Number#floatValue}.
   *
   * <p>Elements are copied from the argument collection as if by {@code collection.toArray()}.
   * Calling this method is as thread-safe as calling that method.
   *
   * @param collection a collection of {@code Number} instances

            } catch (Exception e) {
                log.warn("Failed to clear KeyStore entries: {}", e.getMessage());
            }
        }
    }

    /**
     * Get the number of stored keys
     *
     * @return number of keys in memory
     */
    public int getKeyCount() {
        return sessionKeys.size();
    }

    /**
     * Check if a session key exists
     *

  /**
   * Keeps track of metadata like the number of hash table bits and modifications of this data
   * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note
   * that we choose not to make this volatile, so we do less of a "best effort" to track such
   * errors, for better performance.
   */
  private transient int metadata;

  /** The number of elements contained in the set. */

    /** Context ID for RDMA transform capabilities */
    public static final int CONTEXT_ID = Smb2Constants.SMB2_RDMA_TRANSFORM_CAPABILITIES;

    // Transform count and reserved fields
    private int transformCount = 1; // Number of transforms (always 1 for SMBDirect)
    private int reserved1 = 0;
    private int reserved2 = 0;

    // SMB_DIRECT_RDMA_TRANSFORM_V1
    private int rdmaTransformId = 0x0001; // SMB_DIRECT_RDMA_TRANSFORM_V1

        maxSafeDigits[i] = overflow.toString(i).length() - 1;
      }
    }

    /**
     * Returns true if (current * radix) + digit is a number too large to be represented by an
     * unsigned long. This is useful for detecting overflow while parsing a string representation of
     * a number. Does not verify whether supplied radix is valid, passing an invalid radix will give
     * undefined results or an ArrayIndexOutOfBoundsException.
     */

   *
   * <ul>
   *   <li>You want to assign the same fraction of inputs to each bucket.
   *   <li>When you reduce the number of buckets, you can accept that the most recently added
   *       buckets will be removed first. More concretely, if you are dividing traffic among tasks,
   *       you can decrease the number of tasks from 15 and 10, killing off the final 5 tasks, and

            assertEquals(3, response.getDfsResponse().getNumReferrals());
        }

        @ParameterizedTest
        @ValueSource(ints = { 1, 2, 5, 10 })
        @DisplayName("Should handle varying number of referrals")
        void testReadDataWireFormatVaryingReferrals(int numReferrals) {
            byte[] buffer = createDfsReferralBufferWithMultipleReferrals(numReferrals);