I haven't gotten around to writing documentation yet, because I'm not quite happy with the abstraction. If you give me a rough idea of what kind of tree it is, I can probably tell you the right thing to do. The most basic interface is just to return an iterator over a node's children from AbstractTrees.children, then printing can be handled by print_tree(...) or show(Tree(x)), though there are many customization options.
On Sat, Aug 13, 2016 at 1:05 PM, Andreas Lobinger <lobing...@gmail.com> wrote: > Hello colleague, > > On Saturday, August 13, 2016 at 6:38:31 PM UTC+2, Steven G. Johnson wrote: >> >> >> On Friday, August 12, 2016 at 2:45:12 AM UTC-4, Andreas Lobinger wrote: >> > > >> can someone please point me to some (more) documentation/packages about >>> handling tree structures in types? AbstractTrees.jl leaves me a little bit >>> alone without docu (yes, i've seen the comments in source, but still...) >>> and an example without comments. >>> >> >> Type definitions can be self-referential, so there is no particularly >> difficulty in defining a tree data structure. For example, here is how you >> might define a binary tree, using the Nullable type to indicate whether a >> branch is present: >> > > this wasn't problem. I'm struggling a little bit with show/display, as > the generic method shows not only the reference, but also the instance. So > if i show/display a 'leaf' and it contains a reference to the parent, the > full parent is displayed also. I was looking for something like > pretty-printing of tree structures, in a generic sense. > > >
