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 Visitable<Forest.Body<T>> {
-
- public abstract <B,C> void invoke(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>>();
- //addAll(bod.expand(toss, 0, new TreeMaker<T>()));
- bod.expand(toss, 0, this);
- this.toks = toks;
- } else {
- bod.expand(toss, i, this);
- }
- }
- }
+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 {
public Forest resolve() { return this; }
}
+ public abstract <B,C> void invoke(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 //////////////////////////////////////////////////////////////////////////////
package edu.berkeley.sbp.util;
import java.util.*;
-public /*final*/ class FastSet<T> implements Iterator<T>, Iterable<T> {
+public /*final*/ class FastSet<T> implements Iterator<T>, Iterable<T>, Visitable<T> {
public static final int INITIAL_SIZE = 8;
for(T t : s) array[size++] = t;
}
+ public <B,C> void invoke(Invokable<T,B,C> ivbc, B b, C c) {
+ if (only!=null) ivbc.invoke(only, b, c);
+ else for(int j=0; j<size; j++)
+ ivbc.invoke((T)array[j], b, c);
+ }
+
public int size() { return only==null ? size : 1; }
private void grow() {
Object[] array2 = array==null ? new Object[INITIAL_SIZE] : new Object[array.length * 2];