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.
-
Show this thread
-
Replying to @owickstrom @bodil
Check for shortest-edit path algorithms. Idk which algos react uses but Myers diff + patience diff optimizations should get you most of the way there.
2 replies 0 retweets 1 like
Aka what we should have used in nanomorph.https://github.com/choojs/nanomorph …
0 replies
0 retweets
1 like
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.