StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
5273509
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-03-11T13:30:58.167
FavoriteCount
0
LastActivityDate
2011-03-11T13:30:58.167
LastEditDate
LastEditorUserId
0
OwnerUserId
280537
ParentId
4983504
PostTypeId
2
Score
3
ViewCount
0
LastEditorDisplayName
text
Body
There isn't a direct replacement for the setw and setfill methods in Java. However you can create a new object that wraps a PrintStream and adds the required padding when you write some output. For example: <pre><code>import java.io.PrintStream; import java.util.Arrays; public class PaddedWriter { private int width = 0; private char fillChar = ' '; private final PrintStream writer; public PaddedWriter(PrintStream writer) { this.writer = writer; } void setw(int i) { width = i; } void setfill(char c) { fillChar = c; } void write(String str) { write(str.toCharArray()); } void write(char[] buf) { if (buf.length < width) { char[] pad = new char[width - buf.length]; Arrays.fill( pad, fillChar ); writer.print(pad); } writer.print( buf ); setw(0); } void write() { char[] pad = new char[width]; Arrays.fill( pad, fillChar ); writer.print(pad); setw(0); } void endl() { writer.println(); setw(0); } } </code></pre> Using the PaddedWriter class it is possible to reimplement the code from <a href="http://www.ihas1337code.com/2010/09/how-to-pretty-print-binary-tree.html" rel="nofollow">http://www.ihas1337code.com/2010/09/how-to-pretty-print-binary-tree.html</a> as follows: <pre><code>import java.util.Deque; import java.util.Iterator; import java.util.LinkedList; public class BinaryTree<T> { final T data; BinaryTree<T> left; BinaryTree<T> right; public BinaryTree(T t) { data = t; } public void setLeft(BinaryTree<T> t) { left = t; } public void setRight(BinaryTree<T> t) { right = t; } public BinaryTree<T> getLeft() { return left; } public BinaryTree<T> getRight() { return right; } @Override public String toString() { if (data == null) { return "null"; } else { return data.toString(); } } // Search for the deepest part of the tree private static <T>int maxHeight(BinaryTree<T> t) { if (t == null) return 0; int leftHeight = maxHeight( t.getLeft() ); int rightHeight = maxHeight( t.getRight() ); return (leftHeight > rightHeight) ? leftHeight+1: rightHeight+1; } // Pretty formatting of a binary tree to the output stream public static <T>void printPretty(BinaryTree<T> tree, int level, int indentSpace, PaddedWriter out) { int h = maxHeight( tree ); int nodesInThisLevel = 1; int branchLen = 2*((int)Math.pow( 2.0, h )-1) - (3-level) *(int)Math.pow( 2.0, h-1 ); int nodeSpaceLen = 2+(level+1)*(int)Math.pow(2.0,h); int startLen = branchLen + (3-level) + indentSpace; Deque<BinaryTree<T>> nodesQueue = new LinkedList<BinaryTree<T>>(); nodesQueue.offerLast( tree ); for (int r = 1; r < h; r++) { printBranches( branchLen, nodeSpaceLen, startLen, nodesInThisLevel, nodesQueue, out ); branchLen = branchLen/2 - 1; nodeSpaceLen = nodeSpaceLen/2 + 1; startLen = branchLen + (3-level) + indentSpace; printNodes(branchLen, nodeSpaceLen, startLen, nodesInThisLevel, nodesQueue, out); for (int i = 0; i < nodesInThisLevel; i++) { BinaryTree<T> currNode = nodesQueue.pollFirst(); if (currNode!=null) { nodesQueue.offerLast( currNode.getLeft() ); nodesQueue.offerLast( currNode.getRight() ); } else { nodesQueue.offerLast( null ); nodesQueue.offerLast( null ); } } nodesInThisLevel *= 2; } printBranches(branchLen, nodeSpaceLen, startLen, nodesInThisLevel, nodesQueue, out); printLeaves(indentSpace, level, nodesInThisLevel, nodesQueue, out); } private static <T>void printBranches(int branchLen, int nodeSpaceLen, int startLen, int nodesInThisLevel, Deque<BinaryTree<T>> nodesQueue, PaddedWriter out) { Iterator<BinaryTree<T>> iterator = nodesQueue.iterator(); for (int i = 0; i < nodesInThisLevel/2; i++) { if (i == 0) { out.setw(startLen-1); } else { out.setw(nodeSpaceLen-2); } out.write(); BinaryTree<T> next = iterator.next(); if (next != null) { out.write( "/" ); } else { out.write(" "); } out.setw(2*branchLen+2); out.write(); next = iterator.next(); if (next != null) { out.write( "\\" ); } else { out.write( " " ); } } out.endl(); } // Print the branches and node (eg, ___10___ ) private static <T>void printNodes(int branchLen, int nodeSpaceLen, int startLen, int nodesInThisLevel, Deque<BinaryTree<T>> nodesQueue, PaddedWriter out) { Iterator<BinaryTree<T>> iterator = nodesQueue.iterator(); BinaryTree<T> currentNode; for (int i = 0 ; i < nodesInThisLevel; i++) { currentNode = iterator.next(); if (i == 0) { out.setw(startLen ); } else { out.setw(nodeSpaceLen ); } out.write(); if (currentNode != null && currentNode.getLeft() != null) { out.setfill( '_' ); } else { out.setfill( ' ' ); } out.setw( branchLen+2 ); if (currentNode != null) { out.write(currentNode.toString()); } else { out.write(); } if (currentNode != null && currentNode.getRight() != null) { out.setfill( '_' ); } else { out.setfill( ' ' ); } out.setw(branchLen); out.write(); out.setfill(' '); } out.endl(); } // Print the leaves only (just for the bottom row) private static <T>void printLeaves(int indentSpace, int level, int nodesInThisLevel, Deque<BinaryTree<T>> nodesQueue, PaddedWriter out) { Iterator<BinaryTree<T>> iterator = nodesQueue.iterator(); BinaryTree<T> currentNode; for (int i = 0; i < nodesInThisLevel; i++) { currentNode = iterator.next(); if (i == 0) { out.setw(indentSpace+2); } else { out.setw(2*level+2); } if (currentNode !=null) { out.write(currentNode.toString()); } else { out.write(); } } out.endl(); } } </code></pre> It can be tested with this class: <pre><code>public class Tester { public static void main( String[] args ) { BinaryTree<Integer> root = new BinaryTree<Integer>(30); root.setLeft(new BinaryTree<Integer>(20)); root.setRight(new BinaryTree<Integer>(40)); root.getLeft().setLeft(new BinaryTree<Integer>(10)); root.getLeft().setRight(new BinaryTree<Integer>(25)); root.getRight().setLeft(new BinaryTree<Integer>(35)); root.getRight().setRight(new BinaryTree<Integer>(50)); root.getLeft().getLeft().setLeft(new BinaryTree<Integer>(5)); root.getLeft().getLeft().setRight(new BinaryTree<Integer>(15)); root.getLeft().getRight().setRight(new BinaryTree<Integer>(28)); root.getRight().getRight().setLeft(new BinaryTree<Integer>(41)); BinaryTree.printPretty( root, 1, 0, new PaddedWriter( System.out ) ); } } </code></pre> Something that you might want to take into account if you use this code is that the width of the node is not taken into account when working out the spacing. So if you have add a node containing 123456789 it will not print nicely.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POPretty Printing a Binary tree - Converting from C++ to Java
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USRichard Miskin
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.