From 76bc0ff98c5e67f4fe6fa2593bffdf31b6db437a Mon Sep 17 00:00:00 2001 From: adam Date: Sun, 22 Jan 2006 04:49:39 -0500 Subject: [PATCH] checkpoint darcs-hash:20060122094939-5007d-7af168cdc6983d8bd61b0fbb67d8b3c9ede03345.gz --- src/edu/berkeley/sbp/Forest.java | 24 ++++++++++-------------- 1 file changed, 10 insertions(+), 14 deletions(-) diff --git a/src/edu/berkeley/sbp/Forest.java b/src/edu/berkeley/sbp/Forest.java index 4de9fa8..5807545 100644 --- a/src/edu/berkeley/sbp/Forest.java +++ b/src/edu/berkeley/sbp/Forest.java @@ -62,7 +62,7 @@ public abstract class Forest /*extends PrintableTree>*/ impl this.singleton = singleton; } - public TreeMaker expand(int i, TreeMaker h) { + public TreeMaker expand(final int i, final TreeMaker h) { if (singleton) { tokens[0].visit(h, null, i); @@ -74,18 +74,14 @@ public abstract class Forest /*extends PrintableTree>*/ impl tokens[i].visit(h, null, 0); } else { - //boolean hit = false; - //tokens[i].visit(this, h, i); - - for(Tree r : tokens[i].expand(h.toss)) { - //hit = true; - int old = h.toks.size(); - h.toks.add(r); - expand(i+1, h); - while(h.toks.size() > old) h.toks.remove(h.toks.size()-1); - } - - //if (!hit) throw new Error(); + tokens[i].visit(new TreeMaker(h.toss) { + public void add(Tree r) { + int old = h.toks.size(); + h.toks.add(r); + expand(i+1, h); + while(h.toks.size() > old) h.toks.remove(h.toks.size()-1); + } + }, null, null); } return h; } @@ -126,7 +122,7 @@ public abstract class Forest /*extends PrintableTree>*/ impl } public abstract void visit(Invokable,B,C> ivbc, B b, C c); - private static abstract class TreeMaker /*extends HashSet>*/ implements Invokable,Boolean,Integer> { + private static abstract class TreeMaker implements Invokable,Boolean,Integer> { public ArrayList> toks = new ArrayList>(); private boolean toss; public TreeMaker(boolean toss) { this.toss = toss; } -- 1.7.10.4