public void test_analyzeTextWithLargeContent() throws Exception {
        SuggestAnalyzer analyzer = suggester.settings().analyzer().new DefaultContentsAnalyzer();
        // Create text larger than maxAnalyzedContentLength (1000 chars by default)
        StringBuilder largeText = new StringBuilder();
        for (int i = 0; i < 2000; i++) {
            largeText.append("テスト ");
        }

         * that this will suffice. I have not even benchmarked with different size limits.
         */
        if (validClasses.size() > 1000) {
          validClasses.clear();
        }

        validClasses.add(new WeakReference<Class<? extends Exception>>(exceptionClass));
      }
    }

    /**

    }

    @Test
    @DisplayName("Test array bounds validation")
    void testArrayBounds() {
        byte[] src = new byte[100];
        byte[] dst = new byte[100];

        assertDoesNotThrow(() -> InputValidator.validateArrayBounds(src, 0, dst, 0, 100));
        assertDoesNotThrow(() -> InputValidator.validateArrayBounds(src, 50, dst, 50, 50));

	for i := 0; i < 2+numReaders; i++ {
		<-cdone
	}
}

// Borrowed from rwmutex_test.go
func TestRWMutex(t *testing.T) {
	defer runtime.GOMAXPROCS(runtime.GOMAXPROCS(-1))
	n := 1000
	if testing.Short() {
		n = 5
	}
	HammerRWMutex(1, 1, n)
	HammerRWMutex(1, 3, n)
	HammerRWMutex(1, 10, n)
	HammerRWMutex(4, 1, n)
	HammerRWMutex(4, 3, n)
	HammerRWMutex(4, 10, n)

    // Check the first 100,000 integers
    for (int i = 0; i < 100000; i++) {
      assertEquals(LongMath.isPrime(i), IntMath.isPrime(i));
    }

    // Then check 1000 deterministic pseudo-random int values.
    Random rand = new Random(1);
    for (int i = 0; i < 1000; i++) {
      int n = rand.nextInt(Integer.MAX_VALUE);
      assertEquals(LongMath.isPrime(n), IntMath.isPrime(n));
    }
  }

     *
     * @return lease timeout in milliseconds
     * @since 2.2
     */
    int getLeaseTimeout();

    /**
     * Property {@code jcifs.smb.client.maxLeases} (int, default 1000)
     *
     * @return maximum number of concurrent leases
     * @since 2.2
     */
    int getMaxLeases();

    /**
     * Property {@code jcifs.smb.client.leaseVersion} (int, default 2)
     *

    executorService =
        new ThreadPoolExecutor(
            NUM_THREADS,
            NUM_THREADS,
            Long.MAX_VALUE,
            SECONDS,
            new ArrayBlockingQueue<Runnable>(1000));
    executorService.prestartAllCoreThreads();
    AtomicInteger integer = new AtomicInteger();
    // Execute a bunch of tasks to ensure that our threads are allocated and hot

    static Stream<Arguments> equalsHashParams() {
        return Stream.of(
                // byte[] id based equality (same id and tree id)
                Arguments.of(new byte[] { 0x0A, 0x0B }, new byte[] { 0x0A, 0x0B }, 100L, true),
                // fid based equality (null fileId, same fid and tree id)
                Arguments.of(null, null, 200L, true));
    }

    @ParameterizedTest(name = "equals/hashCode consistent for treeId={2}")

        @BeforeEach
        void setupBuffer() {
            // Create buffer with 3 v1 referrals
            byte[] testBuffer = new byte[100];
            ByteBuffer bb = ByteBuffer.wrap(testBuffer).order(ByteOrder.LITTLE_ENDIAN);

            // Header
            bb.putShort((short) 100); // pathConsumed
            bb.putShort((short) 3); // numReferrals
            bb.putShort((short) 25); // tflags

    private final int maxAnalyzedContentLength;

    /**
     * Constructor.
     */
    public DefaultContentsParser() {
        maxAnalyzedContentLength = Integer.getInteger("fess.suggest.max.analyzed.content.length", 1000);
    }

    @Override
    public SuggestItem parseSearchWords(final String[] words, final String[][] readings, final String[] fields, final String[] tags,