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
|
/*
* Copyright 2014 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
// This is a GPU-backend specific test
#if SK_SUPPORT_GPU
#include "GrRedBlackTree.h"
#include "SkRandom.h"
#include "Test.h"
typedef GrRedBlackTree<int> Tree;
DEF_TEST(GrRedBlackTreeTest, reporter) {
Tree tree;
SkRandom r;
int count[100] = {0};
// add 10K ints
for (int i = 0; i < 10000; ++i) {
int x = r.nextU() % 100;
Tree::Iter xi = tree.insert(x);
REPORTER_ASSERT(reporter, *xi == x);
++count[x];
}
tree.insert(0);
++count[0];
tree.insert(99);
++count[99];
REPORTER_ASSERT(reporter, *tree.begin() == 0);
REPORTER_ASSERT(reporter, *tree.last() == 99);
REPORTER_ASSERT(reporter, --(++tree.begin()) == tree.begin());
REPORTER_ASSERT(reporter, --tree.end() == tree.last());
REPORTER_ASSERT(reporter, tree.count() == 10002);
int c = 0;
// check that we iterate through the correct number of
// elements and they are properly sorted.
for (Tree::Iter a = tree.begin(); tree.end() != a; ++a) {
Tree::Iter b = a;
++b;
++c;
REPORTER_ASSERT(reporter, b == tree.end() || *a <= *b);
}
REPORTER_ASSERT(reporter, c == tree.count());
// check that the tree reports the correct number of each int
// and that we can iterate through them correctly both forward
// and backward.
for (int i = 0; i < 100; ++i) {
int c;
c = tree.countOf(i);
REPORTER_ASSERT(reporter, c == count[i]);
c = 0;
Tree::Iter iter = tree.findFirst(i);
while (iter != tree.end() && *iter == i) {
++c;
++iter;
}
REPORTER_ASSERT(reporter, count[i] == c);
c = 0;
iter = tree.findLast(i);
if (iter != tree.end()) {
do {
if (*iter == i) {
++c;
} else {
break;
}
if (iter != tree.begin()) {
--iter;
} else {
break;
}
} while (true);
}
REPORTER_ASSERT(reporter, c == count[i]);
}
// remove all the ints between 25 and 74. Randomly chose to remove
// the first, last, or any entry for each.
for (int i = 25; i < 75; ++i) {
while (0 != tree.countOf(i)) {
--count[i];
int x = r.nextU() % 3;
Tree::Iter iter;
switch (x) {
case 0:
iter = tree.findFirst(i);
break;
case 1:
iter = tree.findLast(i);
break;
case 2:
default:
iter = tree.find(i);
break;
}
tree.remove(iter);
}
REPORTER_ASSERT(reporter, 0 == count[i]);
REPORTER_ASSERT(reporter, tree.findFirst(i) == tree.end());
REPORTER_ASSERT(reporter, tree.findLast(i) == tree.end());
REPORTER_ASSERT(reporter, tree.find(i) == tree.end());
}
// remove all of the 0 entries. (tests removing begin())
REPORTER_ASSERT(reporter, *tree.begin() == 0);
REPORTER_ASSERT(reporter, *(--tree.end()) == 99);
while (0 != tree.countOf(0)) {
--count[0];
tree.remove(tree.find(0));
}
REPORTER_ASSERT(reporter, 0 == count[0]);
REPORTER_ASSERT(reporter, tree.findFirst(0) == tree.end());
REPORTER_ASSERT(reporter, tree.findLast(0) == tree.end());
REPORTER_ASSERT(reporter, tree.find(0) == tree.end());
REPORTER_ASSERT(reporter, 0 < *tree.begin());
// remove all the 99 entries (tests removing last()).
while (0 != tree.countOf(99)) {
--count[99];
tree.remove(tree.find(99));
}
REPORTER_ASSERT(reporter, 0 == count[99]);
REPORTER_ASSERT(reporter, tree.findFirst(99) == tree.end());
REPORTER_ASSERT(reporter, tree.findLast(99) == tree.end());
REPORTER_ASSERT(reporter, tree.find(99) == tree.end());
REPORTER_ASSERT(reporter, 99 > *(--tree.end()));
REPORTER_ASSERT(reporter, tree.last() == --tree.end());
// Make sure iteration still goes through correct number of entries
// and is still sorted correctly.
c = 0;
for (Tree::Iter a = tree.begin(); tree.end() != a; ++a) {
Tree::Iter b = a;
++b;
++c;
REPORTER_ASSERT(reporter, b == tree.end() || *a <= *b);
}
REPORTER_ASSERT(reporter, c == tree.count());
// repeat check that correct number of each entry is in the tree
// and iterates correctly both forward and backward.
for (int i = 0; i < 100; ++i) {
REPORTER_ASSERT(reporter, tree.countOf(i) == count[i]);
int c = 0;
Tree::Iter iter = tree.findFirst(i);
while (iter != tree.end() && *iter == i) {
++c;
++iter;
}
REPORTER_ASSERT(reporter, count[i] == c);
c = 0;
iter = tree.findLast(i);
if (iter != tree.end()) {
do {
if (*iter == i) {
++c;
} else {
break;
}
if (iter != tree.begin()) {
--iter;
} else {
break;
}
} while (true);
}
REPORTER_ASSERT(reporter, count[i] == c);
}
// remove all entries
while (!tree.empty()) {
tree.remove(tree.begin());
}
// test reset on empty tree.
tree.reset();
}
#endif
|
