this.tag = tag;
this.tokens = tokens==null ? emptyForestArray : new Forest[tokens.length];
if (tokens != null) System.arraycopy(tokens, 0, this.tokens, 0, tokens.length);
+ if (tokens != null) for(int i=0; i<tokens.length; i++) if (tokens[i]==null) throw new Error(i+"");
this.creator = creator;
this.unwrap = unwrap;
this.singleton = singleton;
private boolean kcache = false;
private boolean keep = false;
public boolean keep() {
+ return true;
+ /*
if (kcache) return keep;
kcache = true;
for(Forest<T> token : tokens) if (!token.valid()) return keep = false;
return keep = creator==null || (creator.needs.size()==0 && creator.hates.size()==0);
+ */
}
public boolean keep(Iterable<Body<T>> h) {
if (keep()) return true;
return needs <= -1 * creator.needs.size();
}
-
+ private boolean rep = false;
public String toString() {
- StringBuffer ret = new StringBuffer();
- for(int i=0; i<tokens.length; i++) {
- String q = tokens[i]==null ? "null" : tokens[i].toString();
- if (q.length() > 0) {
- ret.append(q);
- ret.append(" ");
+ if (rep) return "***";
+ try {
+ rep = true;
+ StringBuffer ret = new StringBuffer();
+ for(int i=0; i<tokens.length; i++) {
+ String q = tokens[i]==null ? "null" : tokens[i].toString();
+ if (q.length() > 0) {
+ ret.append(q);
+ ret.append(" ");
+ }
}
+ String tail = ret.toString().trim();
+ String head = (tag!=null && !tag.toString().equals("")) ? (tail.length() > 0 ? tag+":" : tag+"") : "";
+ if (tail.length() > 0) tail = "{" + tail + "}";
+ return head + tail;
+ } finally {
+ rep = false;
}
- String tail = ret.toString().trim();
- String head = (tag!=null && !tag.toString().equals("")) ? (tail.length() > 0 ? tag+":" : tag+"") : "";
- if (tail.length() > 0) tail = "{" + tail + "}";
- return head + tail;
}
}
public boolean valid = false;
public Ref() { }
public void merge(Forest p) {
+ //if (p==null) throw new Error("bad evil bad!");
if (res != null) throw new Error("already resolved!");
if (p==null) throw new Error();
- if (p!=this) hp.add(p);
+ if (p!=this) hp.add(p, true);
}
public Iterator<Body<T>> iterator() { return ((IterableForest<T>)resolve()).iterator(); }
public HashSet<Tree<T>> expand(boolean toss) { return resolve().expand(toss); }
- public boolean valid() { if (valid) return true; resolve(); return valid; }
+ public boolean valid() { return true; /*if (valid) return true; resolve(); return valid;*/ }
public String toString() { return resolve().toString(); }
public Forest resolve() {
if (hp==null) return res;
FastSet<Body> nh = new FastSet<Body>();
for(Forest<?> p : hp)
for(Body<?> b : (IterableForest<?>)p) {
- if (b.keep() && (b.creator==null || !b.creator.lame)) { valid = true; b.addTo(nh); }
- else results = new HashSet<Body>();
+ if (b.keep() && (b.creator==null || !b.creator.lame)) {
+ valid = true;
+ b.addTo(nh);
+ } else {
+ results = new HashSet<Body>();
+ }
}
if (results != null) {
for(Forest<?> p : hp)
}
}
hp = null;
- return res = new MultiForest(nh, valid);
+ res = new MultiForest(nh, valid);
+ return res;
}
}
private static class MultiForest<T> extends IterableForest<T> {
private final FastSet<Body<T>> results;
private boolean valid;
- public boolean valid() { return valid; }
+ public boolean valid() { /*return valid;*/ return true; }
private MultiForest(FastSet<Body<T>> results, boolean valid) { this.results = results; this.valid = valid; }
public MultiForest(Token.Location loc, T tag, Forest<T>[] tokens, Sequence creator, boolean unwrap, boolean singleton) {
this.results = new FastSet<Body<T>>(new Body(loc, tag, tokens, creator, unwrap, singleton));