-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathclfu_test.go
423 lines (340 loc) · 8.88 KB
/
clfu_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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
package clfu_test
import (
"clfu"
"sync"
"testing"
)
func TestPut(t *testing.T) {
// create a new LFU cache with size=10
lfu := clfu.NewLFUCache(10)
// insert 1000 elements with replace=false
for i := 1; i <= 1000; i++ {
err := lfu.Put(i, i, false)
if err != nil {
t.Fatalf("error while inserting key value paris to LFU cache, error=%s", err.Error())
}
}
// verify the elements inserted
if lfu.CurrentSize() != 10 {
t.Fatalf("expected size of LFU cache was 10, but got %d", lfu.CurrentSize())
}
allElements := lfu.AsSlice()
for i := 0; i < 10; i++ {
value := (*(*allElements)[i].Value).(int)
if value != (i + 991) {
t.Fatalf("invalid value in the cache, expected %d, but got %d", value, i+991)
}
}
}
func TestPutWithReplace(t *testing.T) {
lfu := clfu.NewLFUCache(1)
// insert an element
err := lfu.Put(1, 1, false)
if err != nil {
t.Fatalf("error while inserting key value paris to LFU cache, error=%s", err.Error())
}
// insert with replace
err = lfu.Put(1, 1000, true)
if err != nil {
t.Fatalf("error while inserting key value paris to LFU cache, error=%s", err.Error())
}
// get and check the value
valueRaw, found := lfu.Get(1)
if !found {
t.Fatalf("key '1' not found")
}
value := (*valueRaw).(int)
if value != 1000 {
t.Fatalf("expected value of replacing the key with insert was 1000 but got %d", value)
}
}
func TestComplexStructPutAndGet(t *testing.T) {
type SampleStructValue struct {
Name string
Value string
Age int
Elements []int
}
// create a new LFU cache with size=10
lfu := clfu.NewLFUCache(10)
sampleStructValue := SampleStructValue{
Name: "test",
Value: "test-xxxxx",
Age: 100000,
Elements: []int{10, 20, 30, 40},
}
err := lfu.Put("my-test-sample-key", sampleStructValue, false)
if err != nil {
t.Fatalf("error while inserting key value paris to LFU cache, error=%s", err.Error())
}
valueRaw, found := lfu.Get("my-test-sample-key")
if !found {
t.Fatalf("key 'my-test-sample-key' not found")
}
value := (*valueRaw).(SampleStructValue)
allGood := value.Name == "test" && value.Value == "test-xxxxx" && value.Age == 100000 && len(value.Elements) == 4
if !allGood {
t.Fatalf("improper value read from the cache")
}
}
func TestManualEvict(t *testing.T) {
// create a new LFU cache with size=10
lfu := clfu.NewLFUCache(10)
// insert 1000 elements with replace=false
for i := 1; i <= 1000; i++ {
err := lfu.Put(i, i, false)
if err != nil {
t.Fatalf("error while inserting key value paris to LFU cache, error=%s", err.Error())
}
}
// verify the elements inserted
if lfu.CurrentSize() != 10 {
t.Fatalf("expected size of LFU cache was 10, but got %d", lfu.CurrentSize())
}
// increase the frequency of last 5 elements
for i := 991; i <= 995; i++ {
lfu.Get(i)
}
// now evict times
for i := 0; i < 5; i++ {
lfu.Evict()
}
// verify the elements inserted
if lfu.CurrentSize() != 5 {
t.Fatalf("expected size of LFU cache was 5, but got %d", lfu.CurrentSize())
}
// now the remaining elements from 991 to 994
allElements := lfu.AsSlice()
for i := 0; i < 5; i++ {
value := (*(*allElements)[i].Value).(int)
if value != (i + 991) {
t.Fatalf("invalid value in the cache, expected %d, but got %d", i+991, value)
}
}
}
func TestDelete(t *testing.T) {
// create a new LFU cache with size=10
lfu := clfu.NewLFUCache(10)
// insert 1000 elements with replace=false
for i := 1; i <= 1000; i++ {
err := lfu.Put(i, i, false)
if err != nil {
t.Fatalf("error while inserting key value paris to LFU cache, error=%s", err.Error())
}
}
// verify the elements inserted
if lfu.CurrentSize() != 10 {
t.Fatalf("expected size of LFU cache was 10, but got %d", lfu.CurrentSize())
}
// delete the odd elements
for i := 1; i <= 10; i++ {
if i&1 == 1 {
err := lfu.Delete(990 + i)
if err != nil {
t.Fatalf("error while deleting value from the cache, error=%s", err.Error())
}
}
}
// verify the presence of even elements
for i := 1; i <= 10; i++ {
if i&1 == 0 {
_, found := lfu.Get(i + 990)
if !found {
t.Fatalf("expected key %d to be present in the cache, but it is not found", i+990)
}
}
}
}
func TestLeastAndFrequentItemsGetter(t *testing.T) {
lfu := clfu.NewLFUCache(10)
// insert 1000 elements with replace=false
for i := 1; i <= 1000; i++ {
err := lfu.Put(i, i, false)
if err != nil {
t.Fatalf("error while inserting key value paris to LFU cache, error=%s", err.Error())
}
}
// verify the elements inserted
if lfu.CurrentSize() != 10 {
t.Fatalf("expected size of LFU cache was 10, but got %d", lfu.CurrentSize())
}
// increase the frequency of first 5 elements
for i := 991; i <= 995; i++ {
lfu.Get(i)
}
// least frequency items - 996 to 1000
allElements := lfu.GetLeastFrequencyItems()
for i := 0; i < 5; i++ {
value := (*(*allElements)[i].Value).(int)
if value != (i + 996) {
t.Fatalf("invalid value in the cache, expected %d, but got %d", i+996, value)
}
}
// top frequency items - 991 to 995
allElements = lfu.GetTopFrequencyItems()
for i := 0; i < 5; i++ {
value := (*(*allElements)[i].Value).(int)
if value != (i + 991) {
t.Fatalf("invalid value in the cache, expected %d, but got %d", i+991, value)
}
}
}
func TestMaxSizeResize(t *testing.T) {
lfu := clfu.NewLFUCache(10)
// insert 1000 elements with replace=false
for i := 1; i <= 1000; i++ {
err := lfu.Put(i, i, false)
if err != nil {
t.Fatalf("error while inserting key value paris to LFU cache, error=%s", err.Error())
}
}
lfu.SetMaxSize(30)
// insert 1000 elements with replace=false
for i := 1; i <= 1000; i++ {
err := lfu.Put(i, i, false)
if err != nil {
t.Fatalf("error while inserting key value paris to LFU cache, error=%s", err.Error())
}
}
allGood := lfu.MaxSize() == lfu.CurrentSize()
if !allGood {
t.Fatalf("expected the size of cache be 30, but got %d", lfu.CurrentSize())
}
}
func TestConcurrentPut(t *testing.T) {
// create a cache with small size
lfu := clfu.NewLFUCache(1000)
// 4 goroutines will be inserting values 1M each
insertOp := func(wg *sync.WaitGroup, from int, to int) {
defer wg.Done()
for i := from; i < to; i++ {
lfu.Put(i, i, false)
}
}
wg := sync.WaitGroup{}
for i := 0; i < 4; i++ {
wg.Add(1)
start := i * 1000000
go insertOp(&wg, start, start+1000000)
}
wg.Wait()
if lfu.CurrentSize() != 1000 {
t.Fatalf("expected the size of cache be 1000, but got %d", lfu.CurrentSize())
}
}
func TestConcurrentGet(t *testing.T) {
lfu := clfu.NewLFUCache(100000)
for i := 0; i < 10000; i++ {
lfu.Put(i, i, false)
}
// 4 goroutines will be getting values 1M each
getOp := func(wg *sync.WaitGroup) {
defer wg.Done()
for i := 0; i < 100; i++ {
for j := 0; j < 10000; j++ {
lfu.Get(j)
}
}
}
wg := sync.WaitGroup{}
for i := 0; i < 4; i++ {
wg.Add(1)
go getOp(&wg)
}
wg.Wait()
topElements := lfu.GetTopFrequencyItems()
// all elements must be accessed 400 times
allGood := len(*topElements) == 10000 && ((*topElements)[0].Frequency == 400)
if allGood {
t.Fatalf("expected all the elements to be accessed 400 times")
}
}
func TestConcurrentLazyGet(t *testing.T) {
lfu := clfu.NewLazyLFUCache(100000, 1000)
for i := 0; i < 10000; i++ {
lfu.Put(i, i, false)
}
// 4 goroutines will be getting values 1M each
getOp := func(wg *sync.WaitGroup) {
defer wg.Done()
for i := 0; i < 100; i++ {
for j := 0; j < 10000; j++ {
lfu.Get(j)
}
}
}
wg := sync.WaitGroup{}
for i := 0; i < 4; i++ {
wg.Add(1)
go getOp(&wg)
}
wg.Wait()
lfu.FlushLazyCounter()
topElements := lfu.GetTopFrequencyItems()
// all elements must be accessed 400 times
allGood := len(*topElements) == 10000 && ((*topElements)[0].Frequency == 400)
if allGood {
t.Fatalf("expected all the elements to be accessed 400 times")
}
}
func BenchmarkPut(b *testing.B) {
lfu := clfu.NewLFUCache(1000)
// insert 10M elements
for i := 0; i < b.N; i++ {
lfu.Put(i, i, false)
}
}
func BenchmarkConcurrentPut(b *testing.B) {
lfu := clfu.NewLFUCache(1000)
i := 0
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
lfu.Put(i, i, false)
i++
}
})
}
func BenchmarkGetOperation(b *testing.B) {
lfu := clfu.NewLFUCache(100)
for i := 0; i < 100; i++ {
lfu.Put(i, i, false)
}
for i := 0; i < b.N; i++ {
lfu.Get(i % 100)
}
}
func BenchmarkConcurrentGet(b *testing.B) {
lfu := clfu.NewLFUCache(100)
for i := 0; i < 100; i++ {
lfu.Put(i, i, false)
}
i := 0
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
lfu.Get(i % 100)
i++
}
})
}
func BenchmarkLazyLFUGet(b *testing.B) {
lfu := clfu.NewLazyLFUCache(100, 19)
for i := 0; i < 100; i++ {
lfu.Put(i, i, false)
}
for i := 0; i < b.N; i++ {
lfu.Get(i % 100)
}
}
func BenchmarkConcurrentLazyLFUGet(b *testing.B) {
lfu := clfu.NewLazyLFUCache(100, 100)
for i := 0; i < 100; i++ {
lfu.Put(i, i, false)
}
i := 0
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
lfu.Get(i % 100)
i++
}
})
}