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 next: how to maintain a better-than-linear-time map of source->target positions when the target is a sorted version of source
-
-
@wycats Doesn't that imply you need a better-than-linear time sort? -
@seancribbs no... this is for a single insert/delete/lookup. Insertion into a sorted list is easy to do better-than-linear.
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.