The intention is to augment the iterator based (linear) search used in EventLog to allow for real backtracking, based on a evaluation tree. This should be rather staight forward to implement, relying on the exploreChildren() functionality of TreeExplorer. The trick is to package the chained search step as a monadic flatMap operation |
||
|---|---|---|
| .. | ||
| draw | ||
| DIR_INFO | ||
| empty.html | ||
| InterfaceConcept_Varga.mm | ||
| renderengine.html | ||
| thinkPad.ichthyo.mm | ||
| uml | ||
| workflow.mm | ||