-
Notifications
You must be signed in to change notification settings - Fork 0
/
main_test.go
278 lines (233 loc) · 7.03 KB
/
main_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
package mcache
import (
"fmt"
"log"
"runtime"
"strconv"
"sync"
"sync/atomic"
"testing"
"time"
"github.com/stretchr/testify/assert"
)
type testItem struct {
key string
value string
ttl time.Duration
}
func Test_SimpleTest_Mcache(t *testing.T) {
var c Cacher[string] = NewCache[string]()
assert.NotNil(t, c)
assert.IsType(t, &Cache[string]{}, c)
testItems := []testItem{
{"key0", "value0", time.Duration(0)},
{"key1", "value1", time.Millisecond * 100},
{"key11", "value11", time.Millisecond * 100},
{"key2", "value2", time.Second * 20},
{"key3", "value3", time.Second * 30},
{"key4", "value4", time.Second * 40},
{"key5", "value5", time.Second * 50},
{"key6", "value6", time.Second * 60},
{"key7", "value7", time.Second * 70000000},
}
noSuchKey := "noSuchKey"
for _, item := range testItems {
result := c.Set(item.key, item.value, item.ttl)
assert.True(t, result)
}
for _, item := range testItems {
value, err := c.Get(item.key)
assert.NoError(t, err, fmt.Sprintf("key:%s; val:%s; ttl:%d", item.key, item.value, item.ttl))
assert.Equal(t, item.value, value, fmt.Sprintf("key:%s; val:%s; ttl:%d", item.key, item.value, item.ttl))
}
_, err := c.Get(noSuchKey)
assert.Error(t, err)
assert.ErrorIs(t, ErrKeyNotFound, err)
for _, item := range testItems {
has, err := c.Has(item.key)
assert.NoError(t, err)
assert.True(t, has)
}
time.Sleep(200 * time.Millisecond)
item, err := c.Get(testItems[1].key)
assert.Error(t, err)
assert.ErrorIs(t, ErrExpired, err)
assert.Empty(t, item)
has, err := c.Has(testItems[2].key)
assert.Error(t, err)
assert.ErrorIs(t, ErrExpired, err)
assert.False(t, has)
testItems = append(testItems[3:], testItems[0])
for _, item := range testItems {
err := c.Del(item.key)
assert.NoError(t, err)
}
for _, item := range testItems {
has, err := c.Has(item.key)
assert.False(t, has)
assert.Error(t, err)
assert.ErrorIs(t, ErrKeyNotFound, err)
}
c.Set("key", "value", 100*time.Millisecond)
time.Sleep(200 * time.Millisecond)
result := c.Set("key", "newvalue", 100*time.Millisecond)
assert.True(t, result)
// old value should be rewritten
value, err := c.Get("key")
assert.NoError(t, err)
assert.Equal(t, "newvalue", value)
result = c.Set("key", "not a newer value", 1)
assert.False(t, result)
time.Sleep(200 * time.Millisecond)
result = c.Set("key", "even newer value", 100*time.Millisecond)
// key should be silently rewritten
assert.True(t, result)
value, err = c.Get("key")
assert.NoError(t, err)
assert.Equal(t, "even newer value", value)
time.Sleep(200 * time.Millisecond)
c.Cleanup()
// key should be deleted
has, err = c.Has("key")
assert.False(t, has)
assert.Error(t, err)
// del should return error if key doesn't exist
err = c.Del("noSuchKey")
assert.Error(t, err)
err = c.Clear()
assert.NoError(t, err)
}
func TestConcurrentSetAndGet(t *testing.T) {
cache := NewCache[string]()
// Start multiple goroutines to concurrently set and get values
numGoroutines := 10000
wg := sync.WaitGroup{}
wg.Add(numGoroutines)
for i := 0; i < numGoroutines; i++ {
go func(index int) {
defer wg.Done()
key := fmt.Sprintf("key-%d", index)
value := fmt.Sprintf("value-%d", index)
res := cache.Set(key, value, 0)
if res == false {
t.Errorf("Error setting value for key %s", key)
}
result, err := cache.Get(key)
if err != nil {
t.Errorf("Error getting value for key %s: %s", key, err)
}
if result != value {
t.Errorf("Expected value %s for key %s, but got %s", value, key, result)
}
}(i)
}
wg.Wait()
}
// catching the situation when the key is deleted before the value is retrieved
func TestConcurrentSetAndDel(t *testing.T) {
cache := NewCache[string]()
var cnt atomic.Int32
for i := 0; i < 1000; i++ {
cache.Set("key", "will be deleted", 0)
go func() {
v, err := cache.Get("key")
if err == nil && v == "" { // key was deleted before value was retrieved
cnt.Add(1)
}
}()
cache.Del("key")
}
assert.Equal(t, int32(0), cnt.Load(), "key was deleted before value was retrieved")
}
// TestWithCleanup tests that the cleanup goroutine is working
func TestWithCleanup(t *testing.T) {
cache := NewCache(WithCleanup[string](time.Millisecond * 100))
// Set a value with a TTL of 1 second
res := cache.Set("key", "value", 1)
assert.True(t, res, "Expected successfuly set value for key")
time.Sleep(time.Millisecond * 200)
// Check that the value expired
_, err := cache.Get("key")
assert.Error(t, err, "Expected the key to expire and be deleted")
}
func getAlloc() uint64 {
var m runtime.MemStats
runtime.ReadMemStats(&m)
return m.Alloc
}
func printAlloc(message string) {
log.Printf("%s %d KB\n", message, getAlloc()/1024)
}
// TestWithSize tests that the memory doesn't leak after Cleanup
func TestWithSize(t *testing.T) {
size := 10_000
printAlloc("Before")
cache := NewCache(WithSize[string](size))
memBefore := getAlloc()
for iter := 0; iter < 10; iter++ {
printAlloc("After NewCache")
for i := 0; i < size; i++ {
key := fmt.Sprintf("key-%d", i)
value := fmt.Sprintf("value-%d", i)
res := cache.Set(key, value, 100*time.Millisecond)
assert.True(t, res, "Expected successfuly set value for key")
}
printAlloc("After Set " + strconv.Itoa(size) + " entries")
cache.Cleanup()
printAlloc("After Cleanup")
// Check that the value has been deleted
_, err := cache.Get("key_1")
assert.Error(t, err, "Expected the key to be deleted")
time.Sleep(200 * time.Millisecond)
}
runtime.GC() // force GC to clean up the cache, make sure it's not leaking
printAlloc("After")
memAfter := getAlloc()
assert.Less(t, memAfter, memBefore*2, "Memory usage should not grow more than twice")
}
// TestThreadSafeCleanup tests that the cleanup goroutine is thread-safe
func TestThreadSafeCleanup(t *testing.T) {
cache := NewCache[string]()
for i := 0; i < 100; i++ {
cache.Set("key_"+strconv.Itoa(i), "value", time.Duration(10)*time.Millisecond)
go cache.Cleanup()
cache.Set("key_"+strconv.Itoa(i), "value", time.Duration(20)*time.Millisecond)
go cache.Cleanup()
cache.Set("key_"+strconv.Itoa(i), "value", time.Duration(30)*time.Millisecond)
go cache.Cleanup()
}
}
// verify that after the Cleanup, the unexpired keys are moved with the right values
func TestValuesAfterCleanup(t *testing.T) {
cache := NewCache[string]()
for i := 0; i < 10; i++ {
key := "key_" + strconv.Itoa(i)
val := "value_" + strconv.Itoa(i)
cache.Set(key, val, time.Second)
}
for i := 0; i < 10; i++ {
key := "key_expired_" + strconv.Itoa(i)
val := "value_expired_" + strconv.Itoa(i)
cache.Set(key, val, time.Millisecond)
}
time.Sleep(10 * time.Millisecond)
cache.Cleanup()
for i := 0; i < 10; i++ {
key := "key_" + strconv.Itoa(i)
val := "value_" + strconv.Itoa(i)
movedVal, err := cache.Get(key)
assert.NoError(t, err)
assert.Equal(t, val, movedVal)
}
var emptyVal string
for i := 0; i < 10; i++ {
key := "key_expired_" + strconv.Itoa(i)
movedVal, err := cache.Get(key)
assert.Error(t, err)
assert.Equal(t, emptyVal, movedVal)
}
}
func TestMain(m *testing.M) {
// Enable the race detector
m.Run()
}