Function TestPutStreamRoundTrip

cmd/cache-proxy/cache_test.go:222–252

(t *testing.T)

	for _, k := range keys {
		if _, err := c.PutStream(k, bytes.NewReader(make([]byte, 60))); err != nil {
			t.Fatalf("PutStream %s: %v", k, err)
		}
	}
	// After three 60-byte puts with maxBytes=100, the first key must have
	// been evicted (oldest lastAccess).
	if c.Has(keys[0]) {
		t.Error("oldest entry should have been evicted")
	}
	// The most recent must still be present.
	if !c.Has(keys[2]) {
		t.Error("newest entry should still be cached")
	}
}

func TestDiskCacheEntryLimitEvictsOldest(t *testing.T) {
	c := newTestCache(t)
	c.maxEntries = 2
	keys := []string{strings.Repeat("4", 64), strings.Repeat("5", 64), strings.Repeat("6", 64)}
	for _, key := range keys {
		if _, err := c.PutStream(key, bytes.NewReader([]byte("x"))); err != nil {
			t.Fatal(err)
		}
	}
	if c.order.Len() != 2 || c.Has(keys[0]) || !c.Has(keys[1]) || !c.Has(keys[2]) {
		t.Fatalf("entry-limited cache retained unexpected keys: len=%d first=%t second=%t third=%t", c.order.Len(), c.Has(keys[0]), c.Has(keys[1]), c.Has(keys[2]))
	}
}

func TestDiskCacheHardEntryLimitAppliesDuringStartupScan(t *testing.T) {
	dir := t.TempDir()
	entries := []struct {
		key  string
		when time.Time
	}{