{{ message }}
-
-
Notifications
You must be signed in to change notification settings - Fork 1.5k
Expand file tree
/
Copy pathStringDict.java
More file actions
613 lines (494 loc) · 13.4 KB
/
Copy pathStringDict.java
File metadata and controls
613 lines (494 loc) · 13.4 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
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
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
package processing.data;
import java.io.*;
import java.util.HashMap;
import java.util.Iterator;
import java.util.NoSuchElementException;
import processing.core.PApplet;
/**
* A simple table class to use a String as a lookup for another String value.
*
* @webref data:composite
* @see IntDict
* @see FloatDict
*/
public class StringDict {
/** Number of elements in the table */
protected int count;
protected String[] keys;
protected String[] values;
/** Internal implementation for faster lookups */
private HashMap<String, Integer> indices = new HashMap<>();
public StringDict() {
count = 0;
keys = new String[10];
values = new String[10];
}
/**
* Create a new lookup pre-allocated to a specific length. This will not
* change the size(), but is more efficient than not specifying a length.
* Use it when you know the rough size of the thing you're creating.
*
* @nowebref
*/
public StringDict(int length) {
count = 0;
keys = new String[length];
values = new String[length];
}
/**
* Read a set of entries from a Reader that has each key/value pair on
* a single line, separated by a tab.
*
* @nowebref
*/
public StringDict(BufferedReader reader) {
String[] lines = PApplet.loadStrings(reader);
keys = new String[lines.length];
values = new String[lines.length];
for (int i = 0; i < lines.length; i++) {
String[] pieces = PApplet.split(lines[i], '\t');
if (pieces.length == 2) {
keys[count] = pieces[0];
values[count] = pieces[1];
indices.put(keys[count], count);
count++;
}
}
}
/**
* @nowebref
*/
public StringDict(String[] keys, String[] values) {
if (keys.length != values.length) {
throw new IllegalArgumentException("key and value arrays must be the same length");
}
this.keys = keys;
this.values = values;
count = keys.length;
for (int i = 0; i < count; i++) {
indices.put(keys[i], i);
}
}
/**
* Constructor to allow (more intuitive) inline initialization, e.g.:
* <pre>
* new StringDict(new String[][] {
* { "key1", "value1" },
* { "key2", "value2" }
* });
* </pre>
* It's no Python, but beats a static { } block with HashMap.put() statements.
*/
public StringDict(String[][] pairs) {
count = pairs.length;
this.keys = new String[count];
this.values = new String[count];
for (int i = 0; i < count; i++) {
keys[i] = pairs[i][0];
values[i] = pairs[i][1];
indices.put(keys[i], i);
}
}
/**
* Create a dictionary that maps between column titles and cell entries
* in a TableRow. If two columns have the same name, the later column's
* values will override the earlier values.
*/
public StringDict(TableRow row) {
this(row.getColumnCount());
String[] titles = row.getColumnTitles();
if (titles == null) {
titles = new StringList(IntList.fromRange(row.getColumnCount())).array();
}
for (int col = 0; col < row.getColumnCount(); col++) {
set(titles[col], row.getString(col));
}
// remove unused and overwritten entries
crop();
}
/**
* @webref stringdict:method
* @brief Returns the number of key/value pairs
*/
public int size() {
return count;
}
/**
* Resize the internal data, this can only be used to shrink the list.
* Helpful for situations like sorting and then grabbing the top 50 entries.
*/
public void resize(int length) {
if (length > count) {
throw new IllegalArgumentException("resize() can only be used to shrink the dictionary");
}
if (length < 1) {
throw new IllegalArgumentException("resize(" + length + ") is too small, use 1 or higher");
}
String[] newKeys = new String[length];
String[] newValues = new String[length];
PApplet.arrayCopy(keys, newKeys, length);
PApplet.arrayCopy(values, newValues, length);
keys = newKeys;
values = newValues;
count = length;
resetIndices();
}
/**
* Remove all entries.
*
* @webref stringdict:method
* @brief Remove all entries
*/
public void clear() {
count = 0;
indices = new HashMap<>();
}
private void resetIndices() {
indices = new HashMap<>(count);
for (int i = 0; i < count; i++) {
indices.put(keys[i], i);
}
}
// . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
public class Entry {
public String key;
public String value;
Entry(String key, String value) {
this.key = key;
this.value = value;
}
}
public Iterable<Entry> entries() {
return new Iterable<Entry>() {
public Iterator<Entry> iterator() {
return entryIterator();
}
};
}
public Iterator<Entry> entryIterator() {
return new Iterator<Entry>() {
int index = -1;
public void remove() {
removeIndex(index);
index--;
}
public Entry next() {
++index;
Entry e = new Entry(keys[index], values[index]);
return e;
}
public boolean hasNext() {
return index+1 < size();
}
};
}
// . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
public String key(int index) {
return keys[index];
}
protected void crop() {
if (count != keys.length) {
keys = PApplet.subset(keys, 0, count);
values = PApplet.subset(values, 0, count);
}
}
public Iterable<String> keys() {
return new Iterable<String>() {
@Override
public Iterator<String> iterator() {
return keyIterator();
}
};
}
// Use this to iterate when you want to be able to remove elements along the way
public Iterator<String> keyIterator() {
return new Iterator<String>() {
int index = -1;
public void remove() {
removeIndex(index);
index--;
}
public String next() {
return key(++index);
}
public boolean hasNext() {
return index+1 < size();
}
};
}
/**
* Return a copy of the internal keys array. This array can be modified.
*
* @webref stringdict:method
* @brief Return a copy of the internal keys array
*/
public String[] keyArray() {
crop();
return keyArray(null);
}
public String[] keyArray(String[] outgoing) {
if (outgoing == null || outgoing.length != count) {
outgoing = new String[count];
}
System.arraycopy(keys, 0, outgoing, 0, count);
return outgoing;
}
public String value(int index) {
return values[index];
}
/**
* @webref stringdict:method
* @brief Return the internal array being used to store the values
*/
public Iterable<String> values() {
return new Iterable<String>() {
@Override
public Iterator<String> iterator() {
return valueIterator();
}
};
}
public Iterator<String> valueIterator() {
return new Iterator<String>() {
int index = -1;
public void remove() {
removeIndex(index);
index--;
}
public String next() {
return value(++index);
}
public boolean hasNext() {
return index+1 < size();
}
};
}
/**
* Create a new array and copy each of the values into it.
*
* @webref stringdict:method
* @brief Create a new array and copy each of the values into it
*/
public String[] valueArray() {
crop();
return valueArray(null);
}
/**
* Fill an already-allocated array with the values (more efficient than
* creating a new array each time). If 'array' is null, or not the same
* size as the number of values, a new array will be allocated and returned.
*/
public String[] valueArray(String[] array) {
if (array == null || array.length != size()) {
array = new String[count];
}
System.arraycopy(values, 0, array, 0, count);
return array;
}
/**
* Return a value for the specified key.
*
* @webref stringdict:method
* @brief Return a value for the specified key
*/
public String get(String key) {
int index = index(key);
if (index == -1) return null;
return values[index];
}
public String get(String key, String alternate) {
int index = index(key);
if (index == -1) return alternate;
return values[index];
}
/**
* @webref stringdict:method
* @brief Create a new key/value pair or change the value of one
*/
public void set(String key, String value) {
int index = index(key);
if (index == -1) {
create(key, value);
} else {
values[index] = value;
}
}
public void setIndex(int index, String key, String value) {
if (index < 0 || index >= count) {
throw new ArrayIndexOutOfBoundsException(index);
}
keys[index] = key;
values[index] = value;
}
public int index(String what) {
Integer found = indices.get(what);
return (found == null) ? -1 : found.intValue();
}
/**
* @webref stringdict:method
* @brief Check if a key is a part of the data structure
*/
public boolean hasKey(String key) {
return index(key) != -1;
}
protected void create(String key, String value) {
if (count == keys.length) {
keys = PApplet.expand(keys);
values = PApplet.expand(values);
}
indices.put(key, Integer.valueOf(count));
keys[count] = key;
values[count] = value;
count++;
}
/**
* @webref stringdict:method
* @brief Remove a key/value pair
*/
public String remove(String key) {
int index = index(key);
if (index == -1) {
throw new NoSuchElementException("'" + key + "' not found");
}
String value = values[index];
removeIndex(index);
return value;
}
public String removeIndex(int index) {
if (index < 0 || index >= count) {
throw new ArrayIndexOutOfBoundsException(index);
}
String value = values[index];
indices.remove(keys[index]);
for (int i = index; i < count-1; i++) {
keys[i] = keys[i+1];
values[i] = values[i+1];
indices.put(keys[i], i);
}
count--;
keys[count] = null;
values[count] = null;
return value;
}
public void swap(int a, int b) {
String tkey = keys[a];
String tvalue = values[a];
keys[a] = keys[b];
values[a] = values[b];
keys[b] = tkey;
values[b] = tvalue;
// indices.put(keys[a], Integer.valueOf(a));
// indices.put(keys[b], Integer.valueOf(b));
}
/**
* Sort the keys alphabetically (ignoring case). Uses the value as a
* tie-breaker (only really possible with a key that has a case change).
*
* @webref stringdict:method
* @brief Sort the keys alphabetically
*/
public void sortKeys() {
sortImpl(true, false);
}
/**
* @webref stringdict:method
* @brief Sort the keys alphabetically in reverse
*/
public void sortKeysReverse() {
sortImpl(true, true);
}
/**
* Sort by values in descending order (largest value will be at [0]).
*
* @webref stringdict:method
* @brief Sort by values in ascending order
*/
public void sortValues() {
sortImpl(false, false);
}
/**
* @webref stringdict:method
* @brief Sort by values in descending order
*/
public void sortValuesReverse() {
sortImpl(false, true);
}
protected void sortImpl(final boolean useKeys, final boolean reverse) {
Sort s = new Sort() {
@Override
public int size() {
return count;
}
@Override
public int compare(int a, int b) {
int diff = 0;
if (useKeys) {
diff = keys[a].compareToIgnoreCase(keys[b]);
if (diff == 0) {
diff = values[a].compareToIgnoreCase(values[b]);
}
} else { // sort values
diff = values[a].compareToIgnoreCase(values[b]);
if (diff == 0) {
diff = keys[a].compareToIgnoreCase(keys[b]);
}
}
return reverse ? -diff : diff;
}
@Override
public void swap(int a, int b) {
StringDict.this.swap(a, b);
}
};
s.run();
// Set the indices after sort/swaps (performance fix 160411)
resetIndices();
}
/** Returns a duplicate copy of this object. */
public StringDict copy() {
StringDict outgoing = new StringDict(count);
System.arraycopy(keys, 0, outgoing.keys, 0, count);
System.arraycopy(values, 0, outgoing.values, 0, count);
for (int i = 0; i < count; i++) {
outgoing.indices.put(keys[i], i);
}
outgoing.count = count;
return outgoing;
}
public void print() {
for (int i = 0; i < size(); i++) {
System.out.println(keys[i] + " = " + values[i]);
}
}
/**
* Save tab-delimited entries to a file (TSV format, UTF-8 encoding)
*/
public void save(File file) {
PrintWriter writer = PApplet.createWriter(file);
write(writer);
writer.close();
}
/**
* Write tab-delimited entries to a PrintWriter
*/
public void write(PrintWriter writer) {
for (int i = 0; i < count; i++) {
writer.println(keys[i] + "\t" + values[i]);
}
writer.flush();
}
/**
* Return this dictionary as a String in JSON format.
*/
public String toJSON() {
StringList items = new StringList();
for (int i = 0; i < count; i++) {
items.append(JSONObject.quote(keys[i])+ ": " + JSONObject.quote(values[i]));
}
return "{ " + items.join(", ") + " }";
}
@Override
public String toString() {
return getClass().getSimpleName() + " size=" + size() + " " + toJSON();
}
}
You can’t perform that action at this time.