File: lfu_test.go

package info (click to toggle)
golang-github-code-hex-go-generics-cache 1.5.1-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 216 kB
  • sloc: makefile: 2
file content (115 lines) | stat: -rw-r--r-- 2,652 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
package lfu_test

import (
	"testing"

	"github.com/Code-Hex/go-generics-cache/policy/lfu"
)

type tmp struct {
	i int
}

func (t *tmp) GetReferenceCount() int { return t.i }

func TestSet(t *testing.T) {
	// set capacity is 1
	cache := lfu.NewCache[string, int](lfu.WithCapacity(1))
	cache.Set("foo", 1)
	if got := cache.Len(); got != 1 {
		t.Fatalf("invalid length: %d", got)
	}
	if got, ok := cache.Get("foo"); got != 1 || !ok {
		t.Fatalf("invalid value got %d, cachehit %v", got, ok)
	}

	// if over the cap
	cache.Set("bar", 2)
	if got := cache.Len(); got != 1 {
		t.Fatalf("invalid length: %d", got)
	}
	bar, ok := cache.Get("bar")
	if bar != 2 || !ok {
		t.Fatalf("invalid value bar %d, cachehit %v", bar, ok)
	}

	// checks deleted oldest
	if _, ok := cache.Get("foo"); ok {
		t.Fatalf("invalid delete oldest value foo %v", ok)
	}

	// valid: if over the cap but same key
	cache.Set("bar", 100)
	if got := cache.Len(); got != 1 {
		t.Fatalf("invalid length: %d", got)
	}
	bar, ok = cache.Get("bar")
	if bar != 100 || !ok {
		t.Fatalf("invalid replacing value bar %d, cachehit %v", bar, ok)
	}

	t.Run("with initilal reference count", func(t *testing.T) {
		cache := lfu.NewCache[string, *tmp](lfu.WithCapacity(2))
		cache.Set("foo", &tmp{i: 10}) // the highest reference count
		cache.Set("foo2", &tmp{i: 2}) // expected eviction
		if got := cache.Len(); got != 2 {
			t.Fatalf("invalid length: %d", got)
		}

		cache.Set("foo3", &tmp{i: 3})

		// checks deleted the lowest reference count
		if _, ok := cache.Get("foo2"); ok {
			t.Fatalf("invalid delete oldest value foo2 %v", ok)
		}
		if _, ok := cache.Get("foo"); !ok {
			t.Fatalf("invalid value foo is not found")
		}
	})
}

func TestDelete(t *testing.T) {
	cache := lfu.NewCache[string, int](lfu.WithCapacity(2))
	cache.Set("foo", 1)
	if got := cache.Len(); got != 1 {
		t.Fatalf("invalid length: %d", got)
	}

	cache.Delete("foo2")
	if got := cache.Len(); got != 1 {
		t.Fatalf("invalid length after deleted does not exist key: %d", got)
	}

	cache.Delete("foo")
	if got := cache.Len(); got != 0 {
		t.Fatalf("invalid length after deleted: %d", got)
	}
	if _, ok := cache.Get("foo"); ok {
		t.Fatalf("invalid get after deleted %v", ok)
	}
}

// check don't panic
func TestIssue33(t *testing.T) {
	cache := lfu.NewCache[string, int](lfu.WithCapacity(2))
	cache.Set("foo", 1)
	cache.Set("foo2", 2)
	cache.Set("foo3", 3)

	cache.Delete("foo")
	cache.Delete("foo2")
	cache.Delete("foo3")
}

func TestZeroCap(t *testing.T) {
	cache := lfu.NewCache[string, int](lfu.WithCapacity(0))
	cache.Set("foo", 1)

	v, ok := cache.Get("foo")
	if !ok {
		t.Error(ok)
	}
	if v != 1 {
		t.Error(v)
	}
}