public void run() {
        cache.refresh(refreshKey);
        getFinishedSignal.countDown();
      }
    }.start();

    computationStarted.await();
    cache.invalidate(getKey);
    cache.invalidate(refreshKey);
    assertThat(map.containsKey(getKey)).isFalse();
    assertThat(map.containsKey(refreshKey)).isFalse();

    // let computation complete
    letGetFinishSignal.countDown();

import java.util.concurrent.ExecutionException;

/**
 * A semi-persistent mapping from keys to values. Values are automatically loaded by the cache, and
 * are stored in the cache until either evicted or manually invalidated. The common way to build
 * instances is using {@link CacheBuilder}.
 *
 * <p>Implementations of this interface are expected to be thread-safe, and can be safely accessed
 * by multiple concurrent threads.
 *

}

func (client *storageRESTClient) GetDiskID() (string, error) {
	if !client.IsOnlineWS() {
		// make sure to check if the disk is offline, since the underlying
		// value is cached we should attempt to invalidate it if such calls
		// were attempted. This can lead to false success under certain conditions
		// - this change attempts to avoid stale information if the underlying
		// transport is already down.

    for (LoadingCache<Object, Object> cache : caches()) {
      cache.getUnchecked(1);
      Entry<Object, Object> entry = Iterables.getOnlyElement(cache.asMap().entrySet());

      cache.invalidate(1);
      assertThat(cache.size()).isEqualTo(0);

      entry.setValue(3);
      assertThat(cache.size()).isEqualTo(1);
      assertThat(cache.getIfPresent(1)).isEqualTo(3);
      checkValidState(cache);

      public void run() {
        cache.refresh(refreshKey);
        getFinishedSignal.countDown();
      }
    }.start();

    computationStarted.await();
    cache.invalidate(getKey);
    cache.invalidate(refreshKey);
    assertThat(map.containsKey(getKey)).isFalse();
    assertThat(map.containsKey(refreshKey)).isFalse();

    // let computation complete
    letGetFinishSignal.countDown();

    Map<K, V> delegate = delegateOrNull();
    if (delegate != null) {
      metadata =
          Ints.constrainToRange(size(), CompactHashing.DEFAULT_SIZE, CompactHashing.MAX_SIZE);
      delegate.clear(); // invalidate any iterators left over!
      table = null;
      size = 0;
    } else {
      Arrays.fill(requireKeys(), 0, size, null);
      Arrays.fill(requireValues(), 0, size, null);

        additionalPatterns.add("http://test.com/.*");
        additionalPatterns.add("http://sample.org/.*");
        urlFilterService.addIncludeUrlFilter(sessionId, additionalPatterns);

        // Cache should be invalidated and new patterns should be retrieved
        patterns = urlFilterService.getIncludeUrlPatternList(sessionId);
        assertEquals(3, patterns.size());

        urlFilterService.delete(sessionId);
    }

      Entry<K, V> entryCopy = mapEntry(entry.getKey(), entry.getValue());

      iterator.remove();
      assertEquals(initialSize - 1, map.size());

      // Use "entryCopy" instead of "entry" because "entry" might be invalidated after
      // iterator.remove().
      assertFalse(entrySet.contains(entryCopy));
      assertInvariants(map);
      assertThrows(IllegalStateException.class, iterator::remove);
    } else {

    for (LoadingCache<Object, Object> cache : caches()) {
      cache.getUnchecked(1);
      Entry<Object, Object> entry = Iterables.getOnlyElement(cache.asMap().entrySet());

      cache.invalidate(1);
      assertThat(cache.size()).isEqualTo(0);

      entry.setValue(3);
      assertThat(cache.size()).isEqualTo(1);
      assertThat(cache.getIfPresent(1)).isEqualTo(3);
      checkValidState(cache);

      inverse.delegate.remove(entry.getValue());
      /*
       * Remove the mapping in inverse before removing from esDelegate because
       * if entry is part of esDelegate, entry might be invalidated after the
       * mapping is removed from esDelegate.
       */
      esDelegate.remove(entry);
      return true;
    }

    @Override
    public Iterator<Entry<K, V>> iterator() {