// Cause the rebuild action to fail.
    filesystem.setFaultyRename(cacheDir / DiskLruCache.JOURNAL_FILE_BACKUP, true)
    taskFaker.runNextTask()

    // The rebuild is retried on cache hits and on cache edits.
    val snapshot = cache["b"]!!
    snapshot.close()
    assertThat(cache.edit("d")).isNull()
    assertThat(taskFaker.isIdle()).isFalse()

    // On cache misses, no retry job is queued.
    assertThat(cache["c"]).isNull()

     *
     * @see Function
     * @see Optional
     * @see HashMap#computeIfAbsent(Object, Function)
     */
    static UnaryOperator<String> memoize(UnaryOperator<String> callback) {
        Map<String, Optional<String>> cache = new HashMap<>();
        return s -> cache.computeIfAbsent(s, v -> Optional.ofNullable(callback.apply(v)))

Shinsuke Sugaya <******@****.***> 1462510149 +0900

Shinsuke Sugaya <******@****.***> 1462510149 +0900

     * @return the maximum cache age in milliseconds
     */
    public long getMaxAge() {
        return maxAge;
    }

    /**
     * Sets the maximum age for cached data
     * @param maxAge the maximum cache age in milliseconds
     */
    public void setMaxAge(long maxAge) {
        this.maxAge = maxAge;
    }

    /**

cpovirk <******@****.***> 1721404771 -0700

        DfsResolver dfs2 = context.getDfs();
        BufferCache cache1 = context.getBufferCache();
        BufferCache cache2 = context.getBufferCache();

        // Then - should be same instances
        assertSame(config1, config2, "Configuration should be consistent");
        assertSame(dfs1, dfs2, "DFS resolver should be consistent");
        assertSame(cache1, cache2, "Buffer cache should be consistent");
    }

    @Test

      cache.invalidate("a");
      cache.invalidate("b");
      cache.invalidate(0);
      checkEmpty(cache);
    }
  }

  public void testInvalidateAll_empty() {
    for (LoadingCache<Object, Object> cache : caches()) {
      cache.getUnchecked("a");
      cache.getUnchecked("b");
      cache.getUnchecked("c");
      cache.invalidateAll();
      checkEmpty(cache);
    }
  }

import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A map-like data structure that wraps a backing map and caches values while iterating through
 * {@link #unmodifiableKeySet()}. By design, the cache is cleared when this structure is mutated. If
 * this structure is never mutated, it provides a thread-safe view of the backing map.
 *

			remove[id] = struct{}{}
			continue
		}
		if cache.id != id {
			logger.Info("cache ID mismatch %s != %s", id, cache.id)
			remove[id] = struct{}{}
			continue
		}
		if cache.bucket != b.bucket {
			logger.Info("cache bucket mismatch %s != %s", b.bucket, cache.bucket)
			remove[id] = struct{}{}
			continue
		}
	}

	// If above limit, remove the caches with the oldest handout time.