-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathhashlru_test.go
177 lines (126 loc) · 2.53 KB
/
hashlru_test.go
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
package hlru
import (
"testing"
// "fmt"
)
func Test_HLRU(t *testing.T) {
lru, err := NewHLRU(100)
if err != nil {
t.Fatalf("Error in creating LRU: %v", err)
}
for i := 0; i < 150; i++ {
lru.Set(i, i)
}
if lru.Len() != 100 {
t.Fatalf("Error in LRU length: %v", lru.Len())
}
lru.Clear()
if lru.Len() != 0 {
t.Fatalf("Error in LRU Clear(): %v", lru.Len())
}
lru.Set(1, 1)
lru.Set(2, 1)
keys := lru.Keys()
for i := 0; i < len(keys); i++ {
_, ok := lru.Get(keys[i])
if !ok {
t.Fatalf("Error: %v", keys[i])
}
}
if len(keys) != lru.Len() {
t.Fatalf("Error: %v", keys)
}
}
func Test_onEvict(t *testing.T) {
evicted := 0
onEvict := func(key, value interface{}) {
if key != value {
t.Fatalf("Evict values not equal (%v!=%v)", key, value)
}
evicted++
}
lru, err := NewWithEvict(100, onEvict)
if err != nil {
t.Fatalf("Error in creating LRU: %v", err)
}
for i := 0; i < 150; i++ {
lru.Set(i, i)
}
if lru.Len() != 100 {
t.Fatalf("Error in LRU length: %v", lru.Len())
}
keys := lru.Keys()
// vals := lru.Vals()
for i := 0; i < len(keys); i++ {
if lru.Has(keys[i]) != true {
t.Fatalf("Error in Has() Keys()")
}
}
for i := 0; i < lru.Len(); i++ {
_, ok := lru.Peek(i)
if !ok {
t.Fatalf("Error in Peek()")
}
}
if evicted != 0 {
t.Fatalf("Error in evict callback: %v", evicted)
}
}
func Test_Remove_Resize(t *testing.T) {
lru, _ := NewHLRU(2)
lru.Set(1, 1)
lru.Set(2, 2)
ok := lru.Remove(2)
if !ok {
t.Fatalf("Error in Remove()")
}
if lru.Has(2) != false {
t.Fatalf("Error in Remove()")
}
lru.Set(3, 3)
lru.Set(2, 2)
if lru.Has(2) == false {
t.Fatalf("Error in Has()")
}
if lru.Has(1) != false {
t.Fatalf("Error in Remove()")
}
lru.Clear()
lru.Set(1, 1)
lru.Set(2, 2)
var evicted, _ = lru.Resize(1)
if evicted != 1 {
t.Fatalf("Error in Down Sizing")
}
// var keys = lru.Keys()
// // vals := lru.Vals()
// for i:=0; i<len(keys); i++ {
// fmt.Println("Key first", keys[i])
// }
evicted, _ = lru.Resize(2)
if evicted != 0 {
t.Fatalf("Error in Down Sizing")
}
lru.Set(3, 3)
lru.Set(4, 4)
lru.Set(5, 5)
if lru.Len() != 2 {
t.Fatalf("Error in LRU length: %v", lru.Len())
}
// keys = lru.Keys()
// // vals := lru.Vals()
// for i:=0; i<len(keys); i++ {
// fmt.Println("Key", keys[i])
// }
// fmt.Print("LEN ", lru.Len())
lru.Clear()
evicted, _ = lru.Resize(3)
if evicted != 0 {
t.Fatalf("Error in Down Sizing")
}
lru.Set(3, 3)
lru.Set(4, 4)
if lru.Len() != 2 {
t.Fatalf("Error in LRU length: %v", lru.Len())
}
}