}
        stream(ComponentUtil.getFessConfig().getSearchDefaultPermissionsAsArray()).of(stream -> stream.forEach(name -> {
            defaultRoleList.add(name);
        }));
    }

    /**
     * Builds a set of roles from the request.
     * @param searchRequestType The type of the search request.
     * @return A set of roles.
     */
    public Set<String> build(final SearchRequestType searchRequestType) {

     * @param methodInfos array of methods we are searching to match
     * @param upcastCount current number of methods we have matched
     * @return count of matched methods
     */
    private static int getAccessibleMethods(Class<?> clazz, MethodInfo[] methodInfos, int upcastCount) {
        int l = methodInfos.length;

        // if this class is public, then check each of the currently

    /**
     * {@return the group identifier of the artifact}.
     *
     * @see ArtifactCoordinates#getGroupId()
     */
    @Nonnull
    String getGroupId();

    /**
     * {@return the identifier of the artifact}.
     *
     * @see ArtifactCoordinates#getArtifactId()
     */
    @Nonnull
    String getArtifactId();

    /**
     * {@return the version of the artifact}.

import java.util.TreeSet;
import org.jspecify.annotations.Nullable;

/**
 * Implementation of {@code Multimap} whose keys and values are ordered by their natural ordering or
 * by supplied comparators. In all cases, this implementation uses {@link Comparable#compareTo} or
 * {@link Comparator#compare} instead of {@link Object#equals} to determine equivalence of
 * instances.
 *

    }

    /**
     * Gets the list of page numbers for pagination navigation.
     *
     * @return the list of page numbers
     */
    public List<Integer> getPageNumberList() {
        return pageNumberList;
    }

    /**
     * Sets the list of page numbers for pagination navigation.
     *
     * @param pageNumberList the list of page numbers
     */

// Copyright (c) 2015-2024 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

 * the cleanup of old documents during updates.</p>
 */
public class IndexingHelper {
    /** Logger for this class */
    private static final Logger logger = LogManager.getLogger(IndexingHelper.class);

    /** Maximum number of retry attempts for failed operations */
    protected int maxRetryCount = 5;

    /** Default number of rows to process in a single batch */

     * An arbitrary number of source roots may exist for the same scope and language.
     * It may be, for example, the case of a multi-versions project.
     * The iteration order is the order in which the sources are declared in the POM file.
     *
     * @param project the project for which to get the enabled source roots
     * @param scope the scope of the sources to return, or {@code null} for all scopes

    /**
     * Gets the number of credits this request requires.
     *
     * @return number of credits this request requires
     */
    int getCreditCost();

    /**
     * Sets the number of request credits.
     *
     * @param credits the number of credits to set
     */
    void setRequestCredits(int credits);

    /**
     * Checks if this is a cancel request.
     *

   * elements are the result of applying {@code elementFunction} to the inputs, with counts equal to
   * the result of applying {@code countFunction} to the inputs.
   *
   * <p>If the mapped elements contain duplicates (according to {@link Object#equals}), the first
   * occurrence in encounter order appears in the resulting multiset, with count equal to the sum of