-
Notifications
You must be signed in to change notification settings - Fork 1
/
AtlasMap.java
291 lines (257 loc) · 6.33 KB
/
AtlasMap.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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
package com.github.sanctum.labyrinth.data;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Objects;
import java.util.Set;
import java.util.function.BiConsumer;
import java.util.function.BiFunction;
import java.util.function.Function;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
public class AtlasMap implements Atlas {
protected final Map<String, Object> SOURCE = new HashMap<>();
protected final Map<String, MemorySpace> QUERY = new HashMap<>();
protected final char divider;
public AtlasMap(char divider) {
this.divider = divider;
}
public AtlasMap() {
this.divider = '.';
}
String dividerAdapt() {
return divider == '.' ? "[" + divider + "]" : divider + "";
}
@Override
public boolean isNode(String key) {
String[] a = key.split(dividerAdapt());
String k = a[Math.max(0, a.length - 1)];
Map<String, Object> o = SOURCE;
for (int i = 0; i < a.length - 1; i++) {
String pathKey = a[i];
Object obj = o.get(pathKey);
if (obj instanceof Map) {
Map<String, Object> js = (Map<String, Object>) obj;
if (js.containsKey(k)) {
return js.get(k) instanceof Map;
} else {
o = js;
}
}
}
return o.get(k) instanceof Map;
}
@Override
public Node getNode(String key) {
return (Node) QUERY.entrySet().stream().filter(e -> e.getKey().equals(key)).map(Entry::getValue).findFirst().orElseGet(() -> {
AtlasNode n = new AtlasNode(key, this);
QUERY.put(key, n);
return n;
});
}
@Override
public Set<String> getKeys(boolean deep) {
Set<String> keys = new HashSet<>();
SOURCE.forEach((key, value) -> {
if (deep) {
if (value instanceof Map) {
keys.addAll(MapDecompressionUtils.getInstance().decompress(((Map<String, Object>) value).entrySet(), divider, null).toSet());
} else {
keys.add(key);
}
} else {
keys.add(key);
}
});
return keys;
}
@Override
public Map<String, Object> getValues(boolean deep) {
Map<String, Object> map = new HashMap<>();
SOURCE.forEach((key, value) -> {
if (deep) {
if (value instanceof Map) {
map.putAll(MapDecompressionUtils.getInstance().decompress(((Map<String, Object>) value).entrySet(), divider, null).toMap());
} else {
map.put(key, value);
}
} else {
map.put(key, value);
}
});
return map;
}
@Override
public int size() {
return getValues(true).size();
}
@Override
public boolean isEmpty() {
return SOURCE.isEmpty();
}
@Override
public boolean containsKey(Object key) {
return get(key) != null;
}
@Override
public boolean containsValue(Object value) {
return false;
}
@Override
public Object get(Object key) {
String ke = (String) key;
String[] a = ke.split(dividerAdapt());
String k = a[Math.max(0, a.length - 1)];
Map<String, Object> o = SOURCE;
for (int i = 0; i < a.length - 1; i++) {
String pathKey = a[i];
Object obj = o.get(pathKey);
if (obj instanceof Map) {
Map<String, Object> js = (Map<String, Object>) obj;
if (js.containsKey(k)) {
return js.get(k);
} else {
o = js;
}
} else {
return obj;
}
}
return o.get(k);
}
@Nullable
@Override
public Object put(String key, Object o) {
String[] a = key.split(dividerAdapt());
String k = a[Math.max(0, a.length - 1)];
Map<String, Object> ob = SOURCE;
for (int i = 0; i < a.length - 1; i++) {
String pathKey = a[i];
Object os = ob.get(pathKey);
if (os instanceof Map) {
ob = (Map<String, Object>) os;
} else {
Map<String, Object> n = new HashMap<>();
ob.put(pathKey, n);
ob = (Map<String, Object>) ob.get(pathKey);
}
}
if (o == null) {
ob.remove(k);
QUERY.remove(k);
return null;
}
ob.put(k, o);
return o;
}
@Override
public Object remove(Object key) {
return put((String) key, null);
}
@Override
public void putAll(@NotNull Map<? extends String, ?> m) {
SOURCE.putAll(m);
}
@Override
public void clear() {
SOURCE.clear();
}
@NotNull
@Override
public Set<String> keySet() {
return getKeys(true);
}
@NotNull
@Override
public Collection<Object> values() {
return getValues(true).values();
}
@NotNull
@Override
public Set<Entry<String, Object>> entrySet() {
return getValues(true).entrySet();
}
@Override
public Object getOrDefault(Object key, Object defaultValue) {
Object o = get(key);
if (o == null) {
return defaultValue;
}
return o;
}
@Override
public void forEach(BiConsumer<? super String, ? super Object> action) {
getValues(true).forEach(action);
}
@Override
public void replaceAll(BiFunction<? super String, ? super Object, ?> function) {
getValues(true).replaceAll(function);
}
@Nullable
@Override
public Object putIfAbsent(String key, Object value) {
Object o = get(key);
if (o == null) {
return put(key, value);
}
return o;
}
@Override
public boolean remove(Object key, Object value) {
Object o = get(key);
if (o == null) return false;
if (Objects.equals(o, value)) {
put((String) key, null);
return true;
}
return false;
}
@Override
public boolean replace(String key, Object oldValue, Object newValue) {
Object o = get(key);
if (o == null) return false;
if (Objects.equals(o, oldValue)) {
put(key, newValue);
return true;
}
return false;
}
@Nullable
@Override
public Object replace(String key, Object value) {
Object o = get(key);
if (o == null) return null;
put(key, value);
return value;
}
@Override
public Object computeIfAbsent(String key, @NotNull Function<? super String, ?> mappingFunction) {
Object t = get(key);
if (t == null) {
return put(key, mappingFunction.apply(key));
}
return t;
}
@Override
public Object computeIfPresent(String key, @NotNull BiFunction<? super String, ? super Object, ?> remappingFunction) {
Object t = get(key);
if (t != null) {
return put(key, remappingFunction.apply(key, t));
}
return null;
}
@Override
public Object compute(String key, @NotNull BiFunction<? super String, ? super Object, ?> remappingFunction) {
Object t = get(key);
return put(key, remappingFunction.apply(key, t));
}
@Override
public Object merge(String key, @NotNull Object value, @NotNull BiFunction<? super Object, ? super Object, ?> remappingFunction) {
return SOURCE.merge(key, value, remappingFunction);
}
@Override
public char getDivider() {
return divider;
}
}