/** a node in the GSS */
final class StateNode
extends Node<ResultNode>
- implements Invokable<Pos, ResultNode, Object>,
- Iterable<ResultNode> {
+ implements Invokable<Pos, ResultNode, Object> {
/** which GSS.Phase this StateNode belongs to */
public GSS.Phase phase() { return phase; }
private final GSS.Phase predPhase;
private final Parser.Table.State state;
private boolean fromEmptyReduction;
- private FastSet<ResultNode> predecessors = new FastSet<ResultNode>();
- private FastSet<ResultNode> successors = new FastSet<ResultNode>();
- //private HashSet<ResultNode> predecessors = new HashSet<ResultNode>();
- //private HashSet<ResultNode> successors = new HashSet<ResultNode>();
public final void invoke(Pos r, ResultNode only, Object o) {
boolean emptyProductions = only==null;
private void reduce(Pos r, int pos, GSS.Phase target, ResultNode only) {
for(ResultNode res : predecessors)
if (only == null || res == only)
- for(StateNode pred : res.getPreds())
+ for(StateNode pred : res)
reduce2(r, pos, target, pred, res.getForest());
}
successors.remove(succ);
check();
}
- public void removeResult(ResultNode result) {
+ public void removePred(ResultNode result) {
predecessors.remove(result);
check();
}
public void addSucc(ResultNode succ) {
successors.add(succ);
}
- public void addResult(Forest f, Pos reduction, StateNode pred) {
+ public void addPred(Forest f, Pos reduction, StateNode pred) {
for(ResultNode r : predecessors)
if (r.predecessorsContains(pred)) {
r.merge(f);