Tree objects define a tree structure by implementing the local movement methods
Each of which takes and returns a position object of arbitrary type (fixed for the Tree)
as done in urwids ListWalker API. Apart from this, a Tree is assumed to define a dedicated
position tree.root that is used as fallback initially focussed element,
and define the
__getitem__() method to return its content (usually a Widget) for a given position.
Tree only defines a tree structure, it does not necessarily have any decoration around
its contained Widgets.
There is a ready made subclass called
SimpleTree that offers the tree API for a given
nested tuple structure. If you write your own classes its a good idea to subclass
and just overwrite the above mentioned methods as the base class already offers a number of
Base class for a tree strucures that can be displayed by
TreeBoxwidgets. An instance defines a structure by defining local transformations on positions. That is, by overwriting
that compute the next position in the respective direction. Also, they need to implement method __getitem__ that returns a
Widgetfor a given position.
The type of objects used as positions may vary in subclasses and is deliberately unspecified for the base class.
This base class already implements methods based on the local transformations above. These include
[next|prev]_positionthat computes next/previous positions in depth-first order.
determine depth of node at pos
position of pos’s ancestor with depth 0. Usually, this should return the root node, but a
Treemight represent a forrest - have multiple nodes without parent.
returns the position of the first child of the node at pos, or None if none exists.
position of first sibling of pos
checks if given position has no children
returns the position of the last child of the node at pos, or None if none exists.
position of last (in DFO) decendant of pos
position of last sibling of pos
returns the next position in depth-first order
returns the position of the next sibling of the node at pos, or None if none exists.
returns the position of the parent node of the node at pos or None if none exists.
returns a generator that walks the positions of this tree in DFO
returns the previous position in depth-first order
returns the position of the previous sibling of the node at pos, or None if none exists.
Walks on a given fixed acyclic structure given as a list of nodes; every node is a tuple (content, children), where content is a urwid.Widget to be displayed at that position and children is either None or a list of nodes.
Positions are lists of integers determining a path from the root node with position (0,).
more performant implementation due to specific structure of pos