X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;h=38fcd32c8d2808afacd912a5b13f3b2c6d2ab924;hb=d87c46fcaa7a709fd42a296c4684b725f39a429e;hp=b8677669bd71709c84d29c4b4c28cd7b91eae2e5;hpb=0ab024f487647f99eb000345c29c2f8e9b52a200;p=sbp.git diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java index b867766..38fcd32 100644 --- a/src/edu/berkeley/sbp/Tree.java +++ b/src/edu/berkeley/sbp/Tree.java @@ -7,10 +7,14 @@ import java.util.*; import java.lang.reflect.*; /** a tree (or node in a tree); see jargon.txt for details */ -public class Tree extends PrintableTree> implements Iterable> { +public class Tree + extends PrintableTree> + implements Iterable>, + GraphViz.ToGraphViz { final T head; Tree[] children; + Object[] labels; final Input.Location location; public T head() { return head; } @@ -18,21 +22,71 @@ public class Tree extends PrintableTree> implements Iterable> public Iterable> children() { return new ArrayIterator(children); } public Iterator> iterator() { return new ArrayIterator(children); } public Tree child(int i) { return children[i]; } + public Object label(int i) { return labels[i]; } - public Input.Location getLocation() { return location; } + public Input.Location getLocation() { return location; } public Tree(Input.Location loc, T head) { this(loc, head, null); } - public Tree(Input.Location loc, T head, Tree[] children) { + public Tree(Input.Location loc, T head, Tree[] children) { this(loc, head, children, null); } + public Tree(Input.Location loc, T head, Tree[] children, Object[] labels) { this.location = loc; this.head = head; + 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; + + Object[] labels2 = labels==null ? new Object[0] : new Object[labels.length]; + if (labels != null) System.arraycopy(labels, 0, labels2, 0, labels.length); + this.labels = labels2; } protected String headToString() { return head==null?null:head.toString(); } - protected String headToJava() { return head==null?null:StringUtil.toJavaString(head+""); } + protected String headToJava() { + if (head==null) return null; + if (head instanceof ToJava) { + StringBuffer sb = new StringBuffer(); + ((ToJava)head).toJava(sb); + return sb.toString(); + } + return head==null?"null":("\""+StringUtil.toJavaString(head.toString())+"\""); + } protected String left() { return "{"; } protected String right() { return "}"; } protected boolean ignoreSingleton() { return false; } + + 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]); + } + } }