}

    /** Equivalent to {@code newReentrantReadWriteLock(rank, false)}. */
    public ReentrantReadWriteLock newReentrantReadWriteLock(E rank) {
      return newReentrantReadWriteLock(rank, false);
    }

    /**
     * Creates a {@link ReentrantReadWriteLock} with the given fairness policy and rank. The values

    final T value;
    final int rank;

    Composite(T value, int rank) {
      this.value = value;
      this.rank = rank;
    }

    // natural order is by rank only; the test will compound() this with the
    // order of 't'.
    @Override
    public int compareTo(Composite<T> that) {
      return Integer.compare(rank, that.rank);
    }

    final T value;
    final int rank;

    Composite(T value, int rank) {
      this.value = value;
      this.rank = rank;
    }

    // natural order is by rank only; the test will compound() this with the
    // order of 't'.
    @Override
    public int compareTo(Composite<T> that) {
      return Integer.compare(rank, that.rank);
    }

     */
    public static CorsHandlerFactory getCorsHandlerFactory() {
        return getComponent(CORS_HANDLER_FACTORY);
    }

    /**
     * Gets the rank fusion processor component.
     * @return The rank fusion processor.
     */
    public static RankFusionProcessor getRankFusionProcessor() {
        return getComponent(RANK_FUSION_PROCESSOR);
    }

    /**

labels.facet_filetype_txt=filetype:txt\t\
labels.facet_filetype_others=filetype:others\n\

# ranking

# Window size for rank fusion.
rank.fusion.window_size=200
# Rank constant for rank fusion.
rank.fusion.rank_constant=20
# Number of threads for rank fusion.
rank.fusion.threads=-1
# Score field for rank fusion.
rank.fusion.score_field=rf_score

# acl

# Whether to get SMB roles from a file.
smb.role.from.file=true

  abstract Map<Integer, Double> multipleQuantiles(
      Collection<Integer> indexes, int scale, double[] dataset);

  static double getMinValue(double[] array, int from) {
    // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the
    // method signature: we always search to the end of the array.
    int min = from;
    for (int i = from + 1; i < array.length; i++) {
      if (array[min] > array[i]) {

  abstract Map<Integer, Double> multipleQuantiles(
      Collection<Integer> indexes, int scale, double[] dataset);

  static double getMinValue(double[] array, int from) {
    // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the
    // method signature: we always search to the end of the array.
    int min = from;
    for (int i = from + 1; i < array.length; i++) {
      if (array[min] > array[i]) {

					<groupId>org.opensearch.plugin</groupId>
					<artifactId>aggs-matrix-stats-client</artifactId>
				</exclusion>
				<exclusion>
					<groupId>org.opensearch.plugin</groupId>
					<artifactId>rank-eval-client</artifactId>
				</exclusion>
				<exclusion>
					<groupId>org.opensearch.plugin</groupId>
					<artifactId>lang-expression</artifactId>
				</exclusion>
				<exclusion>

     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     * @throws NumberFormatException When the property is not integer.
     */
    Integer getRankFusionWindowSizeAsInteger();

    /**
     * Get the value for the key 'rank.fusion.rank_constant'. <br>
     * The value is, e.g. 20 <br>
     * comment: Rank constant for rank fusion.

 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,
 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.rank.fusion;

import org.codelibs.fess.unit.UnitFessTestCase;
import org.junit.jupiter.api.Test;
import org.junit.jupiter.api.TestInfo;

public class DefaultSearcherTest extends UnitFessTestCase {

    @Override