func TestInstantiateZero(t *testing.T) {
defer func() {
recover()
}()
_ = lfucache.New(0)
t.Error("Should not be able to instantiate zero-sized cache")
}
func TestDelete(t *testing.T) {
c := lfucache.New(3)
c.Insert("test1", 42) // usage=1
c.Access("test1") // usage=2
c.Access("test1") // usage=3
c.Insert("test2", 43) // usage=1
c.Insert("test3", 44) // usage=1
c.Access("test3") // usage=2
c.Delete("test1")
if _, ok := c.Access("test1"); ok {
t.Error("test1 was not deleted")
}
if v, _ := c.Access("test2"); v.(int) != 43 {
t.Error("Didn't get the right value back from the cache (test2)")
}
if v, _ := c.Access("test3"); v.(int) != 44 {
t.Error("Didn't get the right value back from the cache (test3)")
}
}
func TestEvictIf(t *testing.T) {
c := lfucache.New(10)
c.Insert("test1", 42)
c.Insert("test2", 43)
c.Insert("test3", 44)
c.Insert("test4", 45)
c.Insert("test5", 46)
ev := c.EvictIf(func(v interface{}) bool {
return v.(int)%2 == 0
})
if ev != 3 {
t.Error("Incorrect number of items evicted", ev)
}
if _, ok := c.Access("test1"); ok {
t.Error("test1 not expected to exist")
}
if _, ok := c.Access("test2"); !ok {
t.Error("test2 expected to exist")
}
if _, ok := c.Access("test3"); ok {
t.Error("test3 not expected to exist")
}
if _, ok := c.Access("test4"); !ok {
t.Error("test4 expected to exist")
}
if _, ok := c.Access("test5"); ok {
t.Error("test5 not expected to exist")
}
}
func TestInsertAccess(t *testing.T) {
c := lfucache.New(10)
c.Insert("test", 42)
v, _ := c.Access("test")
if v.(int) != 42 {
t.Error("Didn't get the right value back from the cache")
}
}
func TestResize(t *testing.T) {
c := lfucache.New(10)
c.Insert("test1", 42) // usage=0
c.Access("test1") // usage=1
c.Access("test1") // usage=2
c.Insert("test2", 43) // usage=0
c.Insert("test3", 44) // usage=0
c.Access("test3") // usage=1
c.Insert("test4", 45) // usage=0
if cp := c.Cap(); cp != 10 {
t.Errorf("incorrect cap, %d", cp)
}
if ln := c.Len(); ln != 4 {
t.Errorf("incorrect length, %d", ln)
}
if s := c.Statistics(); s.Evictions != 0 {
t.Errorf("premature evictions, %d", s.Evictions)
}
c.Resize(2)
if cp := c.Cap(); cp != 2 {
t.Errorf("incorrect cap, %d", cp)
}
if ln := c.Len(); ln != 2 {
t.Errorf("incorrect length, %d", ln)
}
if s := c.Statistics(); s.Evictions != 2 {
t.Errorf("missed evictions, %d", s.Evictions)
}
if _, ok := c.Access("test2"); ok {
t.Error("Node test2 was not removed")
}
if _, ok := c.Access("test4"); ok {
t.Error("Node test4 was not removed")
}
if v, _ := c.Access("test1"); v.(int) != 42 {
t.Error("Didn't get the right value back from the cache (test1)")
}
if v, _ := c.Access("test3"); v.(int) != 44 {
t.Error("Didn't get the right value back from the cache (test3)")
}
}
func TestStats(t *testing.T) {
c := lfucache.New(3)
c.Access("test1") // miss
c.Access("test2") // miss
c.Insert("test1", 42) // usage=0
c.Access("test1") // usage=1
c.Access("test1") // usage=2
c.Insert("test2", 43) // usage=0
c.Insert("test3", 44) // usage=0
c.Access("test3") // usage=1
c.Access("test1") // usage=3
c.Access("test2") // usage=1
c.Access("test3") // usage=2
// Will evict test2
c.Insert("test4", 45) // usage=0
c.Access("test2") // miss
// Will evict test4
c.Insert("test5", 45) // usage=0
c.Delete("test1")
c.Delete("test2")
stats := c.Statistics()
if stats.LenFreq0 != 1 {
t.Errorf("Stats itemsfreq0 incorrect, %d", stats.LenFreq0)
}
if stats.Inserts != 5 {
t.Errorf("Stats inserts incorrect, %d", stats.Inserts)
}
if stats.Hits != 6 {
t.Errorf("Stats hits incorrect, %d", stats.Hits)
}
if stats.Misses != 3 {
t.Errorf("Stats misses incorrect, %d", stats.Misses)
}
if stats.Evictions != 2 {
t.Errorf("Stats evictions incorrect, %d", stats.Evictions)
}
if stats.Deletes != 1 {
t.Errorf("Stats deletes incorrect, %d", stats.Deletes)
}
if stats.FreqListLen != 2 {
t.Errorf("Stats freqlistlen incorrect, %d", stats.FreqListLen)
}
}
func TestExpireOldest(t *testing.T) {
c := lfucache.New(3)
c.Insert("test1", 42)
c.Insert("test2", 43)
c.Insert("test3", 44)
c.Insert("test4", 45) // should remove test1 which is oldest
if _, ok := c.Access("test1"); ok {
t.Error("test1 was not removed")
}
}
func TestEvictionsChannel(t *testing.T) {
c := lfucache.New(3)
exp := make(chan interface{})
c.Evictions(exp)
// Unregister an unregistered channel. Should be a nop.
unregisteredExp := make(chan interface{})
c.UnregisterEvictions(unregisteredExp)
start := make(chan bool)
done := make(chan bool)
go func() {
ready := false
for {
select {
case e := <-exp:
if !ready {
t.Errorf("Unexpected expire %#v", e)
} else if e.(int) != 43 {
t.Errorf("Incorrect expire %#v", e)
} else {
done <- true
return
}
case <-start:
ready = true
}
}
}()
c.Insert("test1", 42) // usage=1
c.Access("test1") // usage=2
c.Access("test1") // usage=3
c.Insert("test2", 43) // usage=1
c.Insert("test3", 44) // usage=1
c.Access("test3") // usage=2
c.Access("test1")
c.Access("test2")
c.Access("test3")
start <- true
// Will evict test2
c.Insert("test4", 45) // usage=1
<-done
c.UnregisterEvictions(exp)
// Will evict test3, there is noone listening on the expired channel
c.Insert("test5", 45) // usage=1
}
func BenchmarkAccessMissStr(b *testing.B) {
c := lfucache.New(cacheSize)
keys := make([]string, cacheSize)
for i := 0; i < cacheSize; i++ {
keys[i] = fmt.Sprintf("k%d", i)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
c.Access(keys[i%cacheSize])
}
}
func TestRandomAccess(t *testing.T) {
c := lfucache.New(1024)
err := quick.Check(func(key string, val int) bool {
c.Insert(key, val)
v, ok := c.Access(key)
return ok && v.(int) == val
}, &quick.Config{MaxCount: 100000})
if err != nil {
t.Error(err)
}
}
func BenchmarkAccessHitWorstCaseStr(b *testing.B) {
c := lfucache.New(cacheSize)
keys := make([]string, cacheSize)
for i := 0; i < cacheSize; i++ {
keys[i] = fmt.Sprintf("k%d", i)
}
for i := 0; i < cacheSize; i++ {
c.Insert(keys[i], i)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
c.Access(keys[0])
}
}
func BenchmarkAccessHitRandomInt(b *testing.B) {
c := lfucache.New(cacheSize)
for i := 0; i < cacheSize; i++ {
c.Insert(i, i)
}
indexes := make([]int, cacheSize)
for i := 0; i < cacheSize; i++ {
indexes[i] = int(rand.Int31n(cacheSize))
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
c.Access(indexes[i%cacheSize])
}
}
func TestExpiry(t *testing.T) {
c := lfucache.New(3)
c.Insert("test1", 42) // usage=1
c.Access("test1") // usage=2
c.Access("test1") // usage=3
c.Insert("test2", 43) // usage=1
c.Insert("test3", 44) // usage=1
c.Access("test3") // usage=2
if v, _ := c.Access("test1"); v.(int) != 42 {
t.Error("Didn't get the right value back from the cache (test1)")
}
if v, _ := c.Access("test2"); v.(int) != 43 {
t.Error("Didn't get the right value back from the cache (test2)")
}
if v, _ := c.Access("test3"); v.(int) != 44 {
t.Error("Didn't get the right value back from the cache (test3)")
}
c.Insert("test4", 45) // usage=1, should remove test2 which is lfu
if v, _ := c.Access("test1"); v.(int) != 42 {
t.Error("Didn't get the right value back from the cache (test1)")
}
if _, ok := c.Access("test2"); ok {
t.Error("Node test2 was not removed")
}
if v, _ := c.Access("test3"); v.(int) != 44 {
t.Error("Didn't get the right value back from the cache (test3)")
}
if v, _ := c.Access("test4"); v.(int) != 45 {
t.Error("Didn't get the right value back from the cache (test4)")
}
}
func BenchmarkAccessHitRandomStr(b *testing.B) {
c := lfucache.New(cacheSize)
keys := make([]string, cacheSize)
for i := 0; i < cacheSize; i++ {
keys[i] = fmt.Sprintf("k%d", i)
}
for i := 0; i < cacheSize; i++ {
c.Insert(keys[i], i)
}
indexes := make([]string, cacheSize)
for i := 0; i < cacheSize; i++ {
indexes[i] = keys[int(rand.Int31n(cacheSize))]
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
c.Access(indexes[i%cacheSize])
}
}
func TestDoubleInsert(t *testing.T) {
c := lfucache.New(3)
c.Insert("test1", 42)
c.Insert("test1", 43)
c.Insert("test1", 44)
if c.Len() != 1 {
t.Error("Unexpected size")
}
if v, ok := c.Access("test1"); !ok || v.(int) != 44 {
t.Error("Incorrect entry")
}
c.Delete("test1")
if c.Len() != 0 {
t.Error("Unexpected size")
}
}
func main() {
n := flag.Int("n", 1000, "cache size")
alg := flag.String("alg", "", "algorithm")
file := flag.String("f", "", "input file")
cpuprofile := flag.Bool("cpuprofile", false, "cpuprofile")
memprofile := flag.Bool("memprofile", false, "memprofile")
flag.Parse()
if *alg == "" {
log.Fatalln("no algorithm provided (-alg)")
}
if *cpuprofile {
defer profile.Start(profile.CPUProfile).Stop()
}
count := 0
miss := 0
t0 := time.Now()
var f func(string) bool
switch *alg {
case "arc":
cache := arc.New(*n)
f = func(s string) bool {
var miss bool
cache.Get(s, func() interface{} {
miss = true
return s
})
return miss
}
case "random":
cache := random.New(*n)
f = func(s string) bool {
if i := cache.Get(s); i == nil {
cache.Set(s, s)
return true
}
return false
}
case "tworand":
cache := tworand.New(*n)
f = func(s string) bool {
if i := cache.Get(s); i == nil {
cache.Set(s, s)
return true
}
return false
}
case "lru":
cache := lru.New(*n)
f = func(s string) bool {
if _, ok := cache.Get(s); !ok {
cache.Add(s, s)
return true
}
return false
}
case "lfu":
cache := lfucache.New(*n)
f = func(s string) bool {
if _, ok := cache.Access(s); !ok {
cache.Insert(s, s)
return true
}
return false
}
case "clock":
cache := clock.New(*n)
f = func(s string) bool {
if i := cache.Get(s); i == nil {
cache.Set(s, s)
return true
}
return false
}
case "clockpro":
cache := clockpro.New(*n)
f = func(s string) bool {
if i := cache.Get(s); i == nil {
cache.Set(s, s)
return true
}
return false
}
case "slru":
cache := slru.New(int(float64(*n)*0.2), int(float64(*n)*0.8))
f = func(s string) bool {
if i := cache.Get(s); i == nil {
cache.Set(s, s)
return true
}
return false
}
case "s4lru":
cache := s4lru.New(*n)
f = func(s string) bool {
if _, ok := cache.Get(s); !ok {
cache.Set(s, s)
return true
}
return false
}
default:
log.Fatalln("unknown algorithm")
}
var inputFile = os.Stdin
if *file != "" {
var err error
inputFile, err = os.Open(*file)
if err != nil {
log.Fatalln(err)
}
defer inputFile.Close()
}
in := bufio.NewScanner(inputFile)
for in.Scan() {
if f(in.Text()) {
miss++
}
count++
}
if *memprofile {
var m runtime.MemStats
runtime.ReadMemStats(&m)
e := json.NewEncoder(os.Stdout)
e.Encode(m)
}
fmt.Printf("%s: %s %d total %d misses (hit rate %d %%)\n", *alg, time.Since(t0), count, miss, int(100*(float64(count-miss)/float64(count))))
}
func TestInstantiateCache(t *testing.T) {
_ = lfucache.New(42)
}
