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
|
/*
* Copyright 2016 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkLRUCache.h"
#include "Test.h"
struct Value {
Value(int value, int* counter)
: fValue(value)
, fCounter(counter) {
(*fCounter)++;
}
~Value() {
(*fCounter)--;
}
int fValue;
int* fCounter;
};
DEF_TEST(LRUCacheSequential, r) {
int instances = 0;
{
static const int kSize = 100;
SkLRUCache<int, std::unique_ptr<Value>> test(kSize);
for (int i = 1; i < kSize * 2; i++) {
REPORTER_ASSERT(r, !test.find(i));
test.insert(i, std::unique_ptr<Value>(new Value(i * i, &instances)));
REPORTER_ASSERT(r, test.find(i));
REPORTER_ASSERT(r, i * i == (*test.find(i))->fValue);
if (i > kSize) {
REPORTER_ASSERT(r, kSize == instances);
REPORTER_ASSERT(r, !test.find(i - kSize));
} else {
REPORTER_ASSERT(r, i == instances);
}
REPORTER_ASSERT(r, (int) test.count() == instances);
}
}
REPORTER_ASSERT(r, 0 == instances);
}
DEF_TEST(LRUCacheRandom, r) {
int instances = 0;
{
int seq[] = { 0, 1, 2, 3, 4, 1, 6, 2, 7, 5, 3, 2, 2, 3, 1, 7 };
int expected[] = { 7, 1, 3, 2, 5 };
static const int kSize = 5;
SkLRUCache<int, std::unique_ptr<Value>> test(kSize);
for (int i = 0; i < (int) (sizeof(seq) / sizeof(int)); i++) {
int k = seq[i];
if (!test.find(k)) {
test.insert(k, std::unique_ptr<Value>(new Value(k, &instances)));
}
}
REPORTER_ASSERT(r, kSize == instances);
REPORTER_ASSERT(r, kSize == test.count());
for (int i = 0; i < kSize; i++) {
int k = expected[i];
REPORTER_ASSERT(r, test.find(k));
REPORTER_ASSERT(r, k == (*test.find(k))->fValue);
}
}
REPORTER_ASSERT(r, 0 == instances);
}
|
