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
|
/////////////////////////////////////////////////////////////////////////////
// Copyright (c) Electronic Arts Inc. All rights reserved.
/////////////////////////////////////////////////////////////////////////////
#include "EASTLTest.h"
#include <EASTL/bonus/lru_cache.h>
#include <EASTL/unique_ptr.h>
namespace TestLruCacheInternal
{
struct Foo
{
static int count;
Foo()
: a(count++)
, b(count++)
{ }
Foo(int x, int y) : a(x), b(y) {}
int a;
int b;
bool operator==(const Foo &other)
{
return this->a == other.a && this->b == other.b;
}
};
int Foo::count = 0;
class FooCreator
{
public:
FooCreator() : mFooCreatedCount(0) {}
Foo *Create()
{
mFooCreatedCount++;
return new Foo();
}
void Destroy(Foo *f)
{
delete f;
mFooCreatedCount--;
}
int mFooCreatedCount;
};
}
int TestLruCache()
{
int nErrorCount = 0;
// Test simple situation
{
using namespace TestLruCacheInternal;
eastl::lru_cache<int, Foo> lruCache(3);
// Empty state
EATEST_VERIFY(lruCache.contains(1) == false);
EATEST_VERIFY(lruCache.size() == 0);
EATEST_VERIFY(lruCache.empty() == true);
EATEST_VERIFY(lruCache.capacity() == 3);
EATEST_VERIFY(lruCache.at(1).has_value() == false);
// Auto create with get call
EATEST_VERIFY(lruCache[0].a == 0);
EATEST_VERIFY(lruCache[0].b == 1);
EATEST_VERIFY(lruCache.contains(1) == false);
EATEST_VERIFY(lruCache.contains(0) == true);
EATEST_VERIFY(lruCache.size() == 1);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
// Fill structure up to 2 more entries to fill out, also test at()
lruCache.insert(1, Foo(2, 3));
EATEST_VERIFY(lruCache.at(1).value().a == 2);
EATEST_VERIFY(lruCache.at(1).value().b == 3);
EATEST_VERIFY(lruCache.contains(0) == true);
EATEST_VERIFY(lruCache.contains(1) == true);
EATEST_VERIFY(lruCache.contains(2) == false);
EATEST_VERIFY(lruCache.contains(3) == false);
EATEST_VERIFY(lruCache.size() == 2);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
lruCache.insert(2, Foo(4, 5));
EATEST_VERIFY(lruCache[2].a == 4);
EATEST_VERIFY(lruCache[2].b == 5);
EATEST_VERIFY(lruCache.contains(0) == true);
EATEST_VERIFY(lruCache.contains(1) == true);
EATEST_VERIFY(lruCache.contains(2) == true);
EATEST_VERIFY(lruCache.contains(3) == false);
EATEST_VERIFY(lruCache.size() == 3);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
// Add another entry, at this point 0 is the oldest, so it should be pulled
lruCache.insert(3, Foo(6, 7));
EATEST_VERIFY(lruCache[3].a == 6);
EATEST_VERIFY(lruCache[3].b == 7);
EATEST_VERIFY(lruCache.contains(0) == false);
EATEST_VERIFY(lruCache.contains(1) == true);
EATEST_VERIFY(lruCache.contains(2) == true);
EATEST_VERIFY(lruCache.contains(3) == true);
EATEST_VERIFY(lruCache.size() == 3);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
// Touch the now oldest 1 key
EATEST_VERIFY(lruCache.touch(1) == true);
// Add another entry, this will be #4 but since 1 was touched, 2 is now the oldest
lruCache.insert(4, Foo(8, 9));
EATEST_VERIFY(lruCache[4].a == 8);
EATEST_VERIFY(lruCache[4].b == 9);
EATEST_VERIFY(lruCache.contains(0) == false);
EATEST_VERIFY(lruCache.contains(1) == true);
EATEST_VERIFY(lruCache.contains(2) == false);
EATEST_VERIFY(lruCache.contains(3) == true);
EATEST_VERIFY(lruCache.contains(4) == true);
EATEST_VERIFY(lruCache.size() == 3);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
// Test resize down
EATEST_VERIFY(lruCache.touch(3) == true); // Let's make some key in the middle the most recent
lruCache.resize(1); // Resize down to 1 entry in the cache
EATEST_VERIFY(lruCache.contains(0) == false);
EATEST_VERIFY(lruCache.contains(1) == false);
EATEST_VERIFY(lruCache.contains(2) == false);
EATEST_VERIFY(lruCache.contains(3) == true);
EATEST_VERIFY(lruCache.contains(4) == false);
EATEST_VERIFY(lruCache.size() == 1);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 1);
// Let's resize up to a size of 5 now
lruCache.resize(5);
EATEST_VERIFY(lruCache.contains(0) == false);
EATEST_VERIFY(lruCache.contains(1) == false);
EATEST_VERIFY(lruCache.contains(2) == false);
EATEST_VERIFY(lruCache.contains(3) == true);
EATEST_VERIFY(lruCache.contains(4) == false);
EATEST_VERIFY(lruCache.size() == 1);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 5);
// Let's try updating
lruCache.assign(3, Foo(0, 0));
EATEST_VERIFY(lruCache[3] == Foo(0, 0));
EATEST_VERIFY(lruCache.contains(0) == false);
EATEST_VERIFY(lruCache.contains(1) == false);
EATEST_VERIFY(lruCache.contains(2) == false);
EATEST_VERIFY(lruCache.contains(3) == true);
EATEST_VERIFY(lruCache.contains(4) == false);
EATEST_VERIFY(lruCache.size() == 1);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 5);
// add or update existing
lruCache.insert_or_assign(3, Foo(1, 1));
EATEST_VERIFY(lruCache[3] == Foo(1, 1));
EATEST_VERIFY(lruCache.contains(0) == false);
EATEST_VERIFY(lruCache.contains(1) == false);
EATEST_VERIFY(lruCache.contains(2) == false);
EATEST_VERIFY(lruCache.contains(3) == true);
EATEST_VERIFY(lruCache.contains(4) == false);
EATEST_VERIFY(lruCache.size() == 1);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 5);
// Add or update a new entry
lruCache.insert_or_assign(25, Foo(2, 2));
EATEST_VERIFY(lruCache[3] == Foo(1, 1));
EATEST_VERIFY(lruCache[25] == Foo(2, 2));
EATEST_VERIFY(lruCache.contains(0) == false);
EATEST_VERIFY(lruCache.contains(1) == false);
EATEST_VERIFY(lruCache.contains(2) == false);
EATEST_VERIFY(lruCache.contains(3) == true);
EATEST_VERIFY(lruCache.contains(4) == false);
EATEST_VERIFY(lruCache.contains(25) == true);
EATEST_VERIFY(lruCache.size() == 2);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 5);
// clear everything
lruCache.clear();
EATEST_VERIFY(lruCache.size() == 0);
EATEST_VERIFY(lruCache.empty() == true);
EATEST_VERIFY(lruCache.capacity() == 5);
EATEST_VERIFY(lruCache.contains(3) == false);
// test unilateral reset
lruCache[1] = Foo(1, 2);
lruCache.reset_lose_memory();
EATEST_VERIFY(lruCache.size() == 0);
}
// Test more advanced creation / deletion via callbacks
{
using namespace TestLruCacheInternal;
FooCreator fooCreator;
auto createCallback = [&fooCreator](int) { return fooCreator.Create(); };
auto deleteCallback = [&fooCreator](Foo *f) { fooCreator.Destroy(f); };
eastl::lru_cache<int, Foo*> lruCache(3, EASTLAllocatorType("eastl lru_cache"), createCallback, deleteCallback);
lruCache[1];
EATEST_VERIFY(fooCreator.mFooCreatedCount == 1);
EATEST_VERIFY(lruCache.size() == 1);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
EATEST_VERIFY(lruCache.contains(1) == true);
EATEST_VERIFY(lruCache.contains(2) == false);
lruCache[2];
EATEST_VERIFY(fooCreator.mFooCreatedCount == 2);
EATEST_VERIFY(lruCache.size() == 2);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
EATEST_VERIFY(lruCache.contains(1) == true);
EATEST_VERIFY(lruCache.contains(2) == true);
// Update 2, which should delete the existing entry
{
auto f = fooCreator.Create();
EATEST_VERIFY(fooCreator.mFooCreatedCount == 3);
f->a = 20;
f->b = 21;
lruCache.assign(2, f);
EATEST_VERIFY(fooCreator.mFooCreatedCount == 2);
EATEST_VERIFY(lruCache.size() == 2);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
EATEST_VERIFY(lruCache.contains(1) == true);
EATEST_VERIFY(lruCache.contains(2) == true);
EATEST_VERIFY(lruCache[2]->a == 20);
EATEST_VERIFY(lruCache[2]->b == 21);
}
lruCache.erase(2);
EATEST_VERIFY(fooCreator.mFooCreatedCount == 1);
EATEST_VERIFY(lruCache.size() == 1);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
EATEST_VERIFY(lruCache.contains(1) == true);
EATEST_VERIFY(lruCache.contains(2) == false);
lruCache.erase(1);
EATEST_VERIFY(fooCreator.mFooCreatedCount == 0);
EATEST_VERIFY(lruCache.size() == 0);
EATEST_VERIFY(lruCache.empty() == true);
EATEST_VERIFY(lruCache.capacity() == 3);
EATEST_VERIFY(lruCache.contains(1) == false);
EATEST_VERIFY(lruCache.contains(2) == false);
// Test insert_or_assign
{
auto f = fooCreator.Create();
f->a = 22;
f->b = 30;
EATEST_VERIFY(fooCreator.mFooCreatedCount == 1);
lruCache.insert_or_assign(7, f);
EATEST_VERIFY(lruCache.size() == 1);
EATEST_VERIFY(lruCache.empty() == false);
EATEST_VERIFY(lruCache.capacity() == 3);
EATEST_VERIFY(lruCache.contains(1) == false);
EATEST_VERIFY(lruCache.contains(2) == false);
EATEST_VERIFY(lruCache.contains(7) == true);
EATEST_VERIFY(lruCache.erase(7) == true);
EATEST_VERIFY(fooCreator.mFooCreatedCount == 0);
}
}
// Test iteration
{
eastl::lru_cache<int, int> lc(5);
lc.insert_or_assign(0,10);
lc.insert_or_assign(1,11);
lc.insert_or_assign(2,12);
lc.insert_or_assign(3,13);
lc.insert_or_assign(4,14);
{ // test manual for-loop
int i = 0;
for (auto b = lc.begin(), e = lc.end(); b != e; b++)
{
auto &p = *b;
VERIFY(i == p.first);
VERIFY(i + 10 == p.second.first);
i++;
}
}
{ // test pairs
int i = 0;
for(auto& p : lc)
{
VERIFY(i == p.first);
VERIFY(i + 10 == p.second.first);
i++;
}
}
{ // test structured bindings
int i = 0;
for(auto& [key, value] : lc)
{
VERIFY(i == key);
VERIFY(i + 10 == value.first);
i++;
}
}
}
// test initializer_list
{
eastl::lru_cache<int, int> lc = {{0, 10}, {1, 11}, {2, 12}, {3, 13}, {4, 14}, {5, 15}};
int i = 0;
for(auto& p : lc)
{
VERIFY(i == p.first);
VERIFY(i + 10 == p.second.first);
i++;
}
}
return nErrorCount;
}
|