/*
     * We don't "need" to schedule a countDown() call at all here, but by doing
     * so, we come the closest we can to testing that the wait time is
     * appropriately decreased on each progressive await() call.
     */
    TimedLatch latch = new TimedLatch(/* countdownInMillis= */ LONG_DELAY_MS);
    repeatedlyInterruptTestThread(tearDownStack);
    latch.awaitUnsuccessfully(70);

    /*
     * We don't "need" to schedule a countDown() call at all here, but by doing
     * so, we come the closest we can to testing that the wait time is
     * appropriately decreased on each progressive await() call.
     */
    TimedLatch latch = new TimedLatch(/* countdownInMillis= */ LONG_DELAY_MS);
    repeatedlyInterruptTestThread(tearDownStack);
    latch.awaitUnsuccessfully(70);

        int originalSize = stopwordsFile.stopwordsItemList.size();
        StopwordsItem item = stopwordsFile.get(1).get();
        stopwordsFile.delete(item);

        // Verify the item count decreased
        // Note: get(1) may still return an item if IDs are reassigned
        assertTrue(stopwordsFile.stopwordsItemList.size() < originalSize);
    }

    // Test reload with InputStream
    @Test

- Memory limits could be decreased with a `NotRequired` resize restart policy. When decreasing memory limits,a best-effort check was performed to prevent limits from decreasing below usage and triggering an OOM-kill. ([#133012](https://github.com/kubernetes/kubernetes/pull/133012),...

- InPlacePodVerticalScaling: Memory limits cannot be decreased unless the memory resize restart policy is set to `RestartContainer`. Container resizePolicy is no longer mutable. ([#130183](https://github.com/kubernetes/kubernetes/pull/130183), [@tallclair](https://github.com/tallclair)) [SIG Apps and Node]

 * threads. By default, this ordering is not guaranteed. However, a queue constructed with fairness
 * set to {@code true} grants threads access in FIFO order. Fairness generally decreases throughput
 * but reduces variability and avoids starvation.
 *
 * <p>This class and its iterator implement all of the optional methods of the {@link
 * Collection} and {@link Iterator} interfaces.
 *
 * @author Doug Lea

 * threads. By default, this ordering is not guaranteed. However, a queue constructed with fairness
 * set to {@code true} grants threads access in FIFO order. Fairness generally decreases throughput
 * but reduces variability and avoids starvation.
 *
 * <p>This class and its iterator implement all of the optional methods of the {@link
 * Collection} and {@link Iterator} interfaces.
 *
 * @author Doug Lea

  long size();

  /**
   * Returns a current snapshot of this cache's cumulative statistics, or a set of default values if
   * the cache is not recording statistics. All statistics begin at zero and never decrease over the
   * lifetime of the cache.
   *
   * <p><b>Warning:</b> this cache may not be recording statistical data. For example, a cache

        }
        queryCommandMap.put(name, queryCommand);
    }

    /**
     * Adds a filter to the processing pipeline.
     * After adding a filter, the filter chain is recreated to include the new filter.
     *
     * @param filter the filter to add to the processing pipeline
     */
    public void addFilter(final Filter filter) {
        filterList.add(filter);

        testClient.documentCount = 10;

        final boolean result = testClient.reindexConfigIndices(false, allTargetPrefixes());

        // Even if delete fails, the rebuild itself succeeded (aliases are recreated)
        assertTrue(result);
    }

    @Test
    public void test_reindexConfigIndices_newIndexCreationFailureCleansUp() {
        testClient.existsIndexResult = true;
        testClient.reindexResult = true;