/**
   * Closed addressing tends to perform well even with high load factors. Being conservative here
   * ensures that the table is still likely to be relatively sparse (hence it misses fast) while
   * saving space.
   */
  @VisibleForTesting static final double MAX_LOAD_FACTOR = 1.2;

  /**
   * Maximum allowed false positive probability of detecting a hash flooding attack given random
   * input.

      int expectedSize) {
    return new CompactLinkedHashSet<>(expectedSize);
  }

  private static final int ENDPOINT = -2;

  // TODO(user): predecessors and successors should be collocated (reducing cache misses).
  // Might also explore collocating all of [hash, next, predecessor, successor] fields of an
  // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2

  /**

import jakarta.annotation.PostConstruct;

/**
 * Helper class for document processing and manipulation in the Fess search system.
 * This class provides utilities for processing document content, titles, and digests,
 * handling text normalization, content extraction, and similar document hash encoding/decoding.
 * It also manages document processing requests and integrates with the crawler system.
 *
 */
public class DocumentHelper {