--- /dev/null
+# -*- coding: utf-8 -*-
+
+# Copyright (c) 2008/2013 Andrey Vlasovskikh
+#
+# Permission is hereby granted, free of charge, to any person obtaining
+# a copy of this software and associated documentation files (the
+# "Software"), to deal in the Software without restriction, including
+# without limitation the rights to use, copy, modify, merge, publish,
+# distribute, sublicense, and/or sell copies of the Software, and to
+# permit persons to whom the Software is furnished to do so, subject to
+# the following conditions:
+#
+# The above copyright notice and this permission notice shall be included
+# in all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+
+def pretty_tree(x, kids, show):
+ """(a, (a -> list(a)), (a -> str)) -> str
+
+ Returns a pseudographic tree representation of x similar to the tree command
+ in Unix.
+ """
+ (MID, END, CONT, LAST, ROOT) = (u'|-- ', u'`-- ', u'| ', u' ', u'')
+
+ def rec(x, indent, sym):
+ line = indent + sym + show(x)
+ xs = kids(x)
+ if len(xs) == 0:
+ return line
+ else:
+ if sym == MID:
+ next_indent = indent + CONT
+ elif sym == ROOT:
+ next_indent = indent + ROOT
+ else:
+ next_indent = indent + LAST
+ syms = [MID] * (len(xs) - 1) + [END]
+ lines = [rec(x, next_indent, sym) for x, sym in zip(xs, syms)]
+ return u'\n'.join([line] + lines)
+
+ return rec(x, u'', ROOT)