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 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 mutated
-
-
@wycats Aha, ok. A persistent data-structure maybe (having old index readily available)? This is for ArrayController et al? -
@seancribbs It's for something more general than ArrayController, but could be used in ArrayController, yeah. -
@wycats Cool. Yeah, something where you could reuse the old version, applying changes on top would be good. Maybe@swannodette has ideas? -
@seancribbs Persistent data structures don't have to grapple with mutations to the source, though, right?@swannodette
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.