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
|
package gcache
import (
"fmt"
"testing"
"time"
)
func loader(key interface{}) (interface{}, error) {
return fmt.Sprintf("valueFor%s", key), nil
}
func testSetCache(t *testing.T, gc Cache, numbers int) {
for i := 0; i < numbers; i++ {
key := fmt.Sprintf("Key-%d", i)
value, err := loader(key)
if err != nil {
t.Error(err)
return
}
gc.Set(key, value)
}
}
func testGetCache(t *testing.T, gc Cache, numbers int) {
for i := 0; i < numbers; i++ {
key := fmt.Sprintf("Key-%d", i)
v, err := gc.Get(key)
if err != nil {
t.Errorf("Unexpected error: %v", err)
}
expectedV, _ := loader(key)
if v != expectedV {
t.Errorf("Expected value is %v, not %v", expectedV, v)
}
}
}
func testGetIFPresent(t *testing.T, evT string) {
cache :=
New(8).
EvictType(evT).
LoaderFunc(
func(key interface{}) (interface{}, error) {
return "value", nil
}).
Build()
v, err := cache.GetIFPresent("key")
if err != KeyNotFoundError {
t.Errorf("err should not be %v", err)
}
time.Sleep(2 * time.Millisecond)
v, err = cache.GetIFPresent("key")
if err != nil {
t.Errorf("err should not be %v", err)
}
if v != "value" {
t.Errorf("v should not be %v", v)
}
}
func setItemsByRange(t *testing.T, c Cache, start, end int) {
for i := start; i < end; i++ {
if err := c.Set(i, i); err != nil {
t.Error(err)
}
}
}
func keysToMap(keys []interface{}) map[interface{}]struct{} {
m := make(map[interface{}]struct{}, len(keys))
for _, k := range keys {
m[k] = struct{}{}
}
return m
}
func checkItemsByRange(t *testing.T, keys []interface{}, m map[interface{}]interface{}, size, start, end int) {
if len(keys) != size {
t.Fatalf("%v != %v", len(keys), size)
} else if len(m) != size {
t.Fatalf("%v != %v", len(m), size)
}
km := keysToMap(keys)
for i := start; i < end; i++ {
if _, ok := km[i]; !ok {
t.Errorf("keys should contain %v", i)
}
v, ok := m[i]
if !ok {
t.Errorf("m should contain %v", i)
continue
}
if v.(int) != i {
t.Errorf("%v != %v", v, i)
continue
}
}
}
func testExpiredItems(t *testing.T, evT string) {
size := 8
cache :=
New(size).
Expiration(time.Millisecond).
EvictType(evT).
Build()
setItemsByRange(t, cache, 0, size)
checkItemsByRange(t, cache.Keys(true), cache.GetALL(true), cache.Len(true), 0, size)
time.Sleep(time.Millisecond)
checkItemsByRange(t, cache.Keys(false), cache.GetALL(false), cache.Len(false), 0, size)
if l := cache.Len(true); l != 0 {
t.Fatalf("GetALL should returns no items, but got length %v", l)
}
cache.Set(1, 1)
m := cache.GetALL(true)
if len(m) != 1 {
t.Fatalf("%v != %v", len(m), 1)
} else if l := cache.Len(true); l != 1 {
t.Fatalf("%v != %v", l, 1)
}
if m[1] != 1 {
t.Fatalf("%v != %v", m[1], 1)
}
}
func getSimpleEvictedFunc(t *testing.T) func(interface{}, interface{}) {
return func(key, value interface{}) {
t.Logf("Key=%v Value=%v will be evicted.\n", key, value)
}
}
func buildTestCache(t *testing.T, tp string, size int) Cache {
return New(size).
EvictType(tp).
EvictedFunc(getSimpleEvictedFunc(t)).
Build()
}
func buildTestLoadingCache(t *testing.T, tp string, size int, loader LoaderFunc) Cache {
return New(size).
EvictType(tp).
LoaderFunc(loader).
EvictedFunc(getSimpleEvictedFunc(t)).
Build()
}
func buildTestLoadingCacheWithExpiration(t *testing.T, tp string, size int, ep time.Duration) Cache {
return New(size).
EvictType(tp).
Expiration(ep).
LoaderFunc(loader).
EvictedFunc(getSimpleEvictedFunc(t)).
Build()
}
|
