}).createPageNumberList());

        return elevateWordList;
    }

    /**
     * Retrieves a specific elevate word by its ID, including associated label type information.
     *
     * @param id the unique identifier of the elevate word
     * @return OptionalEntity containing the elevate word if found, or empty if not found
     */
    public OptionalEntity<ElevateWord> getElevateWord(final String id) {

import org.lastaflute.web.response.StreamResponse;

import jakarta.annotation.Resource;

/**
 * API action for admin elevate word management.
 * Provides RESTful API endpoints for managing elevate word settings in the Fess search engine.
 * Elevate words boost specific search terms to appear higher in search results.
 */
public class ApiAdminElevatewordAction extends FessApiAdminAction {

            suggester.indexer().deleteElevateWord(elevateWord.getSuggestWord(), apply);
        }
        refresh();
    }

    /**
     * Deletes a specific elevate word from the suggest index.
     *
     * @param word  The elevate word to delete.
     * @param apply true to apply the changes immediately.
     */
    public void deleteElevateWord(final String word, final boolean apply) {

    /**
     * Shows the main elevate word management page.
     *
     * @return HTML response for the elevate word list page
     */
    @Execute
    @Secured({ ROLE, ROLE + VIEW })
    public HtmlResponse index() {
        return asListHtml();
    }

    /**
     * Lists elevate words with pagination support.
     *

   * provides more control over the underlying data structure.
   *
   * @param expectedKeys the expected number of distinct keys
   * @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */
  public static <K extends @Nullable Object, V extends @Nullable Object>

        suggestHelper.suggester().createNextIndex();

        logger.info("Storing all bad words.");
        suggestHelper.storeAllBadWords(true);

        logger.info("Storing all elevate words.");
        suggestHelper.storeAllElevateWords(true);

        final AtomicInteger exitCode = new AtomicInteger(0);

        if (ComponentUtil.getFessConfig().isSuggestDocuments()) {

   * numbers of keys and values without rehashing.
   *
   * @param expectedKeys the expected number of distinct keys
   * @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */
  public static <K extends @Nullable Object, V extends @Nullable Object>

    // twice as many reads and writes. But benchmarking shows that they usually perform better than
    // Dolphin. Reversal is about as good as Successive on average, and it is much simpler,
    // especially since we already have a `reverse` method.
    checkNotNull(array);
    checkPositionIndexes(fromIndex, toIndex, array.length);
    if (array.length <= 1) {
      return;

    static final int MAX_RUN_MULTIPLIER = 13;

    /**
     * Checks the whole hash table for poor hash distribution. Takes O(n) in the worst case, O(n /
     * log n) on average.
     *
     * <p>The online hash flooding detecting in RegularSetBuilderImpl.add can detect e.g. many
     * exactly matching hash codes, which would cause construction to take O(n^2), but can't detect

     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to