initially the intention was to include a "bracketing construct" into the values returned by the iterator. After considering the various implementation and representation approaches, it seems more appropriate just to expose a measure for the depth-in-tree through the iterator itself, leaving any concerns about navigation and structure reconstruction to the usage site. As rationale we consider the full tree reconstruction as a very specialised use case, and as such the normal "just iteration" usage should not pay for this in terms of iterator size and implementation complexity. Once a "level" measure is exposed, the usage site can do precisely the same, with the help of the HierarchyOrientationIndicator. |
||
|---|---|---|
| .. | ||
| diff-index-table-test.cpp | ||
| diff-list-application-test.cpp | ||
| diff-list-generation-test.cpp | ||
| gen-node-basic-test.cpp | ||
| generic-record-representation-test.cpp | ||
| generic-tree-mutator-test.cpp | ||
| generic-tree-representation-test.cpp | ||