}

        public int peekChar() {
            return idx < expression.length() ? expression.charAt(idx) : EOF;
        }

        public int skipChar() {
            return idx < expression.length() ? expression.charAt(idx++) : EOF;
        }

        public String nextToken(char delimiter) {
            int start = idx;

        int readAndXClose = config.getBatchLimit("ReadAndX.Close");
        assertTrue(readAndXClose >= 0, "ReadAndX.Close batch limit should be non-negative");

        int treeConnectCheck = config.getBatchLimit("TreeConnectAndX.CheckDirectory");
        assertTrue(treeConnectCheck >= 0, "TreeConnectAndX.CheckDirectory batch limit should be non-negative");

        final int threadCount = 10;
        final Thread[] threads = new Thread[threadCount];
        final FessTimeResourceProvider[] providers = new FessTimeResourceProvider[threadCount];
        final Exception[] exceptions = new Exception[threadCount];

        for (int i = 0; i < threadCount; i++) {
            final int index = i;
            threads[i] = new Thread(() -> {

  }

  static <E extends Enum<E>> Class<E> getDeclaringClassOrObjectForJ2cl(E e) {
    return e.getDeclaringClass();
  }

  static int reduceIterationsIfGwt(int iterations) {
    return iterations;
  }

  static int reduceExponentIfGwt(int exponent) {
    return exponent;
  }

  private Platform() {}

        String filename = "a\\test\\path.txt";
        int informationLevel = 0x0102;
        Trans2QueryPathInformation trans = new Trans2QueryPathInformation(filename, informationLevel);
        // Expected size: 2 (info level) + 4 (reserved) + filename length + 1 (null terminator)
        byte[] dst = new byte[2 + 4 + filename.length() + 1];

        // When
        int bytesWritten = trans.writeParametersWireFormat(dst, 0);

   */
  public static int consistentHash(long input, int buckets) {
    checkArgument(buckets > 0, "buckets must be positive: %s", buckets);
    LinearCongruentialGenerator generator = new LinearCongruentialGenerator(input);
    int candidate = 0;
    int next;

    // Jump from bucket to bucket until we go out of range
    while (true) {
      next = (int) ((candidate + 1) / generator.nextDouble());

        var bazar = "bazar"

        var bazool: Boolean = true

        var isFool: Boolean = true

        fun String.fooExt() {}

        fun Int.fooExt() {}

        val String.barExt: String
            get() = "bar"

        var Int.bazarExt: String
            get() = "bar"
            set(value) = Unit

        operator fun String.invoke(p: String, block: String.() -> Unit) = Unit

     */
    public LruHashMap(final int limitSize) {
        this(limitSize, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR);
    }

    /**
     * Creates an {@link LruHashMap}.
     *
     * @param limitSize the upper limit on the number of entries
     * @param initialCapacity the initial capacity
     * @param loadFactor the load factor
     */
    public LruHashMap(final int limitSize, final int initialCapacity, final float loadFactor) {

        final int boundarySize = boundary.length;
        final int limitSize = getBoundaryLimitSize();
        if (boundarySize > getBoundaryLimitSize()) {
            throwTooLongBoundarySizeException(contentType, boundarySize, limitSize);
        }
    }

    protected int getBoundaryLimitSize() {

        public void setCreditForTest(int credit) {
            setCredit(credit);
        }

        @Override
        public Smb2SigningDigest getDigest() {
            return digest;
        }

        public void setDigest(Smb2SigningDigest digest) {
            this.digest = digest;
        }

        @Override