forked from soot-oss/soot
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathLargeNumberedMap.java
More file actions
115 lines (101 loc) · 2.96 KB
/
LargeNumberedMap.java
File metadata and controls
115 lines (101 loc) · 2.96 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
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.Iterator;
import java.util.NoSuchElementException;
/**
* A java.util.Map with Numberable objects as the keys. This one is designed for maps close to the size of the universe. For
* smaller maps, use SmallNumberedMap.
*
* @author Ondrej Lhotak
*/
public final class LargeNumberedMap<K extends Numberable, V> implements INumberedMap<K, V> {
private final IterableNumberer<K> universe;
private V[] values;
public LargeNumberedMap(IterableNumberer<K> universe) {
this.universe = universe;
int size = universe.size();
this.values = newArray(size < 8 ? 8 : size);
}
@SuppressWarnings("unchecked")
private static <T> T[] newArray(int size) {
return (T[]) new Object[size];
}
@Override
public boolean put(K key, V value) {
int number = key.getNumber();
if (number == 0) {
throw new RuntimeException(String.format("oops, forgot to initialize. Object is of type %s, and looks like this: %s",
key.getClass().getName(), key.toString()));
}
if (number >= values.length) {
Object[] oldValues = values;
values = newArray(Math.max(universe.size() * 2, number) + 5);
System.arraycopy(oldValues, 0, values, 0, oldValues.length);
}
boolean ret = (values[number] != value);
values[number] = value;
return ret;
}
@Override
public V get(K key) {
int i = key.getNumber();
if (i >= values.length) {
return null;
}
return values[i];
}
@Override
public void remove(K key) {
int i = key.getNumber();
if (i < values.length) {
values[i] = null;
}
}
@Override
public Iterator<K> keyIterator() {
return new Iterator<K>() {
int cur = 0;
private void advance() {
while (cur < values.length && values[cur] == null) {
cur++;
}
}
@Override
public boolean hasNext() {
advance();
return cur < values.length;
}
@Override
public K next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
return universe.get(cur++);
}
@Override
public void remove() {
values[cur - 1] = null;
}
};
}
}