-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHashMapList.java
207 lines (152 loc) · 3.99 KB
/
HashMapList.java
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
// Author: Jacob Schramkowski
import java.util.*;
/**
* A simple implementation of the MapList interface. The list is only sorted when it needs to be
* accessed to increase performance.
* @param <K> the key class type
* @param <V> the value class type
*/
public class HashMapList<K, V> implements MapList<K, V> {
private List<K> keys = new ArrayList<>();
private Map<K, V> values = new HashMap<>();
// can change
private Comparator<V> valueComparator = new Comparator<V>() {
@Override public int compare(V v, V t1) {
try {
return ((Comparable<V>) v).compareTo(t1);
} catch (ClassCastException e){
throw new IllegalStateException(
"Could not use default Comparator to sort values. Please call setComparator() first"
);
}
}
};
// must remain the same
private Comparator<K> keyComparator = new Comparator<K>() {
@Override
public int compare(K k, K t1) {
return valueComparator.compare(values.get(k), values.get(t1));
}
};
private boolean prepped = false, sorted = true;
private int prevIndex;
private K moveKey;
private void prepIfNeeded(K key){
if(prepped){
prevIndex = indexOfKey(key);
moveKey = key;
}
}
private void sortIfNeeded(){
if(!sorted){
Collections.sort(keys, keyComparator);
//keys.sort(keyComparator);
sorted = true;
}
}
@Override public V removeEntryAt(int index) {
sortIfNeeded();
K key = keyAt(index);
prepIfNeeded(key);
keys.remove(index);
return values.remove(key);
}
@Override public int indexOfKey(K key) {
sortIfNeeded();
return keys.indexOf(key);
}
@Override public K keyAt(int index) {
sortIfNeeded();
return keys.get(index);
}
@Override public V valueAt(int index) {
return get(keyAt(index));
}
@Override public void prepReport() {
if(prepped){
throw new IllegalStateException("Already prepped");
}
prepped = true;
}
@Override public MoveReport<K, V> getReport() {
if(!prepped){
throw new IllegalStateException("Must call prepReport() first");
}
prepped = false;
return new MoveReport<>(prevIndex, indexOfKey(moveKey), moveKey, values.get(moveKey));
}
@Override public List<K> keyList() {
sortIfNeeded();
return keys;
}
@Override public void setComparator(Comparator<V> valueComparator) {
this.valueComparator = valueComparator;
sorted = false;
}
@Override public int size() {
return values.size();
}
@Override public boolean isEmpty() {
return values.isEmpty();
}
@Override public boolean containsKey(Object o) {
return values.containsKey(o);
}
@Override public boolean containsValue(Object o) {
return values.containsValue(o);
}
@Override public V get(Object o) {
return values.get(o);
}
@Override public V put(K k, V v) {
prepIfNeeded(k);
if(!values.containsKey(k)){
keys.add(k);
}
sorted = false;
return values.put(k, v);
}
@Override public V remove(Object o) {
K k = (K) o;
prepIfNeeded(k);
if(values.containsKey(k)){
keys.remove(k);
} else {
return null;
}
return values.remove(o);
}
@Override public void putAll(Map<? extends K, ? extends V> map) {
prepped = false;
for(K key : map.keySet()){
put(key, map.get(key));
}
}
@Override public void clear() {
keys.clear();
values.clear();
}
@Override public Set<K> keySet() {
return values.keySet();
}
@Override public Collection<V> values() {
return values.values();
}
@Override public Set<Entry<K, V>> entrySet() {
return values.entrySet();
}
@Override public String toString() {
sortIfNeeded();
StringBuilder s = new StringBuilder();
s.append("{");
for(int i = 0; i < keys.size(); i++){
K key = keys.get(i);
if(i > 0) s.append(", ");
s.append(key);
s.append("=");
s.append(values.get(key));
}
s.append("}");
return s.toString();
}
}