X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;h=a6cbd3a01a76b73af94ca6f8d10e51a9457c5ba3;hp=e9c9a45080bd2c8bacb13db05f160f53c91136bd;hb=0e17670bcfa7b0fe8eb3a2cac81f4b080a09fc98;hpb=5ae7d4fd7c53dab6df9aae2e42579efabf66f49e
diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java
index e9c9a45..a6cbd3a 100644
--- a/src/edu/berkeley/sbp/Tree.java
+++ b/src/edu/berkeley/sbp/Tree.java
@@ -6,53 +6,64 @@ import java.io.*;
import java.util.*;
import java.lang.reflect.*;
-/** a tree (or node in a tree); see jargon.txt for details */
+/** a tree (or node in a tree); see jargon.txt for details */
public class Tree
extends PrintableTree>
implements Iterable>,
GraphViz.ToGraphViz {
+ private final Input.Region location;
private final T head;
private final Tree[] children;
- private final Input.Region location;
private final boolean lift;
+ /** the element at the head of the tree */
public T head() { return head; }
private Tree lifted() { return children[children.length-1]; }
+ /** the number of children the tree has */
public int numChildren() {
- if (lift && children.length > 0)
- return (children.length-1)+lifted().numChildren();
- return children.length;
+ return lift
+ ? (children.length-1)+lifted().numChildren()
+ : children.length;
}
+
+ /** the tree's children */
public Iterable> children() { return this; }
+
+ /** the tree's children */
public Iterator> iterator() {
- if (lift)
- return new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1),
- children[children.length-1].iterator());
- return new ArrayIterator(children);
+ return lift
+ ? new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1),
+ children[children.length-1].iterator())
+ : new ArrayIterator(children);
}
- public Tree child(int i) {
- if (lift && i >= children.length-1)
- return children[children.length-1].child(i-(children.length-1));
- return children[i];
+
+ /** get the ith child */
+ public Tree child(int i) {
+ return lift && i >= children.length-1
+ ? children[children.length-1].child(i-(children.length-1))
+ : children[i];
}
+ /** get the input region that this tree was parsed from */
public Input.Region getRegion() { return location; }
- public Tree(Input.Region loc, T head) { this(loc, head, null); }
+ public Tree(Input.Region loc, T head) { this(loc, head, null); }
public Tree(Input.Region loc, T head, Tree[] children) { this(loc, head, children, false); }
- public Tree(Input.Region loc, T head, Tree[] children, boolean lift) {
+
+ /** package-private constructor, allows setting the "lift" bit */
+ Tree(Input.Region loc, T head, Tree[] children, boolean lift) {
this.location = loc;
this.head = head;
- this.lift = lift;
-
- Tree[] children2 = children==null ? new Tree[0] : new Tree[children.length];
- if (children != null) System.arraycopy(children, 0, children2, 0, children.length);
- this.children = children2;
+ this.lift = lift && children != null && children.length > 0;
+ this.children = ArrayUtil.clone(children, Tree.class);
}
+
+ // PrintableTree /////////////////////////////////////////////////////////////////////////////
+
protected String headToString() { return head()==null?null:head().toString(); }
protected String headToJava() {
// FIXME
@@ -68,97 +79,17 @@ public class Tree
protected String right() { return "}"; }
protected boolean ignoreSingleton() { return false; }
+
+ // ToGraphViz /////////////////////////////////////////////////////////////////////////////
+
public GraphViz.Node toGraphViz(GraphViz gv) {
if (gv.hasNode(this)) return gv.createNode(this);
GraphViz.Node n = gv.createNode(this);
n.label = head()==null ? "" : head().toString();
- //n.color = "red";
for(Tree t : this) n.edge(t, null);
return n;
}
public boolean isTransparent() { return false; }
public boolean isHidden() { return false; }
- public static interface TreeFunctor extends Functor>, R> {
- }
-
- public static class ArrayBuildingTreeFunctor implements TreeFunctor, ToJava {
-
- public void toJava(StringBuffer sb) { sb.append("new Tree.ArrayBuildingTreeFunctor()"); }
- public String toString() { return ""; }
-
- public T[] invoke(Iterable> t) {
- ArrayList ret = new ArrayList();
- for(Tree tc : t) {
- if (tc.head() != null && tc.head() instanceof Functor)
- ret.add(((Functor,Object>)tc.head()).invoke(tc.children()));
- else if (tc.numChildren() == 0)
- ret.add(tc.head());
- else {
- System.err.println("FIXME: don't know what to do about " + tc);
- ret.add(null);
- }
- }
- return (T[])ret.toArray(new Object[0]);
- }
- }
-
- public static class RawBindingFunctor implements TreeFunctor, ToJava {
- private Binding _binding;
- private String _toString;
- public RawBindingFunctor(String toString, Binding binding) {
- this._binding = binding;
- this._toString = toString;
- }
- public String toString() {
- return _toString;
- }
- public void toJava(StringBuffer sb) {
- sb.append("new Tree.RawBindingFunctor(");
- sb.append("\"");
- sb.append(StringUtil.toJavaString(_toString));
- sb.append("\", ");
- _binding.toJava(sb);
- sb.append(")");
- }
- public Object invoke(Iterable> t) {
- return _binding.invoke(new Object[] { t });
- }
- }
-
- public static class BindingFunctor implements TreeFunctor, ToJava {
- private Binding _binding;
- private String _toString;
- public String toString() {
- return _toString;
- }
- public BindingFunctor(String toString, Binding binding) {
- this._binding = binding;
- this._toString = toString;
- }
- public void toJava(StringBuffer sb) {
- sb.append("new Tree.BindingFunctor(");
- sb.append("\"");
- sb.append(StringUtil.toJavaString(_toString));
- sb.append("\", ");
- _binding.toJava(sb);
- sb.append(")");
- }
- public Object invoke(Iterable> t) {
- ArrayList ret = new ArrayList();
- for(Tree tc : t) {
- if (tc.head() != null && tc.head() instanceof Functor)
- ret.add(((Tree.TreeFunctor