Optimize navigation

[LinqLover]

Current bottlenecks:

• scrolling/tree display: TDBCursor>>#traceFor: (via TDBCursor>>#childContextsFor:, 68%) - forego generators in TDBTrace>>#withAllDescendants, use binary depth-first search
• stepping: TDBTrace>>#traceAtTime: (13%) - inline binary search? don't use #associations.

Further optimization potential:

• We are still rebuilding the tree after every step (#wrapRoots), which helps us fulfill all invariants, but is terribly slow. Updating the trace iteratively would be hard with respect to the current limitations of the PluggableTreeMorph API, automatic expansion of relevant nodes, and coroutines (Support coroutines #14).- [ ] use non-linear search algorithms for stepping operations (i.e., binary search with unknown size)
• All stepping operations could be optimized by rolling out an exponential search mechanism. For this, we would need to define an absolute criterion for "whether a timeIndex belongs to the right step".
• optimize inspector updates (could be possible with the help of Epic: State queries #21)
• not yet optimized: stepBack
• Reduce truncationLimit in snapshot inspectors (requires upstream contribution)