forked from soot-oss/soot
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathDeterministicHashMap.java
More file actions
201 lines (167 loc) · 4.89 KB
/
DeterministicHashMap.java
File metadata and controls
201 lines (167 loc) · 4.89 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
package soot.util;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 1997 - 1999 Raja Vallee-Rai
* %%
* 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.AbstractSet;
import java.util.HashMap;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.Set;
/**
* Implementation of HashMap which guarantees a stable (between executions) order for its elements upon iteration.
*
* This is quite useful for maps of Locals, to avoid nondeterministic local-name drift.
*/
public class DeterministicHashMap<K, V> extends HashMap<K, V> {
Set<K> keys = new TrustingMonotonicArraySet<K>();
/** Constructs a DeterministicHashMap with the given initial capacity. */
public DeterministicHashMap(int initialCapacity) {
super(initialCapacity);
}
/** Constructs a DeterministicHashMap with the given initial capacity and load factor. */
public DeterministicHashMap(int initialCapacity, float loadFactor) {
super(initialCapacity, loadFactor);
}
/** Inserts a mapping in this HashMap from <code>key</code> to <code>value</code>. */
@Override
public V put(K key, V value) {
if (!containsKey(key)) {
keys.add(key);
}
return super.put(key, value);
}
/** Removes the given object from this HashMap (unsupported). */
@Override
public V remove(Object obj) {
throw new UnsupportedOperationException();
}
/** Returns a backed list of keys for this HashMap (unsupported). */
@Override
public Set<K> keySet() {
return keys;
}
}
/**
* ArraySet which doesn't check that the elements that you insert are previous uncontained.
*/
class TrustingMonotonicArraySet<T> extends AbstractSet<T> {
private static final int DEFAULT_SIZE = 8;
private int numElements;
private int maxElements;
private T[] elements;
public TrustingMonotonicArraySet() {
maxElements = DEFAULT_SIZE;
@SuppressWarnings("unchecked")
T[] newElements = (T[]) new Object[DEFAULT_SIZE];
elements = newElements;
numElements = 0;
}
/**
* Create a set which contains the given elements.
*/
public TrustingMonotonicArraySet(T[] elements) {
this();
for (T element : elements) {
add(element);
}
}
@Override
public void clear() {
numElements = 0;
}
@Override
public boolean contains(Object obj) {
for (int i = 0; i < numElements; i++) {
if (elements[i].equals(obj)) {
return true;
}
}
return false;
}
@Override
public boolean add(T e) {
// Expand array if necessary
if (numElements == maxElements) {
doubleCapacity();
}
// Add element
elements[numElements++] = e;
return true;
}
@Override
public int size() {
return numElements;
}
@Override
public Iterator<T> iterator() {
return new ArrayIterator();
}
private class ArrayIterator implements Iterator<T> {
private int nextIndex;
ArrayIterator() {
nextIndex = 0;
}
@Override
public boolean hasNext() {
return nextIndex < numElements;
}
@Override
public T next() throws NoSuchElementException {
if (!(nextIndex < numElements)) {
throw new NoSuchElementException();
}
return elements[nextIndex++];
}
@Override
public void remove() throws NoSuchElementException {
if (nextIndex == 0) {
throw new NoSuchElementException();
} else {
removeElementAt(nextIndex - 1);
nextIndex = nextIndex - 1;
}
}
}
private void removeElementAt(int index) {
throw new UnsupportedOperationException();
/*
* // Handle simple case if(index == numElements - 1) { numElements--; return; }
*
* // Else, shift over elements System.arraycopy(elements, index + 1, elements, index, numElements - (index + 1));
* numElements--;
*/
}
private void doubleCapacity() {
int newSize = maxElements * 2;
@SuppressWarnings("unchecked")
T[] newElements = (T[]) new Object[newSize];
System.arraycopy(elements, 0, newElements, 0, numElements);
elements = newElements;
maxElements = newSize;
}
@Override
public T[] toArray() {
@SuppressWarnings("unchecked")
T[] array = (T[]) new Object[numElements];
System.arraycopy(elements, 0, array, 0, numElements);
return array;
}
}