forked from soot-oss/soot
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathPriorityQueue.java
More file actions
342 lines (305 loc) · 8.06 KB
/
PriorityQueue.java
File metadata and controls
342 lines (305 loc) · 8.06 KB
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
341
342
/**
*
*/
package soot.util;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 1997 - 2018 Raja Vallée-Rai and others
* %%
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 2.1 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Lesser Public License for more details.
*
* You should have received a copy of the GNU General Lesser Public
* License along with this program. If not, see
* <http://www.gnu.org/licenses/lgpl-2.1.html>.
* #L%
*/
import java.util.AbstractMap;
import java.util.AbstractQueue;
import java.util.Arrays;
import java.util.ConcurrentModificationException;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Set;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
/**
* A fixed size priority queue based on bitsets. The elements of the priority queue are ordered according to a given
* universe. This priority queue does not permit {@code null} elements. Inserting of elements that are not part of the
* universe is also permitted (doing so will result in a {@code NoSuchElementException}).
*
* @author Steven Lambeth
* @param <E>
* the type of elements held in the universe
*/
public abstract class PriorityQueue<E> extends AbstractQueue<E> {
private static final Logger logger = LoggerFactory.getLogger(PriorityQueue.class);
private final List<? extends E> universe;
private final Map<E, Integer> ordinalMap;
final int N;
int min = Integer.MAX_VALUE;
PriorityQueue(List<? extends E> universe, Map<E, Integer> ordinalMap) {
assert ordinalMap.size() == universe.size();
this.universe = universe;
this.ordinalMap = ordinalMap;
this.N = universe.size();
}
abstract class Itr implements Iterator<E> {
long expected = getExpected();
int next = min;
int now = Integer.MAX_VALUE;
abstract long getExpected();
@Override
public boolean hasNext() {
return next < N;
}
@Override
public E next() {
if (expected != getExpected()) {
throw new ConcurrentModificationException();
}
if (next >= N) {
throw new NoSuchElementException();
}
now = next;
next = nextSetBit(next + 1);
return universe.get(now);
}
@Override
public void remove() {
if (now >= N) {
throw new IllegalStateException();
}
if (expected != getExpected()) {
throw new ConcurrentModificationException();
}
PriorityQueue.this.remove(now);
expected = getExpected();
now = Integer.MAX_VALUE;
}
}
int getOrdinal(Object o) {
if (o == null) {
throw new NullPointerException();
}
Integer i = ordinalMap.get(o);
if (i == null) {
throw new NoSuchElementException();
}
return i;
}
/**
* Adds all elements of the universe to this queue.
*/
abstract void addAll();
/**
* Returns the index of the first bit that is set to <code>true</code> that occurs on or after the specified starting
* index. If no such bit exists then a value bigger that {@code N} is returned.
*
* @param fromIndex
* the index to start checking from (inclusive).
* @return the index of the next set bit.
*/
abstract int nextSetBit(int fromIndex);
abstract boolean remove(int ordinal);
abstract boolean add(int ordinal);
abstract boolean contains(int ordinal);
/**
* {@inheritDoc}
*
*/
@Override
final public E peek() {
return isEmpty() ? null : universe.get(min);
}
/**
* {@inheritDoc}
*
*/
@Override
final public E poll() {
if (isEmpty()) {
return null;
}
E e = universe.get(min);
remove(min);
return e;
}
/**
* {@inheritDoc}
*
* @throws NoSuchElementException
* if e not part of the universe
* @throws NullPointerException
* if e is {@code null}
*/
@Override
final public boolean add(E e) {
return offer(e);
}
/**
* {@inheritDoc}
*
* @throws NoSuchElementException
* if e not part of the universe
* @throws NullPointerException
* if e is {@code null}
*/
@Override
final public boolean offer(E e) {
return add(getOrdinal(e));
}
/**
* {@inheritDoc}
*
*/
@Override
final public boolean remove(Object o) {
if (o == null || isEmpty()) {
return false;
}
try {
if (o.equals(peek())) {
remove(min);
return true;
} else {
return remove(getOrdinal(o));
}
} catch (NoSuchElementException e) {
logger.debug(e.getMessage());
return false;
}
}
/**
* {@inheritDoc}
*
*/
@Override
final public boolean contains(Object o) {
if (o == null) {
return false;
}
try {
if (o.equals(peek())) {
return true;
} else {
return contains(getOrdinal(o));
}
} catch (NoSuchElementException e) {
logger.debug(e.getMessage());
return false;
}
}
/**
* {@inheritDoc}
*
*/
@Override
public boolean isEmpty() {
return min >= N;
}
/**
* Creates a new full priority queue
*
* @param <E>
* @param universe
* @return
*/
public static <E> PriorityQueue<E> of(E[] universe) {
return of(Arrays.asList(universe));
}
/**
* Creates a new empty priority queue
*
* @param <E>
* @param universe
* @return
*/
public static <E> PriorityQueue<E> noneOf(E[] universe) {
return noneOf(Arrays.asList(universe));
}
/**
* Creates a new full priority queue
*
* @param <E>
* @param universe
* @return
*/
public static <E> PriorityQueue<E> of(List<? extends E> universe) {
PriorityQueue<E> q = noneOf(universe);
q.addAll();
return q;
}
/**
* Creates a new empty priority queue
*
* @param <E>
* @param universe
* @return
*/
public static <E> PriorityQueue<E> noneOf(List<? extends E> universe) {
Map<E, Integer> ordinalMap = new HashMap<E, Integer>(2 * universe.size() / 3);
int i = 0;
for (E e : universe) {
if (e == null) {
throw new NullPointerException("null is not allowed");
}
if (ordinalMap.put(e, i++) != null) {
throw new IllegalArgumentException("duplicate key found");
}
}
return newPriorityQueue(universe, ordinalMap);
}
public static <E extends Numberable> PriorityQueue<E> of(List<? extends E> universe, boolean useNumberInterface) {
PriorityQueue<E> q = noneOf(universe, useNumberInterface);
q.addAll();
return q;
}
public static <E extends Numberable> PriorityQueue<E> noneOf(final List<? extends E> universe,
boolean useNumberInterface) {
if (!useNumberInterface) {
return noneOf(universe);
}
int i = 0;
for (E e : universe) {
e.setNumber(i++);
}
return newPriorityQueue(universe, new AbstractMap<E, Integer>() {
@SuppressWarnings("unchecked")
@Override
public Integer get(Object key) {
return ((E) key).getNumber();
}
@Override
public int size() {
return universe.size();
}
@Override
public Set<java.util.Map.Entry<E, Integer>> entrySet() {
throw new UnsupportedOperationException();
}
});
}
private static <E> PriorityQueue<E> newPriorityQueue(List<? extends E> universe, Map<E, Integer> ordinalMap) {
final int universeSize = universe.size();
if (universeSize <= SmallPriorityQueue.MAX_CAPACITY) {
return new SmallPriorityQueue<E>(universe, ordinalMap);
} else if (universeSize <= MediumPriorityQueue.MAX_CAPACITY) {
return new MediumPriorityQueue<E>(universe, ordinalMap);
} else {
return new LargePriorityQueue<E>(universe, ordinalMap);
}
}
}