*     the thread's interrupt status is set
   * @since 11.0
   */
  public Map<K, V> loadAll(Iterable<? extends K> keys) throws Exception {
    // This will be caught by getAll(), causing it to fall back to multiple calls to
    // LoadingCache.get
    throw new UnsupportedLoadingOperationException();
  }

  /**
   * Returns a cache loader that uses {@code function} to load keys, without supporting either

   * input.
   */
  @VisibleForTesting(
      )
  static final double HASH_FLOODING_FPP = 0.001;

  /**
   * Maximum allowed length of a hash table bucket before falling back to a j.u.LinkedHashMap-based
   * implementation. Experimentally determined.
   */
  private static final int MAX_HASH_BUCKET_LENGTH = 9;

        // When
        int bytesEncoded = info.encode(buffer, dstIndex);

        // Then
        assertEquals(40, bytesEncoded); // Should encode 40 bytes
        // Use SMBUtil to read times back properly
        assertEquals(TEST_CREATE_TIME, SMBUtil.readTime(buffer, dstIndex));
        assertEquals(TEST_LAST_ACCESS_TIME, SMBUtil.readTime(buffer, dstIndex + 8));

    void available_smb1_disconnectedStatuses(int status) throws Exception {
        // Verify SMB1 path: disconnected/server-closed statuses yield 0 and mark fd closed
        SmbPipeInputStream stream = newStreamWithInit(false);

        when(handle.ensureOpen()).thenReturn(fd);
        when(fd.getTree()).thenReturn(tree);
        when(tree.isSMB2()).thenReturn(false);

     * <p>
     * The {@link Traverser} returned by this method uses the path where the specified class can be referenced by its FQN as the root.
     * For example, if the specified class is <code>foo.Bar</code> and its class file is located at <code>classes/foo/Bar.class</code>,
     * the {@link Traverser} returned by this method will handle the collection of resources under the <code>classes</code> directory.
     * </p>
     *
     * @param referenceClass

  public void testTreeMapDerived() {
    TreeMap<Derived, Integer> map = Maps.newTreeMap();
    assertEquals(emptyMap(), map);
    map.put(new Derived("foo"), 1);
    map.put(new Derived("bar"), 2);
    assertThat(map.keySet()).containsExactly(new Derived("bar"), new Derived("foo")).inOrder();
    assertThat(map.values()).containsExactly(2, 1).inOrder();
    assertThat(map.comparator()).isNull();
  }

  public void testTreeMapNonGeneric() {

            }
            return null;
        }
        return permission;
    }

    /**
     * Decodes a search role format string back to a permission string.
     * Reverses the encoding process to restore original permission format.
     *
     * @param value the encoded permission string to decode

        byte[] buffer = new byte[1024];
        int written = trans2FindNext2.writeParametersWireFormat(buffer, 0);

        // Verify filename is written and can be read back
        String actualFilename = readString(buffer, 12, written - 12);
        assertEquals(filename, actualFilename);
    }

    @Test
    void testResetMultipleTimes() {

    /**
     * Check if cache needs refresh
     *
     * @return true if refresh needed
     */
    public boolean needsRefresh() {
        return isExpired() || hasChanges;
    }

    /**
     * Mark the cache as complete (full enumeration cached)
     */
    public void markComplete() {
        lock.writeLock().lock();
        try {
            this.isComplete = true;
            this.hasChanges = false;

            esac
        then
            arg=$( cygpath --path --ignore --mixed "$arg" )
        fi
        # Roll the args list around exactly as many times as the number of
        # args, so each arg winds up back in the position where it started, but
        # possibly modified.
        #
        # NB: a `for` loop captures its iteration list before it begins, so