X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2Futil%2FPrintableTree.java;h=f0947fb75088dee5198ad83f3f99c89f20106f83;hb=136bae5cb17061a7d1142450a67ee11a40ba7ef9;hp=c805caba69136d0140d4521b284688686d0c67c9;hpb=06d4d872050cac83ebd1a0abbf0e00d18ed3c44d;p=sbp.git

diff --git a/src/edu/berkeley/sbp/util/PrintableTree.java b/src/edu/berkeley/sbp/util/PrintableTree.java
index c805cab..f0947fb 100644
--- a/src/edu/berkeley/sbp/util/PrintableTree.java
+++ b/src/edu/berkeley/sbp/util/PrintableTree.java
@@ -9,68 +9,33 @@ public abstract class PrintableTree<T extends PrintableTree> implements Iterable
 
     protected abstract String headToString();
     protected abstract String headToJava();    
+    protected abstract int    numChildren();
 
-    private boolean empty() {
-        for(T t : this) return false;
-        return true;
-    }
-
-    private static final int MAXDEPTH=3;
-    public int depth() {
-        int depth = headToString()==null ? 0 : 1;
-        int ret = depth;
-        for(T t : this) ret = Math.max(ret, depth+t.depth());
-        return ret;
-    }
-    public String toString(int indent0, int cur, int limit) {
-        int indent = indent0;
-        String s = toString();
-        if (depth()<MAXDEPTH && s.length() < limit-cur) return s;
-        StringBuffer ret = new StringBuffer();
+    private static final int MAXCHARS=40;
 
-        if (cur>indent) {
-            ret.append('\n'); for(int i=0; i<indent; i++) ret.append(' ');
-            cur = indent;
-        }
-        
+    private boolean basic() { return toString().length() < MAXCHARS; }
+    public String toPrettyString() { return toPrettyString("\n"); }
+    private String toPrettyString(String nl) {
+        String str = toString();
+        if (str.length() < MAXCHARS) return str;
         String head = headToString();
-        if (head==null) {
-            ret.append("{");
-        } else {
-            ret.append(head);
-            if (empty()) return ret.toString();
-            ret.append(":");
-            indent += 2;
-            ret.append('\n'); for(int i=0; i<indent; i++) ret.append(' ');
-            cur = indent;
-        }
-
+        StringBuffer ret = new StringBuffer();
+        if (numChildren()==0) return head==null ? "{}" : head;
+        ret.append(head==null?"{ ":(head+":"+nl));
+        boolean first = true;
+        int len = 0;
         for(T t : this) {
-            s = t.toString(indent+2, cur, limit);
-            while(s.indexOf('\n') != -1) {
-                ret.append(s.substring(0, s.indexOf('\n')));
-                s = s.substring(s.indexOf('\n')+1);
-                if (s.length() > 0) ret.append("\n  ");
+            String s = t.basic() ? t.toString() : t.toPrettyString(nl+"  ");
+            if (!first) {
+                if (!t.basic())                ret.append(nl);
+                if (s.length()+len>MAXCHARS) { ret.append(nl); len = 0; }
+                else                         { ret.append(" "); len++; }
             }
+            first = false;
             ret.append(s);
-            if (s.indexOf('\n')!=-1)
-                cur = s.length()-s.lastIndexOf('\n');
-            else
-                cur += s.length();
-            if (cur>indent) {
-                ret.append(' ');
-                cur += s.length()+1;
-            }
-        }
-        if (head==null) {
-            ret.append("}");
-        } else if (cur>indent) {
-            /*
-            indent = indent0;
-            ret.append('\n'); for(int i=0; i<indent; i++) ret.append(' ');
-            cur = indent;
-            */
+            len += s.length();
         }
+        if (head==null) ret.append(" }");
         return ret.toString();
     }