blob: 410eb53b05441032b597447b494b4930972c9754 (
plain)
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
|
package bjc.esodata;
import java.util.*;
import java.util.function.*;
import bjc.data.*;
import bjc.funcdata.*;
/**
* A variant of a map where inserting a duplicate key shadows the existing value
* instead of replacing it.
*
* This could be useful for things like variable scopes.
*
* @author EVE
*
* @param <KeyType>
* The key of the map.
*
* @param <ValueType>
* The values in the map.
*/
public class PushdownMap<KeyType, ValueType> implements IMap<KeyType, ValueType> {
/* Our backing storage. */
private final IMap<KeyType, Stack<ValueType>> backing;
private boolean isFrozen = false;
private boolean thawEnabled = true;
/** Create a new empty stack-based map. */
public PushdownMap() {
backing = new FunctionalMap<>();
}
@Override
public void clear() {
if (isFrozen) throw new ObjectFrozen("Can't clear frozen map");
backing.clear();
}
@Override
public boolean containsKey(final KeyType key) {
return backing.containsKey(key);
}
@Override
public void forEach(final BiConsumer<KeyType, ValueType> action) {
backing.forEach((key, stk) -> action.accept(key, stk.top()));
}
@Override
public Optional<ValueType> get(final KeyType key) {
return backing.get(key).map((stack) -> stack.top());
}
@Override
public int size() {
return backing.size();
}
@Override
public IList<KeyType> keyList() {
return backing.keyList();
}
@Override
public ValueType put(final KeyType key, final ValueType val) {
if (isFrozen) throw new ObjectFrozen("Can't insert key " + key + " into frozen map");
if (backing.containsKey(key)) {
final Stack<ValueType> stk = backing.get(key).get();
final ValueType vl = stk.top();
stk.push(val);
return vl;
}
final Stack<ValueType> stk = new SimpleStack<>();
stk.push(val);
return null;
}
@Override
public ValueType remove(final KeyType key) {
if (isFrozen) throw new ObjectFrozen("Can't remove key " + key + " from frozen map");
IHolder<ValueType> result = IHolder.of(null);
backing.get(key).ifPresent((stk) -> {
if (stk.size() > 1) {
result.replace(stk.pop());
} else {
result.replace(backing.remove(key).top());
}
});
return result.getValue();
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + (backing == null ? 0 : backing.hashCode());
return result;
}
@Override
public boolean equals(final Object obj) {
if (this == obj) return true;
if (obj == null) return false;
if (!(obj instanceof PushdownMap<?, ?>)) return false;
final PushdownMap<?, ?> other = (PushdownMap<?, ?>) obj;
if (backing == null) {
if (other.backing != null) return false;
} else if (!backing.equals(other.backing)) {
return false;
}
return true;
}
@Override
public String toString() {
return String.format("PushdownMap [backing=%s]", backing);
}
@Override
public boolean freeze() {
isFrozen = true;
return true;
}
@Override
public boolean thaw() {
if (thawEnabled) {
isFrozen = false;
return true;
} else {
return false;
}
}
@Override
public boolean deepFreeze() {
thawEnabled = true;
return freeze();
}
@Override
public boolean canFreeze() {
return true;
}
@Override
public boolean canThaw() {
return thawEnabled;
}
@Override
public boolean isFrozen() {
return isFrozen;
}
}
|
