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).
-
-
Replying to @wycats
@wycats Skip list? http://en.wikipedia.org/wiki/Skip_list1 reply 1 retweet 1 like -
Replying to @seancribbs
@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?1 reply 0 retweets 0 likes -
Replying to @seancribbs
@seancribbs next: how to maintain a better-than-linear-time map of source->target positions when the target is a sorted version of source1 reply 0 retweets 0 likes -
Replying to @seancribbs
@seancribbs But once you've inserted it, you need a fast map from source to target that can be updated in O(log n) when source is mutated1 reply 0 retweets 0 likes -
Replying to @seancribbs
@seancribbs It's for something more general than ArrayController, but could be used in ArrayController, yeah.1 reply 0 retweets 0 likes -
Replying to @wycats
@wycats Cool. Yeah, something where you could reuse the old version, applying changes on top would be good. Maybe@swannodette has ideas?2 replies 0 retweets 0 likes
@seancribbs Persistent data structures don't have to grapple with mutations to the source, though, right? @swannodette
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.