@Override
    NavigableSet<V> getSortedSetDelegate() {
      return (NavigableSet<V>) super.getSortedSetDelegate();
    }

    @Override
    public @Nullable V lower(@ParametricNullness V v) {
      return getSortedSetDelegate().lower(v);
    }

    @Override
    public @Nullable V floor(@ParametricNullness V v) {
      return getSortedSetDelegate().floor(v);
    }

    @Override

        a full-time Guava team member. [Feedback](https://stackoverflow.com/a/4543114) from our
        users indicates that they really appreciate Guava's high power-to-weight ratio. It's
        important to us to keep Guava as easy to use and understand as we can. That means boiling
        features down to compact but powerful abstractions, and controlling feature bloat carefully.

 * non-ASCII input.
 *
 * @author Mike Bostock
 * @since 1.0
 */
@GwtCompatible
public enum CaseFormat {
  /**
   * Hyphenated variable naming convention, e.g., "lower-hyphen". This format is also colloquially
   * known as "kebab case".
   */
  LOWER_HYPHEN(CharMatcher.is('-'), "-") {
    @Override
    String normalizeWord(String word) {
      return Ascii.toLowerCase(word);
    }

 *
 * @author mike nonemacher
 */

@NullUnmarked
public class PopulatedCachesTest extends TestCase {
  // we use integers as keys; make sure the range covers some values that ARE cached by
  // Integer.valueOf(int), and some that are not cached. (127 is the highest cached value.)
  static final int WARMUP_MIN = 120;
  static final int WARMUP_MAX = 135;

      WildcardType wildcard = (WildcardType) componentType;
      Type[] lowerBounds = wildcard.getLowerBounds();
      checkArgument(lowerBounds.length <= 1, "Wildcard cannot have more than one lower bounds.");
      if (lowerBounds.length == 1) {
        return supertypeOf(newArrayType(lowerBounds[0]));
      } else {
        Type[] upperBounds = wildcard.getUpperBounds();

  /**
   * Applies a supplemental hash function to a given hash code, which defends against poor quality
   * hash functions. This is critical when the concurrent hash map uses power-of-two length hash
   * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper
   * bits.
   *
   * @param h hash code
   */
  static int rehash(int h) {
    // Spread bits to regularize both segment and index locations,

        verify(treeConnection).getConnectedShare();
    }

    @Test
    @DisplayName("isSameTree: different types and delegated compare")
    void isSameTreeCoversBranches() {
        // Covers non-impl (false) and impl path delegating to connection comparison
        // Not an impl -> false
        assertFalse(handle.isSameTree(mock(SmbTreeHandle.class)));

        // Impl case delegates to treeConnection.isSame

            assertEquals(600L, SMBUtil.readInt8(buffer, 56));
            assertEquals(4, SMBUtil.readInt4(buffer, 64));
        }

        @Test
        @DisplayName("Should handle power of two values")
        void testPowerOfTwoValues() {
            long powerOfTwoOffset = 1L << 32; // 2^32
            long powerOfTwoLength = 1L << 16; // 2^16
            int powerOfTwoFlags = 1 << 8; // 2^8

      other entities that control, are controlled by, or are under common
      control with that entity. For the purposes of this definition,
      "control" means (i) the power, direct or indirect, to cause the
      direction or management of such entity, whether by contract or
      otherwise, or (ii) ownership of fifty percent (50%) or more of the

        assertTrue(str.contains(specialRemark));
    }

    @Test
    @DisplayName("Test type masking with 0xFFFF")
    void testTypeMasking() {
        // Test that only lower 16 bits are considered for type determination
        int typeWithUpperBits = 0xFFFF0001; // Should be treated as type 1 (printer)
        SmbShareInfo info = new SmbShareInfo(TEST_NET_NAME, typeWithUpperBits, TEST_REMARK);