Object one = new Object();
    cache.getUnchecked(one);
    CacheStats stats = cache.stats();
    assertThat(stats.requestCount()).isEqualTo(1);
    assertThat(stats.hitCount()).isEqualTo(0);
    assertThat(stats.hitRate()).isEqualTo(0.0);
    assertThat(stats.missCount()).isEqualTo(1);
    assertThat(stats.missRate()).isEqualTo(1.0);
    assertThat(stats.loadCount()).isEqualTo(1);
    long totalLoadTime = stats.totalLoadTime();

    StatsCounter counter = new SimpleStatsCounter();
    CacheStats stats = counter.snapshot();
    assertThat(stats.requestCount()).isEqualTo(0);
    assertThat(stats.hitCount()).isEqualTo(0);
    assertThat(stats.hitRate()).isEqualTo(1.0);
    assertThat(stats.missCount()).isEqualTo(0);
    assertThat(stats.missRate()).isEqualTo(0.0);
    assertThat(stats.loadSuccessCount()).isEqualTo(0);

func newHealState(ctx context.Context, cleanup bool) *allHealState {
	hstate := &allHealState{
		healSeqMap:     make(map[string]*healSequence),
		healLocalDisks: make(map[Endpoint]bool),
		healStatus:     make(map[string]healingTracker),
	}
	if cleanup {
		go hstate.periodicHealSeqsClean(ctx)
	}
	return hstate
}

func (ahs *allHealState) popHealLocalDisks(healLocalDisks ...Endpoint) {
	ahs.Lock()

func (d *Digest) Clone() *Digest { ret := *d return &ret } // permute applies the KeccakF-1600 permutation. func (d *Digest) permute() { keccakF1600(&d.a) d.n = 0 } // padAndPermute appends the domain separation bits in dsbyte, applies // the multi-bitrate 10..1 padding rule, and permutes the state. func (d *Digest) padAndPermute() { // Pad with this instance's domain-separator bits. We know that there's // at least one byte of space in the sponge because, if it were full, // permute would have been...