...since usually such evaluation layers are finally wrapped into an IterableDecorator and then presented as TreeEplorer -- an exercise we do not want to perform here, since it is pointless in the typicall use case. The IterChainSearch is already meant to be ready-for-use. Thus, instead of wrapping again, the pragmatic solution is simply to overload the missing operator++ and make it call the augmented iterNext() function. Related to this, we also need to ensure proper operation in case no further expansion is mandated |
||
|---|---|---|
| .. | ||
| draw | ||
| DIR_INFO | ||
| empty.html | ||
| InterfaceConcept_Varga.mm | ||
| renderengine.html | ||
| thinkPad.ichthyo.mm | ||
| uml | ||
| workflow.mm | ||