refactor predecessor/successor into Node class

[sbp.git] / src / edu / berkeley / sbp / ResultNode.java

diff --git a/src/edu/berkeley/sbp/ResultNode.java b/src/edu/berkeley/sbp/ResultNode.java
index 671940a..9b14882 100644 (file)
--- a/src/edu/berkeley/sbp/ResultNode.java
+++ b/src/edu/berkeley/sbp/ResultNode.java
@@ -7,13 +7,9 @@ import edu.berkeley.sbp.Sequence.Pos;
 import java.util.*;
 
 final class ResultNode
 import java.util.*;
 
 final class ResultNode

-    implements GraphViz.ToGraphViz {
+    extends Node<StateNode> {

 
     private Forest.Many f = new Forest.Many();
 
     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 boolean destroyed = false;
     private boolean primordeal;
     private int usedByNonDoomedNode = 0;

@@ -105,20 +101,5 @@ final class ResultNode
         if (pred != null) addPred(pred);
     }
 
         if (pred != null) addPred(pred);
     }
 

-    // GraphViz //////////////////////////////////////////////////////////////////////////////
-
-    public GraphViz.StateNode toGraphViz(GraphViz gv) {
-        if (gv.hasNode(this)) return gv.createNode(this);
-        GraphViz.StateNode n = gv.createNode(this);
-        n.label = ""+f;
-        n.shape = "rectangle";
-        //if (pred()!=null) n.edge(pred, "");
-        n.color = "blue";
-        if (phase() != null)
-            ((GraphViz.Group)phase().toGraphViz(gv)).add(n);
-        return n;
-    }
-    public boolean isTransparent() { return false; }
-    public boolean isHidden() { return false; }

 
 }
\ No newline at end of file
 
 }
\ No newline at end of file