1 // Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
3 package edu.berkeley.sbp.util;
6 public /*final*/ class FastSet<T> implements Iterator<T>, Iterable<T>, Visitable<T> {
8 public static final int INITIAL_SIZE = 8;
10 private Object[] array = null;
11 private T only = null;
15 public Iterator<T> iterator() { i=0; return this; }
16 public void remove() { throw new Error(); }
17 public boolean hasNext() { return only==null ? i<size : i<1; }
18 public T next() { return only==null ? (T)array[i++] : (i++)==0 ? only : null; }
20 if (i==0 && only!=null) return only;
21 if (array==null) return null;
26 public FastSet(T t) { only = t; }
27 public FastSet(Set<T> s) {
28 if (s.size()==1) { only = s.iterator().next(); return; }
29 array = new Object[s.size()];
30 for(T t : s) array[size++] = t;
33 public <B,C> void visit(Invokable<T,B,C> ivbc, B b, C c) {
34 if (only!=null) ivbc.invoke(only, b, c);
35 else for(int j=0; j<size; j++)
36 ivbc.invoke((T)array[j], b, c);
39 public int size() { return only==null ? size : 1; }
41 Object[] array2 = array==null ? new Object[INITIAL_SIZE] : new Object[array.length * 2];
42 if (array != null) System.arraycopy(array, 0, array2, 0, array.length);
49 public void add(T t, boolean check) {
50 //if (check) for(Object o : this) if (o.equals(t)) return;
54 for(int i=0; i<size; i++)
55 if (array[i]==t) return;
59 public void add(T t) {
61 if (only!=null) { only = t; return; }
63 } else if (size>=array.length-1) {
69 public boolean contains(T t) {
70 if (t==only) return true;
71 if (array==null) return false;
72 for(Object o : array) if (o==t) return true;