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
|
/*
* Copyright 2015 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef SkTDPQueue_DEFINED
#define SkTDPQueue_DEFINED
#include "SkTDArray.h"
#include "SkTSort.h"
/**
* This class implements a priority queue. T is the type of the elements in the queue. LESS is a
* function that compares two Ts and returns true if the first is higher priority than the second.
*
* Optionally objects may know their index into the priority queue. The queue will update the index
* as the objects move through the queue. This is enabled by using a non-nullptr function for INDEX.
* When an INDEX function is provided random deletes from the queue are allowed using remove().
* Additionally, the * priority is allowed to change as long as priorityDidChange() is called
* afterwards. In debug builds the index will be set to -1 before an element is removed from the
* queue.
*/
template <typename T,
bool (*LESS)(const T&, const T&),
int* (*INDEX)(const T&) = (int* (*)(const T&))nullptr>
class SkTDPQueue {
public:
SkTDPQueue() {}
SkTDPQueue(SkTDPQueue&&) = default;
SkTDPQueue& operator =(SkTDPQueue&&) = default;
SkTDPQueue(const SkTDPQueue&) = delete;
SkTDPQueue& operator=(const SkTDPQueue&) = delete;
/** Number of items in the queue. */
int count() const { return fArray.count(); }
/** Gets the next item in the queue without popping it. */
const T& peek() const { return fArray[0]; }
T& peek() { return fArray[0]; }
/** Removes the next item. */
void pop() {
this->validate();
SkDEBUGCODE(if (SkToBool(INDEX)) { *INDEX(fArray[0]) = -1; })
if (1 == fArray.count()) {
fArray.pop();
return;
}
fArray[0] = fArray[fArray.count() - 1];
this->setIndex(0);
fArray.pop();
this->percolateDownIfNecessary(0);
this->validate();
}
/** Inserts a new item in the queue based on its priority. */
void insert(T entry) {
this->validate();
int index = fArray.count();
*fArray.append() = entry;
this->setIndex(fArray.count() - 1);
this->percolateUpIfNecessary(index);
this->validate();
}
/** Random access removal. This requires that the INDEX function is non-nullptr. */
void remove(T entry) {
SkASSERT(nullptr != INDEX);
int index = *INDEX(entry);
SkASSERT(index >= 0 && index < fArray.count());
this->validate();
SkDEBUGCODE(*INDEX(fArray[index]) = -1;)
if (index == fArray.count() - 1) {
fArray.pop();
return;
}
fArray[index] = fArray[fArray.count() - 1];
fArray.pop();
this->setIndex(index);
this->percolateUpOrDown(index);
this->validate();
}
/** Notification that the priority of an entry has changed. This must be called after an
item's priority is changed to maintain correct ordering. Changing the priority is only
allowed if an INDEX function is provided. */
void priorityDidChange(T entry) {
SkASSERT(nullptr != INDEX);
int index = *INDEX(entry);
SkASSERT(index >= 0 && index < fArray.count());
this->validate(index);
this->percolateUpOrDown(index);
this->validate();
}
/** Gets the item at index i in the priority queue (for i < this->count()). at(0) is equivalent
to peek(). Otherwise, there is no guarantee about ordering of elements in the queue. */
T at(int i) const { return fArray[i]; }
/** Sorts the queue into priority order. The queue is only guarenteed to remain in sorted order
* until any other operation, other than at(), is performed.
*/
void sort() {
if (fArray.count() > 1) {
SkTQSort<T>(fArray.begin(), fArray.end() - 1, LESS);
for (int i = 0; i < fArray.count(); i++) {
this->setIndex(i);
}
this->validate();
}
}
private:
static int LeftOf(int x) { SkASSERT(x >= 0); return 2 * x + 1; }
static int ParentOf(int x) { SkASSERT(x > 0); return (x - 1) >> 1; }
void percolateUpOrDown(int index) {
SkASSERT(index >= 0);
if (!percolateUpIfNecessary(index)) {
this->validate(index);
this->percolateDownIfNecessary(index);
}
}
bool percolateUpIfNecessary(int index) {
SkASSERT(index >= 0);
bool percolated = false;
do {
if (0 == index) {
this->setIndex(index);
return percolated;
}
int p = ParentOf(index);
if (LESS(fArray[index], fArray[p])) {
SkTSwap(fArray[index], fArray[p]);
this->setIndex(index);
index = p;
percolated = true;
} else {
this->setIndex(index);
return percolated;
}
this->validate(index);
} while (true);
}
void percolateDownIfNecessary(int index) {
SkASSERT(index >= 0);
do {
int child = LeftOf(index);
if (child >= fArray.count()) {
// We're a leaf.
this->setIndex(index);
return;
}
if (child + 1 >= fArray.count()) {
// We only have a left child.
if (LESS(fArray[child], fArray[index])) {
SkTSwap(fArray[child], fArray[index]);
this->setIndex(child);
this->setIndex(index);
return;
}
} else if (LESS(fArray[child + 1], fArray[child])) {
// The right child is the one we should swap with, if we swap.
child++;
}
// Check if we need to swap.
if (LESS(fArray[child], fArray[index])) {
SkTSwap(fArray[child], fArray[index]);
this->setIndex(index);
index = child;
} else {
// We're less than both our children.
this->setIndex(index);
return;
}
this->validate(index);
} while (true);
}
void setIndex(int index) {
SkASSERT(index < fArray.count());
if (SkToBool(INDEX)) {
*INDEX(fArray[index]) = index;
}
}
void validate(int excludedIndex = -1) const {
#ifdef SK_DEBUG
for (int i = 1; i < fArray.count(); ++i) {
int p = ParentOf(i);
if (excludedIndex != p && excludedIndex != i) {
SkASSERT(!(LESS(fArray[i], fArray[p])));
SkASSERT(!SkToBool(INDEX) || *INDEX(fArray[i]) == i);
}
}
#endif
}
SkTDArray<T> fArray;
};
#endif
|
