X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FResultNode.java;h=e22bd45a41c07ea64b1f32e64c393481adec021e;hp=bce43c5db227f0dd7f6a64dfc43ffc9c3c5e94f8;hb=76ce41540f06ac1fbcb44332dd62f53e88c27cf1;hpb=e0642797cf50d33913d996056146bd5ca79ddbd8

diff --git a/src/edu/berkeley/sbp/ResultNode.java b/src/edu/berkeley/sbp/ResultNode.java
index bce43c5..e22bd45 100644
--- a/src/edu/berkeley/sbp/ResultNode.java
+++ b/src/edu/berkeley/sbp/ResultNode.java
@@ -10,19 +10,12 @@ final class ResultNode
     extends Node<StateNode> {
 
     private Forest.Many f = new Forest.Many();
-    //private HashSet<StateNode> predecessors = new HashSet<StateNode>();
-    //private HashSet<StateNode> successors = new HashSet<StateNode>();
-    private FastSet<StateNode> predecessors = new FastSet<StateNode>();
-    private FastSet<StateNode> successors = new FastSet<StateNode>();
     private boolean destroyed = false;
     private boolean primordeal;
     private int usedByNonDoomedNode = 0;
     private Pos reduction;
     private GSS.Phase predPhase;
 
-    public boolean predecessorsContains(StateNode n) {
-        return predecessors.contains(n);
-    }
     public Pos reduction() { return reduction; }
     public void merge(Forest newf) {
         this.f.merge(newf);
@@ -34,11 +27,8 @@ final class ResultNode
         */
     }
 
-    public boolean noSuccessors() { return successors.size()==0; }
-
     public GSS.Phase phase() { return predPhase; }
     public Forest getForest() { return f; }
-    public Iterable<StateNode> getPreds() { return predecessors; }
     public void addSucc(StateNode succ) {
         if (successors.contains(succ)) return;
         successors.add(succ);
@@ -75,7 +65,7 @@ final class ResultNode
         while(successors.size() > 0)
             for(StateNode succ : successors) {
                 removeSucc(succ);
-                succ.removeResult(this);
+                succ.removePred(this);
                 break;
             }
         successors = null;