-
Notifications
You must be signed in to change notification settings - Fork 20
Expand file tree
/
Copy pathLruCacheTest.cs
More file actions
320 lines (253 loc) · 10.5 KB
/
LruCacheTest.cs
File metadata and controls
320 lines (253 loc) · 10.5 KB
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
/*
* Copyright 2022-2023, Optimizely
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
using System;
using System.Collections.Generic;
using System.Threading;
using NUnit.Framework;
using OptimizelySDK.Odp;
namespace OptimizelySDK.Tests.OdpTests
{
public class LruCacheTest
{
private List<string> _segments1And2;
private List<string> _segments3And4;
private List<string> _segments5And6;
[SetUp]
public void SetUp()
{
_segments1And2 = new List<string>
{
"segment1",
"segment2",
};
_segments3And4 = new List<string>
{
"segment3",
"segment4",
};
_segments5And6 = new List<string>
{
"segment5",
"segment6",
};
}
[Test]
public void ShouldCreateSaveAndLookupOneItem()
{
var cache = new LruCache<string>();
Assert.IsNull(cache.Lookup("key1"));
cache.Save("key1", "value1");
Assert.AreEqual("value1", cache.Lookup("key1"));
}
[Test]
public void ShouldSaveAndLookupMultipleItems()
{
var cache = new LruCache<List<string>>();
cache.Save("user1", _segments1And2);
cache.Save("user2", _segments3And4);
cache.Save("user3", _segments5And6);
var cacheKeys = cache.CurrentCacheKeysForTesting();
Assert.AreEqual("user3", cacheKeys[0]);
Assert.AreEqual("user2", cacheKeys[1]);
Assert.AreEqual("user1", cacheKeys[2]);
// Lookup should move user1 to top of the list and push down others.
Assert.AreEqual(_segments1And2, cache.Lookup("user1"));
cacheKeys = cache.CurrentCacheKeysForTesting();
Assert.AreEqual("user1", cacheKeys[0]);
Assert.AreEqual("user3", cacheKeys[1]);
Assert.AreEqual("user2", cacheKeys[2]);
// Lookup should move user2 to the beginning of the list and push others.
Assert.AreEqual(_segments3And4, cache.Lookup("user2"));
cacheKeys = cache.CurrentCacheKeysForTesting();
Assert.AreEqual("user2", cacheKeys[0]);
Assert.AreEqual("user1", cacheKeys[1]);
Assert.AreEqual("user3", cacheKeys[2]);
// Lookup moves user3 to top and pushes others down.
Assert.AreEqual(_segments5And6, cache.Lookup("user3"));
cacheKeys = cache.CurrentCacheKeysForTesting();
Assert.AreEqual("user3", cacheKeys[0]);
Assert.AreEqual("user2", cacheKeys[1]);
Assert.AreEqual("user1", cacheKeys[2]);
}
[Test]
public void ShouldReorderListOnSave()
{
var cache = new LruCache<List<string>>();
cache.Save("user1", _segments1And2);
cache.Save("user2", _segments3And4);
cache.Save("user3", _segments5And6);
var cacheKeys = cache.CurrentCacheKeysForTesting();
// last added should be at the top of the list
Assert.AreEqual("user3", cacheKeys[0]);
Assert.AreEqual("user2", cacheKeys[1]);
Assert.AreEqual("user1", cacheKeys[2]);
// save should move user1 to the top of the list and push down others.
cache.Save("user1", _segments1And2);
cacheKeys = cache.CurrentCacheKeysForTesting();
Assert.AreEqual("user1", cacheKeys[0]);
Assert.AreEqual("user3", cacheKeys[1]);
Assert.AreEqual("user2", cacheKeys[2]);
// save user2 should bring it to the top and push down others.
cache.Save("user2", _segments3And4);
cacheKeys = cache.CurrentCacheKeysForTesting();
Assert.AreEqual("user2", cacheKeys[0]);
Assert.AreEqual("user1", cacheKeys[1]);
Assert.AreEqual("user3", cacheKeys[2]);
// saving user3 again should return to the original insertion order.
cache.Save("user3", _segments5And6);
cacheKeys = cache.CurrentCacheKeysForTesting();
Assert.AreEqual("user3", cacheKeys[0]);
Assert.AreEqual("user2", cacheKeys[1]);
Assert.AreEqual("user1", cacheKeys[2]);
}
[Test]
public void ShouldHandleWhenCacheIsDisabled()
{
var cache = new LruCache<List<string>>(0);
cache.Save("user1", _segments1And2);
cache.Save("user2", _segments3And4);
cache.Save("user3", _segments5And6);
Assert.IsNull(cache.Lookup("user1"));
Assert.IsNull(cache.Lookup("user2"));
Assert.IsNull(cache.Lookup("user3"));
}
[Test]
public void ShouldHandleWhenItemsExpire()
{
var cache = new LruCache<List<string>>(itemTimeout: TimeSpan.FromSeconds(1));
cache.Save("user1", _segments1And2);
Assert.AreEqual(_segments1And2, cache.Lookup("user1"));
Assert.AreEqual(1, cache.CurrentCacheKeysForTesting().Length);
Thread.Sleep(1200);
Assert.IsNull(cache.Lookup("user1"));
Assert.AreEqual(0, cache.CurrentCacheKeysForTesting().Length);
}
[Test]
public void ShouldHandleWhenCacheReachesMaxSize()
{
var cache = new LruCache<List<string>>(2);
cache.Save("user1", _segments1And2);
cache.Save("user2", _segments3And4);
cache.Save("user3", _segments5And6);
Assert.AreEqual(2, cache.CurrentCacheKeysForTesting().Length);
Assert.AreEqual(_segments5And6, cache.Lookup("user3"));
Assert.AreEqual(_segments3And4, cache.Lookup("user2"));
Assert.IsNull(cache.Lookup("user1"));
}
[Test]
public void ShouldHandleWhenCacheIsReset()
{
var cache = new LruCache<List<string>>();
cache.Save("user1", _segments1And2);
cache.Save("user2", _segments3And4);
cache.Save("user3", _segments5And6);
Assert.AreEqual(_segments1And2, cache.Lookup("user1"));
Assert.AreEqual(_segments3And4, cache.Lookup("user2"));
Assert.AreEqual(_segments5And6, cache.Lookup("user3"));
Assert.AreEqual(3, cache.CurrentCacheKeysForTesting().Length);
cache.Reset();
Assert.IsNull(cache.Lookup("user1"));
Assert.IsNull(cache.Lookup("user2"));
Assert.IsNull(cache.Lookup("user3"));
Assert.AreEqual(0, cache.CurrentCacheKeysForTesting().Length);
}
[Test]
public void ShouldHandleRemoveNonExistentKey()
{
var cache = new LruCache<List<string>>();
cache.Save("user1", _segments1And2);
cache.Save("user2", _segments3And4);
// Remove a key that doesn't exist
cache.Remove("user3");
// Existing keys should still be there
Assert.AreEqual(_segments1And2, cache.Lookup("user1"));
Assert.AreEqual(_segments3And4, cache.Lookup("user2"));
}
[Test]
public void ShouldHandleRemoveExistingKey()
{
var cache = new LruCache<List<string>>();
cache.Save("user1", _segments1And2);
cache.Save("user2", _segments3And4);
cache.Save("user3", _segments5And6);
Assert.AreEqual(_segments1And2, cache.Lookup("user1"));
Assert.AreEqual(_segments3And4, cache.Lookup("user2"));
Assert.AreEqual(_segments5And6, cache.Lookup("user3"));
cache.Remove("user2");
Assert.AreEqual(_segments1And2, cache.Lookup("user1"));
Assert.IsNull(cache.Lookup("user2"));
Assert.AreEqual(_segments5And6, cache.Lookup("user3"));
}
[Test]
public void ShouldHandleRemoveFromZeroSizedCache()
{
var cache = new LruCache<List<string>>(0);
cache.Save("user1", _segments1And2);
cache.Remove("user1");
Assert.IsNull(cache.Lookup("user1"));
Assert.AreEqual(0, cache.CurrentCacheKeysForTesting().Length);
}
[Test]
public void ShouldHandleRemoveAndAddBack()
{
var cache = new LruCache<List<string>>();
cache.Save("user1", _segments1And2);
cache.Save("user2", _segments3And4);
cache.Save("user3", _segments5And6);
// Remove user2 and add it back with different data
cache.Remove("user2");
cache.Save("user2", _segments1And2);
Assert.AreEqual(_segments1And2, cache.Lookup("user1"));
Assert.AreEqual(_segments1And2, cache.Lookup("user2"));
Assert.AreEqual(_segments5And6, cache.Lookup("user3"));
Assert.AreEqual(3, cache.CurrentCacheKeysForTesting().Length);
}
[Test]
public void ShouldHandleThreadSafetyWithRemove()
{
var cache = new LruCache<string>(100);
for (int i = 1; i <= 100; i++)
{
cache.Save($"key{i}", $"value{i}");
}
var threads = new List<Thread>();
for (int i = 1; i <= 50; i++)
{
int localI = i; // Capture variable for closure
var thread = new Thread(() => cache.Remove($"key{localI}"));
threads.Add(thread);
thread.Start();
}
// Wait for all threads to complete
foreach (var thread in threads)
{
thread.Join();
}
for (int i = 1; i <= 100; i++)
{
if (i <= 50)
{
Assert.IsNull(cache.Lookup($"key{i}"), $"key{i} should be removed");
}
else
{
Assert.AreEqual($"value{i}", cache.Lookup($"key{i}"), $"key{i} should still exist");
}
}
Assert.AreEqual(50, cache.CurrentCacheKeysForTesting().Length);
}
}
}