-// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+// Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
package edu.berkeley.sbp;
-import edu.berkeley.sbp.*;
import edu.berkeley.sbp.util.*;
-import edu.berkeley.sbp.Parser.Table.*;
-import edu.berkeley.sbp.Sequence.Position;
-import java.io.*;
+import edu.berkeley.sbp.Sequence.Pos;
+import edu.berkeley.sbp.Sequence.Pos;
import java.util.*;
-import java.lang.reflect.*;
-class Result implements GraphViz.ToGraphViz {
+final class Result implements GraphViz.ToGraphViz {
- private Forest f;
- private Node parent;
- private GSS.Phase phase;
- private Position reduction;
- private HashSet<Node> children = new HashSet<Node>();
+ private Forest.Many f = new Forest.Many();
+ //private HashSet<Node> predecessors = new HashSet<Node>();
+ //private HashSet<Node> successors = new HashSet<Node>();
+ private FastSet<Node> predecessors = new FastSet<Node>();
+ private FastSet<Node> successors = new FastSet<Node>();
private boolean destroyed = false;
+ private boolean primordeal;
+ private int usedByNonDoomedNode = 0;
+ private Pos reduction;
+ private GSS.Phase predPhase;
- 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 boolean predecessorsContains(Node 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 boolean usedByAnyNode() { return children.size() > 0; }
- public boolean usedByNonDoomedNode() {
- for(Node n : children)
- if (!n.state().doomed)
- return true;
- return false;
+ public GSS.Phase phase() { return predPhase; }
+ public Forest getForest() { return f; }
+ public Iterable<Node> getPreds() { return predecessors; }
+ public void addSucc(Node succ) {
+ if (successors.contains(succ)) return;
+ successors.add(succ);
+ usedByNonDoomedNode += succ.state().doomed ? 0 : 1;
+ if (predecessors.size() > 1) throw new Error();
+ }
+ public void removeSucc(Node succ) {
+ if (!successors.contains(succ)) return;
+ successors.remove(succ);
+ usedByNonDoomedNode -= succ.state().doomed ? 0 : 1;
+ check();
}
- public String toString() { return super.toString()+"->"+parent(); }
+ public boolean usedByAnyNode() { return successors.size() > 0; }
+ public boolean usedByNonDoomedNode() { return usedByNonDoomedNode > 0; }
+
+ 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;
- if (parent() != null) {
- parent().removeChild(this);
- parent().check();
- }
- OUTER: while(true) {
- for(Node n : children) {
- children.remove(n);
- n.removeResult(this);
- n.check();
- continue OUTER;
+ while(predecessors.size() > 0)
+ for(Node pred : predecessors) {
+ removePred(pred);
+ pred.removeSucc(this);
+ break;
+ }
+ predecessors = null;
+ while(successors.size() > 0)
+ for(Node succ : successors) {
+ removeSucc(succ);
+ succ.removeResult(this);
+ break;
}
- break;
- }
+ successors = null;
+ }
+
+ public void removePred(Node pred) {
+ if (!predecessors.contains(pred)) return;
+ predecessors.remove(pred);
+ check();
}
- public Result(Forest f, Node parent, Position reduction) {
- this.f = f;
+ public void addPred(Node 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, Pos reduction, Node pred) {
+ this.f.merge(f);
this.reduction = reduction;
- this.parent = parent;
- if (parent != null) parent.addChild(this);
- if (parent != null) phase = parent.phase();
+ if (pred != null) addPred(pred);
}
// GraphViz //////////////////////////////////////////////////////////////////////////////
GraphViz.Node 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);