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) {

            // Write minimal PAC header
            dos.writeInt(Integer.reverseBytes(3)); // 3 buffers
            dos.writeInt(Integer.reverseBytes(PacConstants.PAC_VERSION));

            // Write buffer entries
            dos.writeInt(Integer.reverseBytes(PacConstants.LOGON_INFO));
            dos.writeInt(Integer.reverseBytes(10));
            dos.writeLong(Long.reverseBytes(100));

                subProjectToClassTimes[it.name] = emptyList()
            }
        }

        val subProjectTestClassTimes: List<SubprojectTestClassTime> =
            subProjectToClassTimes
                .entries
                .filter { "UNKNOWN" != it.key }
                .filter { model.subprojects.getSubprojectByName(it.key) != null }
                .map {
                    SubprojectTestClassTime(

        // 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);

                  protected SortedMap<String, String> create(Entry<String, String>[] entries) {
                    TreeBasedTable<String, String, String> table = TreeBasedTable.create();
                    table.put("a", "b", "c");
                    table.put("c", "b", "a");
                    table.put("a", "a", "d");
                    for (Entry<String, String> entry : entries) {
                      table.put("b", entry.getKey(), entry.getValue());

  K checkKey(K key) {
    return checkNotNull(key);
  }

  @Override
  V checkValue(V value) {
    return checkNotNull(value);
  }

  /**
   * @serialData the key class, value class, number of entries, first key, first value, second key,
   *     second value, and so on.
   */
  @GwtIncompatible // java.io.ObjectOutputStream
  private void writeObject(ObjectOutputStream stream) throws IOException {

 * 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

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