InputLocationTracker tracker,
            String banned) {
        if (string != null) {
            for (int i = string.length() - 1; i >= 0; i--) {
                if (banned.indexOf(string.charAt(i)) >= 0) {
                    addViolation(
                            problems,
                            severity,
                            version,

     * @return the relevant document IDs
     */
    public List<String> getRelevantDocIds() {
        return relevantDocIds;
    }

    /**
     * Returns the list of relevant indexes (1-based) from search results.
     *
     * @return the relevant indexes
     */
    public List<Integer> getRelevantIndexes() {
        return relevantIndexes;
    }

    /**
     * Returns whether relevant results were found.
     *

    /** Logger instance for this factory class. */
    private static final Logger logger = LogManager.getLogger(DataStoreFactory.class);

    /**
     * Map containing registered data store instances indexed by their names and class simple names.
     * All keys are stored in lowercase for case-insensitive lookup.
     */
    protected Map<String, DataStore> dataStoreMap = new LinkedHashMap<>();

    /**

  }

  protected final void expectAdded(int index, E... elements) {
    expectAdded(index, asList(elements));
  }

  protected final void expectAdded(int index, Collection<E> elements) {
    List<E> expected = copyToList(getSampleElements());
    expected.addAll(index, elements);
    expectContents(expected);
  }

  /*
   * TODO: if we're testing a list, we could check indexOf(). (Doing it in

	// divisor, it avoids loops.
	slices.Sort(setCounts)

	return setCounts
}

// getSetIndexes returns list of indexes which provides the set size
// on each index, this function also determines the final set size
// The final set size has the affinity towards choosing smaller
// indexes (total sets)

import org.codelibs.fess.opensearch.client.SearchEngineClient;
import org.codelibs.fess.util.ComponentUtil;
import org.opensearch.index.query.QueryBuilder;
import org.opensearch.index.query.QueryBuilders;

/**
 * Job for exporting indexed search documents to the filesystem.
 * Each document is exported as a single file with URL structure mapped to directory structure.
 */
public class IndexExportJob {

        }

        private String insertRepositoryKey(String filename, String repositoryKey) {
            String result;
            int idx = filename.indexOf('.');
            if (idx < 0) {
                result = filename + '-' + repositoryKey;
            } else {
                result = filename.substring(0, idx) + '-' + repositoryKey + filename.substring(idx);

        list.addLast("1");
        list.addLast("2");
        list.addLast("3");
        assertThat(list.indexOf(null), is(0));
        assertThat(list.indexOf("1"), is(1));
        assertThat(list.indexOf("2"), is(2));
        assertThat(list.indexOf("3"), is(3));
        assertThat(list.indexOf("4"), is(-1));
    }

	g := errgroup.WithNErrs(len(sys.peerClients))
	for index, client := range sys.peerClients {
		if client == nil {
			continue
		}
		index := index
		g.Go(func() error {
			var err error
			reply[index], err = sys.peerClients[index].GetCPUs(ctx)
			return err
		}, index)
	}

	for index, err := range g.Wait() {
		if err != nil {
			sys.addNodeErr(&reply[index], sys.peerClients[index], err)
		}
	}

            if (!hasRelevant) {
                return RelevanceEvaluationResult.noRelevantResults();
            }

            final List<Integer> indexes = extractJsonIntArray(response, "relevant_indexes");
            final List<String> docIds = indexes.stream()
                    .filter(i -> i > 0 && i <= searchResults.size())
                    .map(i -> getStringValue(searchResults.get(i - 1), "doc_id"))