}

  public void testComputeIfPresent_error() {
    Cache<String, String> cache = CacheBuilder.newBuilder().build();
    cache.put(key, "1");
    assertThrows(
        Error.class,
        () ->
            cache
                .asMap()
                .computeIfPresent(
                    key,
                    (k, v) -> {
                      throw new Error();
                    }));

    assertThat(cache.get(34, loader)).isEqualTo(2);

    cache.invalidate(0);
    assertThat(cache.get(0, loader)).isEqualTo(3);

    cache.put(0, 10);
    cache.invalidateAll();
    assertThat(cache.get(0, loader)).isEqualTo(4);
  }

  @Test
  public void sizeConstraint() {
    Cache<Integer, Integer> cache = CacheBuilder.newBuilder().maximumSize(4).build();

    cache.put(1, 10);
    cache.put(2, 20);

    assertThat(cache.getUnchecked(0)).isEqualTo(1);
    assertThat(cache.getUnchecked(1)).isEqualTo(-1);
    assertThat(cache.getUnchecked(2)).isEqualTo(2);
    assertThat(loader.getLoadCount()).isEqualTo(expectedLoads);
    assertThat(loader.getReloadCount()).isEqualTo(expectedReloads);

    // refresh 2
    ticker.advance(1, MILLISECONDS);
    assertThat(cache.getUnchecked(0)).isEqualTo(1);
    assertThat(cache.getUnchecked(1)).isEqualTo(-1);

 * the License.
 */

package com.google.common.cache;

import static com.google.common.cache.TestingCacheLoaders.identityLoader;
import static com.google.common.cache.TestingRemovalListeners.countingRemovalListener;
import static com.google.common.cache.TestingWeighers.constantWeigher;
import static com.google.common.cache.TestingWeighers.intKeyWeigher;
import static com.google.common.cache.TestingWeighers.intValueWeigher;

    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.
     */

		newCache.buildUserGroupMemberships()
	}

	cache := store.lock()
	defer store.unlock()

	// We should only update the in-memory cache if there were no changes
	// to the in-memory cache since the disk loading began. If there
	// were changes to the in-memory cache we should wait for the next
	// cycle until we can safely update the in-memory cache.
	//
	// An in-memory cache must be replaced only if we know for sure that the

    if (value != null) {
      return value;
    }

    // Store a local reference to the cache entry. If the backing map is immutable, this,
    // in combination with immutable cache entries, will ensure a thread-safe cache.
    CacheEntry<K, V> entry;

    // Check cache. We use == on purpose because it's cheaper and a cache miss is ok.
    entry = cacheEntry1;
    if (entry != null && entry.key == key) {
      return entry.value;

    for (LoadingCache<Object, Object> cache : caches()) {
      checkEmpty(cache);
    }
  }


  public void testInvalidate_empty() {
    for (LoadingCache<Object, Object> cache : caches()) {
      cache.getUnchecked("a");
      cache.getUnchecked("b");
      cache.invalidate("a");
      cache.invalidate("b");
      cache.invalidate(0);
      checkEmpty(cache);
    }
  }

    for (LoadingCache<Object, Object> cache : caches()) {
      checkEmpty(cache);
    }
  }


  public void testInvalidate_empty() {
    for (LoadingCache<Object, Object> cache : caches()) {
      cache.getUnchecked("a");
      cache.getUnchecked("b");
      cache.invalidate("a");
      cache.invalidate("b");
      cache.invalidate(0);
      checkEmpty(cache);
    }
  }

        assertThat(cache.asMap().containsKey(key)).isFalse();
      }
      checkEmpty(cache);
    }
  }


  public void testKeySet_populated() {
    for (LoadingCache<Object, Object> cache : caches()) {
      Set<Object> keys = cache.asMap().keySet();
      List<Entry<Object, Object>> warmed = warmUp(cache);