liborigin
2.0.0
|
![]() ![]() | |
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() ![]() | Breadth-first iterator, using a queue |
![]() ![]() ![]() | Comparator class for two nodes of a tree (used for sorting and searching) |
![]() ![]() ![]() | Iterator which traverses only the nodes at a given depth from the root |
![]() ![]() ![]() | Base class for iterators, only pointers stored, no traversal logic |
![]() ![]() ![]() | Comparator class for iterators (compares pointer values; why doesn't this work automatically?) |
![]() ![]() ![]() | Iterator which traverses only the leaves |
![]() ![]() ![]() | Depth-first iterator, first accessing the children, then the node itself |
![]() ![]() ![]() | Depth-first iterator, first accessing the node, then its children |
![]() ![]() ![]() | Iterator which traverses only the nodes which are siblings of each other |
![]() ![]() | A node in the tree, combining links to other nodes as well as the actual data |