Is there a canonical solution for maintaining an index for offsets in a data-set that isn't O(n) when splicing into the middle?
@swindsor I want O(log n) insert, delete and lookup-by-position. Indexable skiplist seems to work.
-
-
@wycats I think typically red-black trees are used for this (and very common in std libs like STL) http://en.wikipedia.org/wiki/Red%E2%80%93black_tree …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.