// Then: Tree handle should be released only once
        verify(treeHandle, times(1)).release();
    }

    @Test
    @DisplayName("Iterator should handle filter that rejects all entries")
    void testIterator_FilterRejectsAll() throws Exception {
        // Given: A filter that rejects everything
        when(locator.getType()).thenReturn(SmbConstants.TYPE_WORKGROUP);

 * such as those associated with files and directories. The Windows OS
 * determines which users have the necessary permissions to access objects
 * based on these entries.
 * <p>
 * To fully understand the information exposed by this class a description
 * of the access check algorithm used by Windows is required. The following

import org.codelibs.fess.util.ComponentUtil;

/**
 * Pager class for stemmer override dictionary management.
 *
 * This class provides pagination functionality for displaying stemmer override
 * dictionary entries in the administrative interface. It manages page state,
 * navigation controls, and provides methods for calculating page boundaries
 * and navigation elements.
 */
public class StemmerOverridePager implements Serializable {

        // Default constructor
    }

    /**
     * Retrieves a paginated list of stemmer override items from the specified dictionary.
     *
     * This method fetches stemmer override entries with pagination support, updating
     * the provided pager with the current page state and navigation information.
     *
     * @param dictId The ID of the stemmer override dictionary to query

    return new LinkedHashMap<>();
  }

  /**
   * Returns the platform preferred map implementation that preserves insertion order when used only
   * for insertions, with a hint for how many entries to expect.
   */
  static <K extends @Nullable Object, V extends @Nullable Object>
      Map<K, V> preservesInsertionOrderOnPutsMapWithExpectedSize(int expectedSize) {

  and decommissioning to provide a functionality that smaller deployments
  care about.

 * get}, {@code removeAll}, and {@code replaceValues} return collections that iterate through the
 * values according to the value comparator ordering or the natural ordering of the values. The
 * collections generated by {@code entries}, {@code keys}, and {@code values} iterate across the
 * keys according to the above key ordering, and for each key they iterate across the values
 * according to the value ordering.
 *

    /**
     * Create a new directory lease context
     *
     * @param key the lease key
     * @param leaseState requested lease state
     * @param scope cache scope for directory entries
     */
    public DirectoryLeaseContext(Smb2LeaseKey key, int leaseState, DirectoryCacheScope scope) {
        this.leaseKey = key;
        this.leaseState = leaseState;
        this.cacheScope = scope;

                for (MetadataGraphEdge e : ins) {
                    sb.append("       from :  ").append(e.toString()).append('\n');
                }
            } else {
                sb.append("      no entries\n");
            }

            List<MetadataGraphEdge> outs = getExcidentEdges(v);
            if (outs != null) {
                for (MetadataGraphEdge e : outs) {

  private static Manifest manifestClasspath(String classpath) throws IOException {
    return manifest("Class-Path: " + classpath + "\n");
  }

  private static void writeSelfReferencingJarFile(File jarFile, String... entries)
      throws IOException {
    Manifest manifest = new Manifest();
    // Without version, the manifest is silently ignored. Ugh!
    manifest.getMainAttributes().put(Attributes.Name.MANIFEST_VERSION, "1.0");