forked from soot-oss/soot
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathArrayNumberer.java
More file actions
154 lines (136 loc) · 3.48 KB
/
ArrayNumberer.java
File metadata and controls
154 lines (136 loc) · 3.48 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
package soot.util;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 2002 Ondrej Lhotak
* %%
* 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.Arrays;
import java.util.BitSet;
import java.util.Iterator;
import java.util.NoSuchElementException;
/**
* A class that numbers objects, so they can be placed in bitsets.
*
* @author Ondrej Lhotak
* @author xiao, generalize it.
*/
public class ArrayNumberer<E extends Numberable> implements IterableNumberer<E> {
protected E[] numberToObj;
protected int lastNumber;
protected BitSet freeNumbers;
@SuppressWarnings("unchecked")
public ArrayNumberer() {
this.numberToObj = (E[]) new Numberable[1024];
this.lastNumber = 0;
}
public ArrayNumberer(E[] elements) {
this.numberToObj = elements;
this.lastNumber = elements.length;
}
private void resize(int n) {
numberToObj = Arrays.copyOf(numberToObj, n);
}
@Override
public synchronized void add(E o) {
if (o.getNumber() != 0) {
return;
}
// In case we removed entries from the numberer, we want to re-use the free space
int chosenNumber = -1;
if (freeNumbers != null) {
int ns = freeNumbers.nextSetBit(0);
if (ns != -1) {
chosenNumber = ns;
freeNumbers.clear(ns);
}
}
if (chosenNumber == -1) {
chosenNumber = ++lastNumber;
}
if (chosenNumber >= numberToObj.length) {
resize(numberToObj.length * 2);
}
numberToObj[chosenNumber] = o;
o.setNumber(chosenNumber);
}
@Override
public long get(E o) {
if (o == null) {
return 0;
}
int ret = o.getNumber();
if (ret == 0) {
throw new RuntimeException("unnumbered: " + o);
}
return ret;
}
@Override
public E get(long number) {
if (number == 0) {
return null;
}
E ret = numberToObj[(int) number];
if (ret == null) {
return null;
}
return ret;
}
@Override
public int size() {
return lastNumber;
}
@Override
public Iterator<E> iterator() {
return new Iterator<E>() {
int cur = 1;
@Override
public final boolean hasNext() {
return cur <= lastNumber && cur < numberToObj.length && numberToObj[cur] != null;
}
@Override
public final E next() {
if (hasNext()) {
return numberToObj[cur++];
}
throw new NoSuchElementException();
}
@Override
public final void remove() {
ArrayNumberer.this.remove(numberToObj[cur - 1]);
}
};
}
@Override
public boolean remove(E o) {
if (o == null) {
return false;
}
int num = o.getNumber();
if (num == 0) {
return false;
}
if (freeNumbers == null) {
freeNumbers = new BitSet(2 * num);
}
numberToObj[num] = null;
o.setNumber(0);
freeNumbers.set(num);
return true;
}
}