Is there a name for a data structure that’s kinda like a skip list, but for trees (ones whose structure is non-arbitrary)?
Some of LLVM’s trees have “caching walkers” that do things along these lines
-
-
Mm, my use case is compiler-related, so I should definitely take a look at what they do.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.