X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;h=c54fa6ad2a86e49f8e389f10231adf952c04f2a6;hb=79070b199f211628102a7667b04d25edaef1be32;hp=bffc35303e14658eeb4a83e7762b9576ce87d853;hpb=80a840adb5df31ba5edd20ecac23086ad09a5ca1;p=sbp.git diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java index bffc353..c54fa6a 100644 --- a/src/edu/berkeley/sbp/Tree.java +++ b/src/edu/berkeley/sbp/Tree.java @@ -14,35 +14,37 @@ public class Tree final T head; Tree[] children; - Object[] labels; - final Input.Location location; + final Input.Region location; public T head() { return head; } public int numChildren() { return children.length; } 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.Region getRegion() { return location; } - public Tree(Input.Location loc, T head) { this(loc, head, null); } - 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) { + public Tree(Input.Region loc, T head) { this(loc, head, null); } + public Tree(Input.Region loc, T head, Tree[] children) { 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() { + // FIXME + 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; } @@ -58,16 +60,19 @@ public class Tree public boolean isTransparent() { return false; } public boolean isHidden() { return false; } - public static interface TreeFunctor extends Functor>, R> { + public static interface TreeFunctor extends Functor, R> { } - public static class ArrayBuildingTreeFunctor implements TreeFunctor { + 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) { + + public T[] invoke(Tree 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())); + ret.add(((Functor,Object>)tc.head()).invoke(tc)); else if (tc.numChildren() == 0) ret.add(tc.head()); else { @@ -78,4 +83,5 @@ public class Tree return (T[])ret.toArray(new Object[0]); } } + }