+// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+
package edu.berkeley.sbp.util;
import edu.berkeley.sbp.*;
import edu.berkeley.sbp.util.*;
import java.util.*;
import java.lang.reflect.*;
-public abstract class PrintableTree<T extends PrintableTree> implements Iterable<T>, ToJava /*, ToHTML*/ {
+public abstract class PrintableTree<T extends PrintableTree> implements Iterable<T>, ToJava /*, ToHTML*/, GraphViz.ToGraphViz {
+ protected abstract Object head();
protected abstract String headToString();
protected abstract String headToJava();
protected abstract String left();
private boolean basic() { return toString().length() < MAXCHARS; }
public String toPrettyString() { return toPrettyString("\n"); }
- public StringBuffer toPrettyString(StringBuffer sb) { sb.append(this); return sb; }
+ public StringBuffer toPrettyString(StringBuffer sb) { sb.append(toPrettyString()); return sb; }
private String toPrettyString(String nl) {
String str = toString();
if (str.length() < MAXCHARS) return str;
public void toJava(StringBuffer sb) {
sb.append("new "+this.getClass().getName()+"(null, ");
String head = headToJava();
- sb.append(head==null ? "null" : "\"" + head + "\"");
+ sb.append(head);
sb.append(", new "+this.getClass().getName()+"[] { ");
boolean first = true;
for(T t : this) {
sb.append("})");
}
+ // this is here to keep it out of the javadoc for Tree<T>
+
+ 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();
+ for(T t : this) n.edge(t, null);
+ return n;
+ }
+ public boolean isTransparent() { return false; }
+ public boolean isHidden() { return false; }
}