mirror of
https://github.com/tailscale/tailscale.git
synced 2024-11-25 19:15:34 +00:00
472eb6f6f5
The benchmark simulates an LRU being queries with uniformly random inputs, in a set that's too large for the LRU, which should stress the eviction codepath. Signed-off-by: David Anderson <danderson@tailscale.com>
60 lines
1.1 KiB
Go
60 lines
1.1 KiB
Go
// Copyright (c) Tailscale Inc & AUTHORS
|
|
// SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
package lru
|
|
|
|
import (
|
|
"math/rand"
|
|
"testing"
|
|
)
|
|
|
|
func TestLRU(t *testing.T) {
|
|
var c Cache[int, string]
|
|
c.Set(1, "one")
|
|
c.Set(2, "two")
|
|
if g, w := c.Get(1), "one"; g != w {
|
|
t.Errorf("got %q; want %q", g, w)
|
|
}
|
|
if g, w := c.Get(2), "two"; g != w {
|
|
t.Errorf("got %q; want %q", g, w)
|
|
}
|
|
c.DeleteOldest()
|
|
if g, w := c.Get(1), ""; g != w {
|
|
t.Errorf("got %q; want %q", g, w)
|
|
}
|
|
if g, w := c.Len(), 1; g != w {
|
|
t.Errorf("Len = %d; want %d", g, w)
|
|
}
|
|
c.MaxEntries = 2
|
|
c.Set(1, "one")
|
|
c.Set(2, "two")
|
|
c.Set(3, "three")
|
|
if c.Contains(1) {
|
|
t.Errorf("contains 1; should not")
|
|
}
|
|
if !c.Contains(2) {
|
|
t.Errorf("doesn't contain 2; should")
|
|
}
|
|
if !c.Contains(3) {
|
|
t.Errorf("doesn't contain 3; should")
|
|
}
|
|
c.Delete(3)
|
|
if c.Contains(3) {
|
|
t.Errorf("contains 3; should not")
|
|
}
|
|
}
|
|
|
|
func BenchmarkLRU(b *testing.B) {
|
|
const lruSize = 10
|
|
const maxval = 15 // 33% more keys than the LRU can hold
|
|
|
|
c := Cache[int, bool]{MaxEntries: lruSize}
|
|
b.ReportAllocs()
|
|
for i := 0; i < b.N; i++ {
|
|
k := rand.Intn(maxval)
|
|
if !c.Get(k) {
|
|
c.Set(k, true)
|
|
}
|
|
}
|
|
}
|