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.
-
-
Yeah, I was looking a bit at those, not sure how they would be applicable to the VDOM case, but it might be worthwhile digging further. The "graph of edits" and shortest path is interesting.
-
Also not sure how that works with trees? I've only seen examples on strings.
- 7 more replies
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.