more refactoring into Node

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

diff --git a/src/edu/berkeley/sbp/Node.java b/src/edu/berkeley/sbp/Node.java
index 7a5c38d..1168c78 100644 (file)
--- a/src/edu/berkeley/sbp/Node.java
+++ b/src/edu/berkeley/sbp/Node.java
@@ -10,6 +10,51 @@ import java.io.*;
 import java.util.*;
 import java.lang.reflect.*;
 
-class Node {
+class Node<OtherNode extends Node>
+    implements IntegerMappable,
+               GraphViz.ToGraphViz,
+               Iterable<OtherNode> {
+
+    protected       FastSet<OtherNode> predecessors = new FastSet<OtherNode>();
+    protected       FastSet<OtherNode> successors = new FastSet<OtherNode>();
+    //private       HashSet<OtherNode> predecessors = new HashSet<OtherNode>();
+    //private       HashSet<OtherNode> successors = new HashSet<OtherNode>();
+
+    public Iterator<OtherNode> iterator() { return predecessors.iterator(); }
+
+    public boolean noSuccessors() { return successors.size()==0; }
+    public boolean predecessorsContains(OtherNode n) {
+        return predecessors.contains(n);
+    }
+
+    // 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);
+        n.label = "state["+state.toInt()+"]";
+        n.shape = "rectangle";
+        boolean haspreds = false;
+        for(ResultNode r : results) n.edge(r, "");
+        n.color = state.doomed ? "red" : "green";
+        ((GraphViz.Group)phase().toGraphViz(gv)).add(n);
+        */
+        return n;
+    }
+    public boolean isTransparent() { return false; }
+    public boolean isHidden() { return false; }
+
+    // IntegerMappable ////////////////////////////////////////////////////////////
+
+    private static int node_idx = 0;
+    private final int idx = node_idx++;
+    public int toInt() { return idx; }
 
 }
\ No newline at end of file