// Initialize without container
        emptyGenerator = new EmptyGenerator();

        // Test that isAvailable returns true for EmptyGenerator
        assertTrue(emptyGenerator.isAvailable());
        // Test cached availability
        assertTrue(emptyGenerator.isAvailable());
    }

    public void test_isTarget() {
        // Initialize without container
        emptyGenerator = new EmptyGenerator();

    private static final Logger logger = LogManager.getLogger(PopularWordHelper.class);

    /** Character used to separate cache key components */
    protected static final char CACHE_KEY_SPLITTER = '\n';

    /** Cache for storing popular word lists */
    protected Cache<String, List<String>> cache;

    /** Fess configuration instance */
    protected FessConfig fessConfig;

    /**
     * Default constructor.
     */

import okhttp3.Response
import okhttp3.internal.http.RealInterceptorChain

/**
 * Opens a connection to the target server and proceeds to the next interceptor. The network might
 * be used for the returned response, or to validate a cached response with a conditional GET.
 */
object ConnectInterceptor : Interceptor {
  @Throws(IOException::class)
  override fun intercept(chain: Interceptor.Chain): Response {
    val realChain = chain as RealInterceptorChain

        if (cookieNameMap == null) {
            cookieNameMap = new HashMap<>();
        }
        cookieNameMap.put(cookieName, roleName);
    }

    /**
     * Sets the cached cipher.
     * @param cipher The cached cipher.
     */
    public void setCipher(final CachedCipher cipher) {
        this.cipher = cipher;
    }

    /**
     * Sets the value separator.

    firstException = expected;
    // Second time should also fail, with a cached causal chain.
    expected = assertThrows(PotentialDeadlockException.class, () -> lockA.lock());
    checkMessage(expected, "LockB -> LockA", "LockA -> LockB");
    // The causal chain should be cached.
    assertSame(firstException.getCause(), expected.getCause());
    // lockA should work after lockB is released.

    firstException = expected;
    // Second time should also fail, with a cached causal chain.
    expected = assertThrows(PotentialDeadlockException.class, () -> lockA.lock());
    checkMessage(expected, "LockB -> LockA", "LockA -> LockB");
    // The causal chain should be cached.
    assertSame(firstException.getCause(), expected.getCause());
    // lockA should work after lockB is released.

    protected static final String GROOVY_MATCHER = "groovy:";

    /** Map of path mappings by process type. */
    protected final Map<String, List<PathMapping>> pathMappingMap = new HashMap<>();

    /** Cached list of path mappings. */
    protected volatile List<PathMapping> cachedPathMappingList = null;

    /**
     * Initializes the path mapping helper.
     */
    @PostConstruct
    public void init() {

    protected static final String CONTENT_DISPOSITION = "Content-Disposition";

    /** Cache key for highlighted cache content */
    protected static final String HL_CACHE = "hl_cache";

    /** Cache key for search queries */
    protected static final String QUERIES = "queries";

    /** Cache key for cache message */
    protected static final String CACHE_MSG = "cache_msg";

/**
 * Statistics about the performance of a {@link Cache}. Instances of this class are immutable.
 *
 * <p>Cache statistics are incremented according to the following rules:
 *
 * <ul>
 *   <li>When a cache lookup encounters an existing cache entry {@code hitCount} is incremented.
 *   <li>When a cache lookup first encounters a missing cache entry, a new entry is loaded.
 *       <ul>

        /*
         * It's very unlikely that any loaded Futures class will see getChecked called with more
         * than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache.
         * This avoids out-of-control memory consumption, and it keeps the cache from growing so
         * large that doing the lookup is noticeably slower than redoing the work would be.
         *