* when hasNext() is false, so that next() throws a NoSuchElementException, then subsequent calls
   * to remove() will incorrectly throw an IllegalStateException, instead of removing the last
   * element returned.
   *
   * <p>See <a href="https://bugs.openjdk.org/browse/JDK-6529795">JDK-6529795</a>
   */
  static class IteratorWithJdkBug6529795<T> implements Iterator<T> {

     * Handles both regular API calls and plugin requests.
     *
     * @param request  the HTTP servlet request
     * @param response the HTTP servlet response
     * @param path     the request path after removing the prefix
     */
    protected void processRequest(final HttpServletRequest request, final HttpServletResponse response, final String path) {
        if ("/_plugin".equals(path) || path.startsWith("/_plugin/")) {

     */
    protected CrawlingInfoService getCrawlingInfoService() {
        return ComponentUtil.getComponent(CrawlingInfoService.class);
    }

    /**
     * Extracts the canonical session ID by removing any suffix after the first hyphen.
     * If the session ID contains a hyphen, returns the portion before the first hyphen.
     * Otherwise, returns the original session ID.
     *

                }
                exitCode.set(1);
            }
        }

        logger.info("Replacing new suggest index.");
        suggestHelper.suggester().switchIndex();

        logger.info("Removing old indices.");
        suggestHelper.suggester().removeDisableIndices();

        return exitCode.get();
    }

    private int purge(final LocalDateTime time) {

    public void test_FilePurgeVisitor_getDocId() throws IOException {
        // Test the getDocId logic without creating actual FilePurgeVisitor
        // The logic converts path to doc ID by removing path separators
        String pathStr = "_1/_2/docid123";
        String expectedDocId = "_1_2docid123";
        String actualDocId = pathStr.replace("/", "").replace("\\", "");

import org.jspecify.annotations.Nullable;

/**
 * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that
 * matches the insertion order. All optional operations (adding and removing) are supported. All
 * elements, including {@code null}, are permitted.
 *
 * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)

    return result[0] == oldCount;
  }

  @Override
  public void clear() {
    if (!range.hasLowerBound() && !range.hasUpperBound()) {
      // We can do this in O(n) rather than removing one by one, which could force rebalancing.
      for (AvlNode<E> current = header.succ(); current != header; ) {
        AvlNode<E> next = current.succ();

        current.elemCount = 0;

 * }
 *
 * <p>{@link NetworkBuilder#build()} returns an instance of {@link MutableNetwork}, which is a
 * subtype of {@code Network} that provides methods for adding and removing nodes and edges. If you
 * do not need to mutate a network (e.g. if you write a method than runs a read-only algorithm on
 * the network), you should use the non-mutating {@link Network} interface, or an {@link
 * ImmutableNetwork}.

 *
 * <p>The iteration ordering of the collections generated by {@code keySet}, {@code keys}, and
 * {@code asMap} has a few subtleties. As long as the set of keys remains unchanged, adding or
 * removing mappings does not affect the key iteration order. However, if you remove all values
 * associated with a key and then add the key back to the multimap, that key will come last in the
 * key iteration order.
 *

                docList.stream().forEach(doc -> {
                    if (!thumbnailManager.offer(doc)) {
                        if (logger.isDebugEnabled()) {
                            logger.debug("Removing {}={} from doc[{}]", thumbnailField, doc.get(thumbnailField),
                                    doc.get(fessConfig.getIndexFieldUrl()));
                        }
                        doc.remove(thumbnailField);