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
|
/*
* Copyright 2015 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkTDPQueue.h"
#include "SkRandom.h"
#include "Test.h"
namespace { bool intless(const int& a, const int& b) { return a < b; } }
static void simple_test(skiatest::Reporter* reporter) {
SkTDPQueue<int, intless> heap;
REPORTER_ASSERT(reporter, 0 == heap.count());
heap.insert(0);
REPORTER_ASSERT(reporter, 1 == heap.count());
REPORTER_ASSERT(reporter, 0 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 0 == heap.count());
heap.insert(0);
heap.insert(1);
REPORTER_ASSERT(reporter, 2 == heap.count());
REPORTER_ASSERT(reporter, 0 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 1 == heap.count());
REPORTER_ASSERT(reporter, 1 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 0 == heap.count());
heap.insert(2);
heap.insert(1);
heap.insert(0);
REPORTER_ASSERT(reporter, 3 == heap.count());
REPORTER_ASSERT(reporter, 0 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 2 == heap.count());
REPORTER_ASSERT(reporter, 1 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 1 == heap.count());
REPORTER_ASSERT(reporter, 2 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 0 == heap.count());
heap.insert(2);
heap.insert(3);
heap.insert(0);
heap.insert(1);
REPORTER_ASSERT(reporter, 4 == heap.count());
REPORTER_ASSERT(reporter, 0 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 3 == heap.count());
REPORTER_ASSERT(reporter, 1 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 2 == heap.count());
REPORTER_ASSERT(reporter, 2 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 1 == heap.count());
REPORTER_ASSERT(reporter, 3 == heap.peek());
heap.pop();
REPORTER_ASSERT(reporter, 0 == heap.count());
}
struct Dummy {
int fValue;
int fPriority;
mutable int fIndex;
static bool LessP(Dummy* const& a, Dummy* const& b) { return a->fPriority < b->fPriority; }
static int* PQIndex(Dummy* const& dummy) { return &dummy->fIndex; }
bool operator== (const Dummy& that) const {
return fValue == that.fValue && fPriority == that.fPriority;
}
bool operator!= (const Dummy& that) const { return !(*this == that); }
};
void random_test(skiatest::Reporter* reporter) {
SkRandom random;
static const Dummy kSentinel = {-1, -1, -1};
for (int i = 0; i < 100; ++i) {
// Create a random set of Dummy objects.
int count = random.nextULessThan(100);
SkTDArray<Dummy> array;
array.setReserve(count);
for (int j = 0; j < count; ++j) {
Dummy* dummy = array.append();
dummy->fPriority = random.nextS();
dummy->fValue = random.nextS();
dummy->fIndex = -1;
if (*dummy == kSentinel) {
array.pop();
--j;
}
}
// Stick the dummy objects in the pqueue.
SkTDPQueue<Dummy*, Dummy::LessP, Dummy::PQIndex> pq;
for (int j = 0; j < count; ++j) {
pq.insert(&array[j]);
}
REPORTER_ASSERT(reporter, pq.count() == array.count());
for (int j = 0; j < count; ++j) {
// every item should have an entry in the queue.
REPORTER_ASSERT(reporter, -1 != array[j].fIndex);
}
// Begin the test.
while (pq.count()) {
// Make sure the top of the queue is really the highest priority.
Dummy* top = pq.peek();
for (int k = 0; k < count; ++k) {
REPORTER_ASSERT(reporter, kSentinel == array[k] ||
array[k].fPriority >= top->fPriority);
}
// Do one of three random actions:
unsigned action = random.nextULessThan(3);
switch (action) {
case 0: { // pop the top,
Dummy* top = pq.peek();
REPORTER_ASSERT(reporter, array.begin() <= top && top < array.end());
pq.pop();
*top = kSentinel;
break;
}
case 1: { // remove a random element,
int item;
do {
item = random.nextULessThan(count);
} while (array[item] == kSentinel);
pq.remove(&array[item]);
array[item] = kSentinel;
break;
}
case 2: { // or change an element's priority.
int item;
do {
item = random.nextULessThan(count);
} while (array[item] == kSentinel);
array[item].fPriority = random.nextS();
pq.priorityDidChange(&array[item]);
break;
}
}
}
}
}
DEF_TEST(TDPQueueTest, reporter) {
simple_test(reporter);
random_test(reporter);
}
|
