@wycats For fewest moves: Find longest common subsequence, then k-1 ops to reorder the other k. @sebmarkbage said alg speed is impractical.
-
-
-
-
@sebmarkbage@soprano 0-marshalling? -
-
@sebmarkbage@soprano sure, but that isn't reality ;) -
@sebmarkbage@soprano and it's not entirely clear that the optimal algorithm involves allocating new DOM nodes -
-
- 1 more reply
New conversation -
-
-
@wycats that's just sorting, no? -
@eaf4 Assume I have a LL in the first order, and an array in the second order. And I want to move the LL to the array order. -
@wycats you'd use some sort that's good for linked lists, where the comparison function uses index position in the array.
End of conversation
New conversation -
-
-
@wycats the doom 3 game engine family.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@wycats edit distance. Levensthein comes to mind.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@wycats Diff (minimum edit distance)Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@wycats edit distance ?Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@wycats we use https://github.com/angular/angular/blob/master/modules/angular2/src/change_detection/pipes/iterable_changes.ts … in ng2, I think Polymer also has something. Interested in your findings.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@wycats Levenshtein distance maybe?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.