What's the right family of algorithms for calculating the operations needed to convert 1 list of unique values into another in diff order?
-
-
Replying to @wycats
@wycats For fewest moves: Find longest common subsequence, then k-1 ops to reorder the other k.@sebmarkbage said alg speed is impractical.1 reply 0 retweets 5 likes -
Replying to @sophiebits
@soprano@wycats I believe VDom (Dart) does it. Tradeoff is insertion speed. Ideal algorithm is 0-marshaling. node.children = newChildren.2 replies 0 retweets 1 like -
-
Replying to @sebmarkbage
@sebmarkbage@soprano sure, but that isn't reality ;)1 reply 0 retweets 0 likes -
Replying to @wycats
@sebmarkbage@soprano and it's not entirely clear that the optimal algorithm involves allocating new DOM nodes1 reply 0 retweets 0 likes -
Replying to @sebmarkbage2 replies 8 retweets 15 likes
Replying to @sebmarkbage
@sebmarkbage @soprano a bigger issue is the lack of DOM transactions and direct control over the LL.
9:13 AM - 3 Jun 2015
0 replies
0 retweets
0 likes
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.