rename Node->StateNode

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

diff --git a/src/edu/berkeley/sbp/Result.java b/src/edu/berkeley/sbp/Result.java
index de46cca..dfe12bb 100644 (file)
--- a/src/edu/berkeley/sbp/Result.java
+++ b/src/edu/berkeley/sbp/Result.java
@@ -2,71 +2,117 @@
 
 package edu.berkeley.sbp;
 import edu.berkeley.sbp.util.*;
-import edu.berkeley.sbp.Sequence.Position;
+import edu.berkeley.sbp.Sequence.Pos;
 import edu.berkeley.sbp.Sequence.Pos;
 import java.util.*;
 
-final class Result implements GraphViz.ToGraphViz {
+final class Result
+    implements GraphViz.ToGraphViz {
 
-    private Forest f;
-    private Node parent;
-    private HashSet<Node> children = new HashSet<Node>();
+    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);
+        /*
+        if (predecessors.contains(pred)) return;
+        addPred(pred);
+        if (fromEmptyReduction) return;
+        n.state().invokeReductions(n.phase().getToken(), n, this);        
+        */
+    }
+
+    public boolean noSuccessors() { return successors.size()==0; }
 
-    public GSS.Phase phase() { return parent==null ? null : parent.phase(); }
+    public GSS.Phase phase() { return predPhase; }
     public Forest getForest() { return f; }
-    public Node parent() { return parent; }
-    public void addChild(Node child) {
-        children.add(child);
-        usedByNonDoomedNode += child.state().doomed ? 0 : 1;
+    public Iterable<StateNode> getPreds() { return predecessors; }
+    public void addSucc(StateNode succ) {
+        if (successors.contains(succ)) return;
+        successors.add(succ);
+        usedByNonDoomedNode += succ.state().doomed ? 0 : 1;
+        if (predecessors.size() > 1) throw new Error();
     }
-    public void removeChild(Node child) {
-        if (!children.contains(child)) return;
-        children.remove(child);
-        usedByNonDoomedNode -= child.state().doomed ? 0 : 1;
+    public void removeSucc(StateNode succ) {
+        if (!successors.contains(succ)) return;
+        successors.remove(succ);
+        usedByNonDoomedNode -= succ.state().doomed ? 0 : 1;
         check();
     }
 
-    public boolean usedByAnyNode() { return children.size() > 0; }
+    public boolean usedByAnyNode() { return successors.size() > 0; }
     public boolean usedByNonDoomedNode() { return usedByNonDoomedNode > 0; }
 
-    public String toString() { return super.toString()+"->"+parent(); }
+    public String toString() { return super.toString()+"->"+predPhase; }
 
-    public void check() { if (children.size()==0) destroy(); }
+    public void check() {
+        if (successors.size()==0) destroy();
+        else if (predecessors.size()==0) destroy();
+    }
     public void destroy() {
         if (destroyed) return;
-        if (parent==null) return;  // never destroy the "primordeal" result
+        if (primordeal) return;  // never destroy the "primordeal" result
         destroyed = true;
-        parent.removeChild(this);
-        while(children.size() > 0)
-            for(Node n : children) {
-                removeChild(n);
-                n.removeResult(this);
+        while(predecessors.size() > 0)
+            for(StateNode pred : predecessors) {
+                removePred(pred);
+                pred.removeSucc(this);
                 break;
             }
+        predecessors = null;
+        while(successors.size() > 0)
+            for(StateNode succ : successors) {
+                removeSucc(succ);
+                succ.removeResult(this);
+                break;
+            }
+        successors = null;
+    }
+
+    public void removePred(StateNode pred) {
+        if (!predecessors.contains(pred)) return;
+        predecessors.remove(pred);
+        check();
     }
 
-    public Result(Forest f, Node parent, Pos reduction) {
-        this(f, parent, reduction, null);
+    public void addPred(StateNode pred) {
+        if (predPhase==null) predPhase = pred.phase();
+        if (predPhase != pred.phase()) throw new Error();
+        predecessors.add(pred);
+        pred.addSucc(this);
+        if (predecessors.size() > 1) throw new Error();
+    }
+        
+    public Result() {
+        this(null, null, null);
+        this.primordeal = true;
     }
-    public Result(Forest f, Node parent, Pos reduction, GSS.Phase target) {
-        this.f = f;
-        this.parent = parent;
-        if (parent != null) parent.addChild(this);
-        if (reduction == null) return;
-        Parser.Table.State state0 = (Parser.Table.State)parent.state().gotoSetNonTerminals.get(reduction);
-        target.newNodeFromReduction(this, state0, reduction);
+    public Result(Forest f, Pos reduction, StateNode pred) {
+        this.f.merge(f);
+        this.reduction = reduction;
+        if (pred != null) addPred(pred);
     }
 
     // GraphViz //////////////////////////////////////////////////////////////////////////////
 
-    public GraphViz.Node toGraphViz(GraphViz gv) {
+    public GraphViz.StateNode toGraphViz(GraphViz gv) {
         if (gv.hasNode(this)) return gv.createNode(this);
-        GraphViz.Node n = gv.createNode(this);
+        GraphViz.StateNode n = gv.createNode(this);
         n.label = ""+f;
         n.shape = "rectangle";
-        if (parent()!=null) n.edge(parent, "");
+        //if (pred()!=null) n.edge(pred, "");
         n.color = "blue";
         if (phase() != null)
             ((GraphViz.Group)phase().toGraphViz(gv)).add(n);