"vostre", "mi", "ti", "ci", "vi", "lo", "la", "li", "le", "gli", "ne", "il", "un", "uno", "una", "ma", "ed", "se", "perché", "anche", "come", "dov", "dove", "che", "chi", "cui", "non", "più", "quale", "quanto", "quanti", "quanta", "quante", "quello", "quelli", "quella", "quelle", "questo", "questi", "questa", "queste", "si", "tutto", "tutti", "a", "c", "e", "i", "l", "o", "ho", "hai", "ha", "abbiamo", "avete", "hanno", "abbia", "abbiate", "abbiano", "avrò", "avrai", "avrà", "avremo", "avrete", "avranno",...

"vostre", "mi", "ti", "ci", "vi", "lo", "la", "li", "le", "gli", "ne", "il", "un", "uno", "una", "ma", "ed", "se", "perché", "anche", "come", "dov", "dove", "che", "chi", "cui", "non", "più", "quale", "quanto", "quanti", "quanta", "quante", "quello", "quelli", "quella", "quelle", "questo", "questi", "questa", "queste", "si", "tutto", "tutti", "a", "c", "e", "i", "l", "o", "ho", "hai", "ha", "abbiamo", "avete", "hanno", "abbia", "abbiate", "abbiano", "avrò", "avrai", "avrà", "avremo", "avrete", "avranno",...

labels.dict_synonym_link_delete=Löschen
labels.dict_synonym_link_details=Details
labels.dict_synonym_link_download=Herunterladen
labels.dict_synonym_link_upload=Hochladen
labels.dict_synonym_source=Quelle
labels.dict_synonym_target=Ziel
labels.dict_synonym_button_download=Herunterladen
labels.dict_synonym_button_upload=Hochladen
labels.dict_synonym_file=Synonymdatei

                }
            }
        }
        return OptionalEntity.empty();
    }

    /**
     * Processes the search log queue.
     *
     * @param queue The search log queue.
     */
    protected void processSearchLogQueue(final Queue<SearchLog> queue) {
        final FessConfig fessConfig = ComponentUtil.getFessConfig();
        final String value = fessConfig.getPurgeByBots();
        String[] botNames;

 * index names, shard counts, and replica counts for queue, data, and filter indices.
 */
public class FessCrawlerConfig extends OpenSearchCrawlerConfig {

    /**
     * Default constructor.
     */
    public FessCrawlerConfig() {
        super();
    }

    /**
     * Gets the name of the queue index for the crawler.
     *
     * @return the queue index name
     */
    @Override

        } catch (final Exception e) {
            maxBufferSize = 1000;
        }
        queue.offer(event);
        if (size.incrementAndGet() > maxBufferSize) {
            if (queue.poll() != null) {
                size.decrementAndGet();
            }
        }
    }

    /**
     * Drains all events from the buffer and returns them as a list.

            }
        }
        return true;
    }

    /**
     * Stores child URLs from the given set into the crawling queue for future processing.
     * This method filters out blank URLs and increments the depth for child URLs.
     *
     * @param urlQueue the parent URL queue item
     * @param childUrlSet the set of child URLs to be queued for crawling
     */

            errorsField.setAccessible(true);
            Queue<String> errors = (Queue<String>) errorsField.get(null);
            errors.clear();
        } catch (Exception e) {
            // Ignore if field doesn't exist
        }

        // Add some errors to the queue
        Crawler.addError("Error 1");
        Crawler.addError("Error 2");

import org.opensearch.index.query.functionscore.RandomScoreFunctionBuilder;
import org.opensearch.search.sort.SortBuilders;
import org.opensearch.search.sort.SortOrder;

/**
 * Fess-specific URL queue service that extends OpenSearch URL queue functionality.
 * This service provides customized URL fetching strategies including sequential and random ordering
 * based on crawling configuration parameters.
 */

    /**
     * Gets the delay time in milliseconds when there are no URLs in the queue.
     *
     * @return the delay time in milliseconds when no URLs are available
     */
    public long getDelayMillisAtNoUrlInQueue() {
        return delayMillisAtNoUrlInQueue;
    }

    /**
     * Sets the delay time in milliseconds when there are no URLs in the queue.
     *