forked from soot-oss/soot
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathMediumPriorityQueue.java
More file actions
177 lines (150 loc) · 3.85 KB
/
MediumPriorityQueue.java
File metadata and controls
177 lines (150 loc) · 3.85 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
/**
*
*/
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 static java.lang.Long.numberOfTrailingZeros;
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
/**
* @author Steven Lambeth
*
*/
class MediumPriorityQueue<E> extends PriorityQueue<E> {
final static int MAX_CAPACITY = Long.SIZE * Long.SIZE;
private final long[] data;
private int size = 0;
private long modCount = 0;
private long lookup = 0;
MediumPriorityQueue(List<? extends E> universe, Map<E, Integer> ordinalMap) {
super(universe, ordinalMap);
data = new long[(N + Long.SIZE - 1) >>> 6];
assert N > SmallPriorityQueue.MAX_CAPACITY;
assert N <= MAX_CAPACITY;
}
@Override
void addAll() {
size = N;
Arrays.fill(data, -1);
data[data.length - 1] = -1L >>> -size;
lookup = -1L >>> -data.length;
min = 0;
modCount++;
}
@Override
public void clear() {
size = 0;
Arrays.fill(data, 0);
lookup = 0;
min = Integer.MAX_VALUE;
modCount++;
}
@Override
int nextSetBit(int fromIndex) {
assert fromIndex >= 0;
for (int bb = fromIndex >>> 6; fromIndex < N;) {
// remove everything from t1 that is less than "fromIndex",
long m1 = -1L << fromIndex;
// t1 contains now all active bits
long t1 = data[bb] & m1;
// the expected index m1 in t1 is set (optional test if NOTZ is
// expensive)
if ((t1 & -m1) != 0) {
return fromIndex;
}
// some bits are left in t1, so we can finish
if (t1 != 0) {
return (bb << 6) + numberOfTrailingZeros(t1);
}
// we know the previous block is empty, so we start our lookup on
// the next one
long m0 = -1L << ++bb;
long t0 = lookup & m0;
// find next used block
if ((t0 & -m0) == 0) {
bb = numberOfTrailingZeros(t0);
}
// re-assign new search index
fromIndex = bb << 6;
// next and last round
}
return fromIndex;
}
@Override
boolean add(int ordinal) {
int bucket = ordinal >>> 6;
long prv = data[bucket];
long now = prv | (1L << ordinal);
if (prv == now) {
return false;
}
data[bucket] = now;
lookup |= (1L << bucket);
size++;
modCount++;
min = Math.min(min, ordinal);
return true;
}
@Override
boolean contains(int ordinal) {
assert ordinal >= 0;
assert ordinal < N;
return ((data[ordinal >>> 6] >>> ordinal) & 1L) == 1L;
}
@Override
boolean remove(int index) {
assert index >= 0;
assert index < N;
int bucket = index >>> 6;
long old = data[bucket];
long now = old & ~(1L << index);
if (old == now) {
return false;
}
if (0 == now) {
lookup &= ~(1L << bucket);
}
size--;
modCount++;
data[bucket] = now;
if (min == index) {
min = nextSetBit(min + 1);
}
return true;
}
@Override
public Iterator<E> iterator() {
return new Itr() {
@Override
long getExpected() {
return modCount;
}
};
}
@Override
public int size() {
return size;
}
}