make Result.usedByNonDoomedNode() more efficient

darcs-hash:20070226031816-5007d-707b2ef2091a7fc7cefaee5ebd132d8c5a06dd0c.gz

diff --git a/src/edu/berkeley/sbp/Result.java b/src/edu/berkeley/sbp/Result.java
index 6fc1ad2..10a9b94 100644 (file)
--- a/src/edu/berkeley/sbp/Result.java
+++ b/src/edu/berkeley/sbp/Result.java
@@ -17,21 +17,23 @@ final class Result implements GraphViz.ToGraphViz {
     private Position reduction;
     private HashSet<Node> children = new HashSet<Node>();
     private boolean destroyed = false;
+    private int usedByNonDoomedNode = 0;
 
     public Position reduction() { return reduction; }
     public GSS.Phase phase() { return phase; }
     public Forest getForest() { return f; }
     public Node parent() { return parent; }
-    public void addChild(Node child) { children.add(child); }
-    public void removeChild(Node child) { children.remove(child); }
+    public void addChild(Node child) {
+        children.add(child);
+        usedByNonDoomedNode += child.state().doomed ? 0 : 1;
+    }
+    public void removeChild(Node child) {
+        children.remove(child);
+        usedByNonDoomedNode -= child.state().doomed ? 0 : 1;
+    }
 
     public boolean usedByAnyNode() { return children.size() > 0; }
-    public boolean usedByNonDoomedNode() {
-        for(Node n : children)
-            if (!n.state().doomed)
-                return true;
-        return false;
-    }
+    public boolean usedByNonDoomedNode() { return usedByNonDoomedNode > 0; }
 
     public String toString() { return super.toString()+"->"+parent(); }