X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2Futil%2FFastSet.java;h=88475e238b5163dce100ad973f74bcea85c94657;hb=16460a4ebf976fddbcb4dd79f1fa0b010d61602b;hp=1e6c6d5f9d3b762c41eb3198bc2f2ff994d59253;hpb=4eeae516c2ef96ca11d24f23fd5e80d12e7734a6;p=sbp.git

diff --git a/src/edu/berkeley/sbp/util/FastSet.java b/src/edu/berkeley/sbp/util/FastSet.java
index 1e6c6d5..88475e2 100644
--- a/src/edu/berkeley/sbp/util/FastSet.java
+++ b/src/edu/berkeley/sbp/util/FastSet.java
@@ -1,3 +1,5 @@
+// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+
 package edu.berkeley.sbp.util;
 import java.util.*;
 
@@ -28,10 +30,23 @@ public /*final*/ class FastSet<T> implements Iterator<T>, Iterable<T>, Visitable
         for(T t : s) array[size++] = t;
     }
 
-    public <B,C> void invoke(Invokable<T,B,C> ivbc, B b, C c) {
-        if (only!=null) ivbc.invoke(only, b, c);
+    public void remove(T t) {
+        if (only != null) {
+            if (only==t) only=null;
+            return;
+        }
+        boolean found = false;
+        for(int j=0; j<size; j++) {
+            if (array[j]==t) found = true;
+            if (found && j<size-1) array[j] = array[j+1];
+        }
+        if (found) size--;
+    }
+
+    public <B> void visit(Invokable<T,B> ivbc, B b) {
+        if (only!=null) ivbc.invoke(only, b);
         else for(int j=0; j<size; j++)
-            ivbc.invoke((T)array[j], b, c);
+            ivbc.invoke((T)array[j], b);
     }
 
     public int size() { return only==null ? size : 1; }