X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FForest.java;h=786ffad6ff14c4c0f18d596809cfe511772d2461;hb=d93afe731bf19f7dbf6be40f916672d9c200b947;hp=ec3da782bf7a8378c944092accb9ce59cb239262;hpb=ef9c08962db99929febe84197e9162e6867f942d;p=sbp.git

diff --git a/src/edu/berkeley/sbp/Forest.java b/src/edu/berkeley/sbp/Forest.java
index ec3da78..786ffad 100644
--- a/src/edu/berkeley/sbp/Forest.java
+++ b/src/edu/berkeley/sbp/Forest.java
@@ -7,7 +7,7 @@ import java.util.*;
 import java.lang.reflect.*;
 
 /** an efficient representation of a collection of trees (Tomita's shared packed parse forest) */
-public abstract class Forest<T> extends PrintableTree<Forest.Body<T>> implements Iterable<Forest.Body<T>> {
+public abstract class Forest<T> /*extends PrintableTree<Forest.MyBody<T>>*/ implements Visitable<Forest.Body<T>> {
 
     /** assume that this forest contains exactly one tree and return it; otherwise throw an exception */
     public final Tree<T> expand1() throws Ambiguous, ParseFailed {
@@ -17,25 +17,34 @@ public abstract class Forest<T> extends PrintableTree<Forest.Body<T>> implements
     }
 
     /** expand this forest into a set of trees */
-    //public abstract HashSet<Tree<T>>  expand(boolean toss);
-        public HashSet<Tree<T>> expand(boolean toss) {
-            HashSet<Tree<T>> ret = new HashSet<Tree<T>>();
-            for(Body<T> b : this)
-                ret.addAll(b.expand(toss, new ArrayList<Tree<T>>(), 0, new HashSet<Tree<T>>()));
-            if (toss && ret.size() > 1) throw new Ambiguous(this);
-            return ret;
-        }
+    public HashSet<Tree<T>> expand(boolean toss) {
+        TreeMaker<T> ret = new TreeMaker<T>();
+        visit(ret, new Boolean(toss), null);
+        if (toss && ret.size() > 1) throw new Ambiguous(this);
+        return ret;
+    }
 
     static        <T> Forest<T> singleton(Input.Location loc)                       { return create(loc, null, new Forest[] { }, false, true); }
     static        <T> Forest<T> singleton(Input.Location loc, Forest<T> body)       { return create(loc, null, new Forest[] { body },  false, true); }
     static        <T> Forest<T> leaf(Input.Location loc, T tag) { return create(loc, tag, null, false, false); }
     public static <T> Forest<T> create(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
-        return new MultiForest<T>(new Body<T>(loc, tag, tokens, unwrap, singleton));
+        return new MyBody<T>(loc, tag, tokens, unwrap, singleton);
     }
 
     // Body //////////////////////////////////////////////////////////////////////////////
 
-    protected static class Body<T> extends PrintableTree<Forest<T>> implements Iterable<Forest<T>> {
+    protected static interface Body<T> {
+        TreeMaker<T> expand(boolean toss, int i, TreeMaker<T> h);
+    }
+
+    protected static class MyBody<T> extends Forest<T> implements Body<T> /* extends PrintableTree<Forest<T>> implements *//*, Invokable<Tree<T>>*/ {
+
+        public <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c) {
+            ivbc.invoke(this, b, c);
+        }
+        public <B,C> void invoke(Tree<T> ivbc, B b, C c) {
+            //ivbc.invoke(this, b, c);
+        }
 
         private final Input.Location    location;
         private final T                 tag;
@@ -43,7 +52,7 @@ public abstract class Forest<T> extends PrintableTree<Forest.Body<T>> implements
         private final boolean           unwrap;
         private final boolean           singleton;
 
-        private Body(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
+        private MyBody(Input.Location loc, T tag, Forest<T>[] tokens, boolean unwrap, boolean singleton) {
             this.location = loc;
             this.tag = tag;
             this.tokens = tokens==null ? emptyForestArray : new Forest[tokens.length];
@@ -53,43 +62,37 @@ public abstract class Forest<T> extends PrintableTree<Forest.Body<T>> implements
             this.singleton = singleton;
         }
 
-        private HashSet<Tree<T>> expand(boolean toss, ArrayList<Tree<T>> toks, int i, HashSet<Tree<T>> h) {
+        public TreeMaker<T> expand(boolean toss, int i, TreeMaker<T> h) {
             if (singleton) {
-                for(Body<T> b : tokens[0]) b.expand(toss, toks, i, h);
+                tokens[0].visit(h, toss, i);
 
             } else if (i==tokens.length) {
-                h.add(new Tree<T>(null, tag, toks.toArray(tree_hint)));
+                h.add(new Tree<T>(null, tag, h.toks.toArray(tree_hint)));
 
             } else if (unwrap && i==tokens.length-1) {
                 if (tokens[i] != null)
-                    for(Body b : tokens[i])
-                        b.expand(toss, toks, 0, h);
+                    tokens[i].visit(h, toss, 0);
 
             } else {
                 boolean hit = false;
+                //tokens[i].visit(this, 
                 for(Tree<T> r : tokens[i].expand(toss)) {
                     hit = true;
-                    int old = toks.size();
-                    toks.add(r);
-                    expand(toss, toks, i+1, h);
-                    while(toks.size() > old) toks.remove(toks.size()-1);
+                    int old = h.toks.size();
+                    h.toks.add(r);
+                    expand(toss, i+1, h);
+                    while(h.toks.size() > old) h.toks.remove(h.toks.size()-1);
                 }
                 //if (!hit) throw new Error();
             }
             return h;
         }
 
-        void addTo(FastSet<Body<T>> h) {
-            /*if (!singleton)*/ h.add(this, true);
-            //else for(Body b : tokens[0]) b.addTo(h);
-        }
-
         protected String  headToString()         { return null; }
         protected String  headToJava()           { return null; }
         protected String  left()                 { return "{"; }
         protected String  right()                { return "}"; }
         protected boolean ignoreSingleton()      { return false; }
-        public    Iterator<Forest<T>> iterator() { return new ArrayIterator<Forest<T>>(tokens); }
     }
 
 
@@ -104,30 +107,26 @@ public abstract class Forest<T> extends PrintableTree<Forest.Body<T>> implements
         private FastSet<Forest<T>> hp = new FastSet<Forest<T>>();
         public Ref() { }
         public void merge(Forest p) { if (p!=this) hp.add(p, true); }
-        public Iterator<Body<T>> iterator() {
-            final Iterator<Forest<T>> ift = hp==null ? null : hp.iterator();
-            return new Iterator<Body<T>>() {
-                Iterator<Body<T>> ibt = ift==null ? null : ift.hasNext() ? ift.next().iterator() : null;
-                public void remove() { throw new RuntimeException("not supported"); }
-                public boolean hasNext() {
-                    if (ibt==null) return false;
-                    if (ibt.hasNext()) return true;
-                    ibt = ift.hasNext() ? ift.next().iterator() : null;
-                    return hasNext();
-                }
-                public Body<T> next() {
-                    return ibt.next();
-                }
-            };
-
+        public <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c) {
+            if (hp==null) return;
+            for(Forest<T> f : hp) f.visit(ivbc, b, c);
         }
         public Forest resolve() { return this; }
     }
 
-    private static class MultiForest<T> extends Forest<T> {
-        private final FastSet<Body<T>> results = new FastSet<Body<T>>();
-        public MultiForest(Body<T> b) { results.add(b); }
-        public Iterator<Body<T>> iterator() { return results.iterator(); }
+    public abstract <B,C> void visit(Invokable<Forest.Body<T>,B,C> ivbc, B b, C c);
+    private static class TreeMaker<T> extends HashSet<Tree<T>> implements Invokable<Forest.Body<T>,Boolean,Integer> {
+        public ArrayList<Tree<T>> toks = new ArrayList<Tree<T>>();
+        public void invoke(Forest.Body<T> bod, Boolean toss, Integer i) {
+            if (i==null) {
+                ArrayList<Tree<T>> toks = this.toks;
+                this.toks = new ArrayList<Tree<T>>();
+                bod.expand(toss, 0, this);
+                this.toks = toks;
+            } else {
+                bod.expand(toss, i, this);
+            }
+        }
     }
 
     // Statics //////////////////////////////////////////////////////////////////////////////