projects
/
sbp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
checkpoint
[sbp.git]
/
src
/
edu
/
berkeley
/
sbp
/
util
/
FastSet.java
diff --git
a/src/edu/berkeley/sbp/util/FastSet.java
b/src/edu/berkeley/sbp/util/FastSet.java
index
d3be774
..
e7ae063
100644
(file)
--- a/
src/edu/berkeley/sbp/util/FastSet.java
+++ b/
src/edu/berkeley/sbp/util/FastSet.java
@@
-1,11
+1,11
@@
package edu.berkeley.sbp.util;
import java.util.*;
package edu.berkeley.sbp.util;
import java.util.*;
-public /*final*/ class FastSet<T> implements Iterator<T>, Iterable<T> {
+public /*final*/ class FastSet<T> implements Iterator<T>, Iterable<T>, Visitable<T> {
- public static final int INITIAL_SIZE = 128;
+ public static final int INITIAL_SIZE = 8;
- private Object[] array;
+ private Object[] array = null;
private T only = null;
private int i = -1;
private int size = 0;
private T only = null;
private int i = -1;
private int size = 0;
@@
-28,6
+28,12
@@
public /*final*/ class FastSet<T> implements Iterator<T>, Iterable<T> {
for(T t : s) array[size++] = t;
}
for(T t : s) array[size++] = t;
}
+ public <B,C> void visit(Invokable<T,B,C> ivbc, B b, C c) {
+ if (only!=null) ivbc.invoke(only, b, c);
+ else for(int j=0; j<size; j++)
+ ivbc.invoke((T)array[j], b, c);
+ }
+
public int size() { return only==null ? size : 1; }
private void grow() {
Object[] array2 = array==null ? new Object[INITIAL_SIZE] : new Object[array.length * 2];
public int size() { return only==null ? size : 1; }
private void grow() {
Object[] array2 = array==null ? new Object[INITIAL_SIZE] : new Object[array.length * 2];
@@
-39,7
+45,13
@@
public /*final*/ class FastSet<T> implements Iterator<T>, Iterable<T> {
}
}
public void add(T t, boolean check) {
}
}
public void add(T t, boolean check) {
- if (check) for(Object o : this) if (o.equals(t)) return;
+ //if (check) for(Object o : this) if (o.equals(t)) return;
+ if (check) {
+ if (only==t) return;
+ if (array != null)
+ for(int i=0; i<size; i++)
+ if (array[i]==t) return;
+ }
add(t);
}
public void add(T t) {
add(t);
}
public void add(T t) {