Anyone know of papers or articles on the VDOM patch algorithm in React based on keys? That is, to make patching reordered lists fast. I've searched for material but nothing so far. I have a few napkin notes on a functional implementation that I'd like to compare to prior art.
-
-
Ah okay: LIS = longest increasing subsequence. In an earlier Tweet I mentioned using Patience Diff as an optimization for Myers which is an LIS algo. You need both tho, and patience doesn't work without Myers (or similar), so I recommend to start with Myers.
-
(Happy to be educated if there are more efficient versions of either of these algorithms! Myers is *old*, haha)
End of conversation
New conversation -
-
-
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.