It doesn't need to support eager re-computation, just lazily finding item at position N after splice has occurred (in O(log n) if possible).
@seancribbs so the idea is that each layer has a count of the elements below it, so splicing just updates the number of layers up?
-
-
@wycats Maybe. I understand it more as a way to quickly find elements in a sorted list by value. Updating just moves pointers. -
@seancribbs I need find-by-position, and it looks like the indexable skiplist does the trick. -
@wycats Awesome, cheers! :D
End of conversation
New conversation -
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.