}

    @Override
    public int indexOf(@Nullable Object object) {
      int index = forwardList.lastIndexOf(object);
      return (index >= 0) ? reverseIndex(index) : -1;
    }

    @Override
    public int lastIndexOf(@Nullable Object object) {
      int index = forwardList.indexOf(object);
      return (index >= 0) ? reverseIndex(index) : -1;
    }

    @Override

			this._values = [ // JS values that Go currently has references to, indexed by reference id
				NaN,
				0,
				null,
				true,
				false,
				globalThis,
				this,
			];
			this._goRefCounts = new Array(this._values.length).fill(Infinity); // number of references that Go has to a JS value, indexed by reference id
			this._ids = new Map([ // mapping from JS values to reference ids
				[0, 1],

import org.jspecify.annotations.NullUnmarked;

/** Benchmarks some algorithms providing the same functionality as {@link Quantiles}. */
@NullUnmarked
public class QuantilesBenchmark {

  private static final ContiguousSet<Integer> ALL_DECILE_INDEXES =
      ContiguousSet.create(Range.closed(0, 10), DiscreteDomain.integers());

  @Param({"10", "100", "1000", "10000", "100000"})
  int datasetSize;

  @Param QuantilesAlgorithm algorithm;

import org.jspecify.annotations.NullUnmarked;

/** Benchmarks some algorithms providing the same functionality as {@link Quantiles}. */
@NullUnmarked
public class QuantilesBenchmark {

  private static final ContiguousSet<Integer> ALL_DECILE_INDEXES =
      ContiguousSet.create(Range.closed(0, 10), DiscreteDomain.integers());

  @Param({"10", "100", "1000", "10000", "100000"})
  int datasetSize;

  @Param QuantilesAlgorithm algorithm;

  }

  /** Returns the value for the setting `id`, or 0 if unset. */
  operator fun get(id: Int): Int = values[id]

  /** Returns the number of settings that have values assigned. */
  fun size(): Int = Integer.bitCount(set)

  // TODO: honor this setting.
  fun getEnablePush(defaultValue: Boolean): Boolean {
    val bit = 1 shl ENABLE_PUSH
    return if (bit and set != 0) values[ENABLE_PUSH] == 1 else defaultValue
  }

  private final CountDownLatch taskLatch = new CountDownLatch(1);
  private final CountDownLatch listenerLatch = new CountDownLatch(1);

  private volatile boolean throwException = false;

  private final ListenableFutureTask<Integer> task =
      ListenableFutureTask.create(
          () -> {
            runLatch.countDown();
            taskLatch.await();
            if (throwException) {
              throw new IllegalStateException("Fail");

        return path.toString();
    }

    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);
        }

     *
     * @throws NumberFormatException if [s] is not an integer of any precision.
     */
    private fun parseMaxAge(s: String): Long {
      try {
        val parsed = s.toLong()
        return if (parsed <= 0L) Long.MIN_VALUE else parsed
      } catch (e: NumberFormatException) {
        // Check if the value is an integer (positive or negative) that's too big for a long.

                break;
            }
        }

        this.canon = new String(out, 0, prefixLen);
        if (prefixLen > 1) {
            prefixLen--;
            final int firstSep = this.canon.indexOf('/', 1);
            if (firstSep < 0) {
                this.share = this.canon.substring(1);
                this.unc = "\\";
            } else if (firstSep == prefixLen) {

        String q = query;
        for (final String s : ComponentUtil.getFessConfig().getCrawlerDocumentSpaces()) {
            q = q.replace(s, SPACE);
        }
        final boolean exists = q.indexOf(OR) != -1 || q.indexOf(OR_ALT) != -1;
        queryBuf.append(' ');
        if (exists) {
            queryBuf.append('(');
        }
        queryBuf.append(query);
        if (exists) {
            queryBuf.append(')');