mirror of
https://github.com/processing/processing4.git
synced 2026-02-04 22:29:18 +01:00
560 lines
12 KiB
Java
560 lines
12 KiB
Java
package processing.data;
|
|
|
|
import java.io.*;
|
|
import java.util.HashMap;
|
|
import java.util.Iterator;
|
|
|
|
import processing.core.PApplet;
|
|
|
|
|
|
/**
|
|
* A simple table class to use a String as a lookup for an float value.
|
|
*/
|
|
public class FloatDict {
|
|
|
|
/** Number of elements in the table */
|
|
protected int count;
|
|
|
|
protected String[] keys;
|
|
protected float[] values;
|
|
|
|
/** Internal implementation for faster lookups */
|
|
private HashMap<String, Integer> indices = new HashMap<String, Integer>();
|
|
|
|
|
|
public FloatDict() {
|
|
count = 0;
|
|
keys = new String[10];
|
|
values = new float[10];
|
|
}
|
|
|
|
|
|
/**
|
|
* Create a new lookup with a specific size. This is more efficient than not
|
|
* specifying a size. Use it when you know the rough size of the thing you're creating.
|
|
*/
|
|
public FloatDict(int length) {
|
|
count = 0;
|
|
keys = new String[length];
|
|
values = new float[length];
|
|
}
|
|
|
|
|
|
/**
|
|
* Read a set of entries from a Reader that has each key/value pair on
|
|
* a single line, separated by a tab.
|
|
*/
|
|
public FloatDict(BufferedReader reader) {
|
|
// public FloatHash(PApplet parent, String filename) {
|
|
String[] lines = PApplet.loadStrings(reader);
|
|
keys = new String[lines.length];
|
|
values = new float[lines.length];
|
|
|
|
// boolean csv = (lines[0].indexOf('\t') == -1);
|
|
for (int i = 0; i < lines.length; i++) {
|
|
// String[] pieces = csv ? Table.splitLineCSV(lines[i]) : PApplet.split(lines[i], '\t');
|
|
String[] pieces = PApplet.split(lines[i], '\t');
|
|
if (pieces.length == 2) {
|
|
keys[count] = pieces[0];
|
|
values[count] = PApplet.parseFloat(pieces[1]);
|
|
count++;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
public FloatDict(String[] keys, float[] 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);
|
|
}
|
|
}
|
|
|
|
|
|
public int size() {
|
|
return count;
|
|
}
|
|
|
|
|
|
/** Remove all entries. */
|
|
public void clear() {
|
|
count = 0;
|
|
indices = new HashMap<String, Integer>();
|
|
}
|
|
|
|
|
|
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);
|
|
}
|
|
}
|
|
|
|
|
|
// /**
|
|
// * Return the internal array being used to store the keys. Allocated but
|
|
// * unused entries will be removed. This array should not be modified.
|
|
// */
|
|
// public String[] keys() {
|
|
// crop();
|
|
// return keys;
|
|
// }
|
|
|
|
|
|
public Iterable<String> keys() {
|
|
return new Iterable<String>() {
|
|
|
|
@Override
|
|
public Iterator<String> iterator() {
|
|
return new Iterator<String>() {
|
|
int index = -1;
|
|
|
|
public void remove() {
|
|
removeIndex(index);
|
|
}
|
|
|
|
public String next() {
|
|
return key(++index);
|
|
}
|
|
|
|
public boolean hasNext() {
|
|
return index+1 < size();
|
|
}
|
|
};
|
|
}
|
|
};
|
|
}
|
|
|
|
|
|
/*
|
|
static class KeyIterator implements Iterator<String> {
|
|
FloatHash parent;
|
|
int index;
|
|
|
|
public KeyIterator(FloatHash parent) {
|
|
this.parent = parent;
|
|
index = -1;
|
|
}
|
|
|
|
public void remove() {
|
|
parent.removeIndex(index);
|
|
}
|
|
|
|
public String next() {
|
|
return parent.key(++index);
|
|
}
|
|
|
|
public boolean hasNext() {
|
|
return index+1 < parent.size();
|
|
}
|
|
|
|
public void reset() {
|
|
index = -1;
|
|
}
|
|
}
|
|
*/
|
|
|
|
|
|
/**
|
|
* Return a copy of the internal keys array. This array can be modified.
|
|
*/
|
|
public String[] keyArray() {
|
|
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 float value(int index) {
|
|
return values[index];
|
|
}
|
|
|
|
|
|
// public float[] values() {
|
|
// crop();
|
|
// return values;
|
|
// }
|
|
|
|
|
|
public Iterable<Float> values() {
|
|
return new Iterable<Float>() {
|
|
|
|
@Override
|
|
public Iterator<Float> iterator() {
|
|
return new Iterator<Float>() {
|
|
int index = -1;
|
|
|
|
public void remove() {
|
|
removeIndex(index);
|
|
}
|
|
|
|
public Float next() {
|
|
return value(++index);
|
|
}
|
|
|
|
public boolean hasNext() {
|
|
return index+1 < size();
|
|
}
|
|
};
|
|
}
|
|
};
|
|
}
|
|
|
|
|
|
/**
|
|
* Create a new array and copy each of the values into it.
|
|
*/
|
|
public float[] valueArray() {
|
|
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 float[] valueArray(float[] array) {
|
|
if (array == null || array.length != size()) {
|
|
array = new float[count];
|
|
}
|
|
System.arraycopy(values, 0, array, 0, count);
|
|
return array;
|
|
}
|
|
|
|
|
|
/**
|
|
* Return a value for the specified key.
|
|
*/
|
|
public float get(String key) {
|
|
int index = index(key);
|
|
if (index == -1) return 0;
|
|
return values[index];
|
|
}
|
|
|
|
|
|
public void set(String key, int amount) {
|
|
int index = index(key);
|
|
if (index == -1) {
|
|
create(key, amount);
|
|
} else {
|
|
values[index] = amount;
|
|
}
|
|
}
|
|
|
|
|
|
public boolean hasKey(String key) {
|
|
return index(key) != -1;
|
|
}
|
|
|
|
|
|
// /** Increase the value of a specific key by 1. */
|
|
// public void inc(String key) {
|
|
// inc(key, 1);
|
|
//// int index = index(key);
|
|
//// if (index == -1) {
|
|
//// create(key, 1);
|
|
//// } else {
|
|
//// values[index]++;
|
|
//// }
|
|
// }
|
|
|
|
|
|
public void add(String key, float amount) {
|
|
int index = index(key);
|
|
if (index == -1) {
|
|
create(key, amount);
|
|
} else {
|
|
values[index] += amount;
|
|
}
|
|
}
|
|
|
|
|
|
// /** Decrease the value of a key by 1. */
|
|
// public void dec(String key) {
|
|
// inc(key, -1);
|
|
// }
|
|
|
|
|
|
public void sub(String key, float amount) {
|
|
add(key, -amount);
|
|
}
|
|
|
|
|
|
public void mul(String key, float amount) {
|
|
int index = index(key);
|
|
if (index != -1) {
|
|
values[index] *= amount;
|
|
}
|
|
}
|
|
|
|
|
|
public void div(String key, float amount) {
|
|
int index = index(key);
|
|
if (index != -1) {
|
|
values[index] /= amount;
|
|
}
|
|
}
|
|
|
|
|
|
public int index(String what) {
|
|
Integer found = indices.get(what);
|
|
return (found == null) ? -1 : found.intValue();
|
|
}
|
|
|
|
|
|
// public void add(String key) {
|
|
// if (index(key) != -1) {
|
|
// throw new IllegalArgumentException("Use inc() to increment an entry, " +
|
|
// "add() is for adding a new key");
|
|
// }
|
|
// add(key, 0);
|
|
// }
|
|
|
|
|
|
protected void create(String what, float much) {
|
|
if (count == keys.length) {
|
|
keys = PApplet.expand(keys);
|
|
values = PApplet.expand(values);
|
|
}
|
|
indices.put(what, new Integer(count));
|
|
keys[count] = what;
|
|
values[count] = much;
|
|
count++;
|
|
}
|
|
|
|
|
|
public void remove(String key) {
|
|
removeIndex(index(key));
|
|
}
|
|
|
|
|
|
public void removeIndex(int index) {
|
|
//System.out.println("index is " + which + " and " + keys[which]);
|
|
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] = 0;
|
|
}
|
|
|
|
|
|
protected void swap(int a, int b) {
|
|
String tkey = keys[a];
|
|
float tvalue = values[a];
|
|
keys[a] = keys[b];
|
|
values[a] = values[b];
|
|
keys[b] = tkey;
|
|
values[b] = tvalue;
|
|
|
|
indices.put(keys[a], new Integer(a));
|
|
indices.put(keys[b], new Integer(b));
|
|
}
|
|
|
|
|
|
// abstract class InternalSort extends Sort {
|
|
// @Override
|
|
// public int size() {
|
|
// return count;
|
|
// }
|
|
//
|
|
// @Override
|
|
// public void swap(int a, int b) {
|
|
// FloatHash.this.swap(a, 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).
|
|
*/
|
|
public void sortKeys() {
|
|
sortImpl(true, false);
|
|
// new InternalSort() {
|
|
// @Override
|
|
// public float compare(int a, int b) {
|
|
// int result = keys[a].compareToIgnoreCase(keys[b]);
|
|
// if (result != 0) {
|
|
// return result;
|
|
// }
|
|
// return values[b] - values[a];
|
|
// }
|
|
// }.run();
|
|
}
|
|
|
|
|
|
public void sortKeysReverse() {
|
|
sortImpl(true, true);
|
|
// new InternalSort() {
|
|
// @Override
|
|
// public float compare(int a, int b) {
|
|
// int result = keys[b].compareToIgnoreCase(keys[a]);
|
|
// if (result != 0) {
|
|
// return result;
|
|
// }
|
|
// return values[a] - values[b];
|
|
// }
|
|
// }.run();
|
|
}
|
|
|
|
|
|
/**
|
|
* Sort by values in descending order (largest value will be at [0]).
|
|
*/
|
|
public void sortValues() {
|
|
sortImpl(false, false);
|
|
// new InternalSort() {
|
|
// @Override
|
|
// public float compare(int a, int b) {
|
|
//
|
|
// }
|
|
// }.run();
|
|
}
|
|
|
|
|
|
public void sortValuesReverse() {
|
|
sortImpl(false, true);
|
|
// new InternalSort() {
|
|
// @Override
|
|
// public float compare(int a, int b) {
|
|
// float diff = values[b] - values[a];
|
|
// if (diff == 0 && keys[a] != null && keys[b] != null) {
|
|
// diff = keys[a].compareToIgnoreCase(keys[b]);
|
|
// }
|
|
// return descending ? diff : -diff;
|
|
// }
|
|
// }.run();
|
|
}
|
|
|
|
|
|
// // ascending puts the largest value at the end
|
|
// // descending puts the largest value at 0
|
|
// public void sortValues(final boolean descending, final boolean tiebreaker) {
|
|
// Sort s = new Sort() {
|
|
// @Override
|
|
// public int size() {
|
|
// return count;
|
|
// }
|
|
//
|
|
// @Override
|
|
// public float compare(int a, int b) {
|
|
// float diff = values[b] - values[a];
|
|
// if (tiebreaker) {
|
|
// if (diff == 0) {
|
|
// diff = keys[a].compareToIgnoreCase(keys[b]);
|
|
// }
|
|
// }
|
|
// return descending ? diff : -diff;
|
|
// }
|
|
//
|
|
// @Override
|
|
// public void swap(int a, int b) {
|
|
// FloatHash.this.swap(a, b);
|
|
// }
|
|
// };
|
|
// s.run();
|
|
// }
|
|
|
|
|
|
protected void sortImpl(final boolean useKeys, final boolean reverse) {
|
|
Sort s = new Sort() {
|
|
@Override
|
|
public int size() {
|
|
return count;
|
|
}
|
|
|
|
@Override
|
|
public float compare(int a, int b) {
|
|
float diff = 0;
|
|
if (useKeys) {
|
|
diff = keys[a].compareToIgnoreCase(keys[b]);
|
|
if (diff == 0) {
|
|
return values[a] - values[b];
|
|
}
|
|
} else { // sort values
|
|
diff = values[a] - values[b];
|
|
if (diff == 0) {
|
|
diff = keys[a].compareToIgnoreCase(keys[b]);
|
|
}
|
|
}
|
|
return reverse ? -diff : diff;
|
|
}
|
|
|
|
@Override
|
|
public void swap(int a, int b) {
|
|
FloatDict.this.swap(a, b);
|
|
}
|
|
};
|
|
s.run();
|
|
}
|
|
|
|
|
|
/** Returns a duplicate copy of this object. */
|
|
public FloatDict copy() {
|
|
FloatDict outgoing = new FloatDict(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);
|
|
}
|
|
return outgoing;
|
|
}
|
|
|
|
|
|
// /**
|
|
// * Write tab-delimited entries out to the console.
|
|
// */
|
|
// public void print() {
|
|
// write(new PrintWriter(System.out));
|
|
// }
|
|
|
|
|
|
/**
|
|
* Write tab-delimited entries out to
|
|
* @param writer
|
|
*/
|
|
public void write(PrintWriter writer) {
|
|
for (int i = 0; i < count; i++) {
|
|
writer.println(keys[i] + "\t" + values[i]);
|
|
}
|
|
writer.flush();
|
|
}
|
|
|
|
|
|
@Override
|
|
public String toString() {
|
|
StringBuilder sb = new StringBuilder();
|
|
sb.append(getClass().getSimpleName() + " size=" + size() + " { ");
|
|
for (int i = 0; i < size(); i++) {
|
|
if (i != 0) {
|
|
sb.append(", ");
|
|
}
|
|
sb.append("\"" + keys[i] + "\": " + values[i]);
|
|
}
|
|
sb.append(" }");
|
|
return sb.toString();
|
|
}
|
|
}
|