- From: Chris Harrelson <notifications@github.com>
- Date: Fri, 03 Feb 2023 08:32:33 -0800
- To: whatwg/dom <dom@noreply.github.com>
- Cc: Subscribed <subscribed@noreply.github.com>
Received on Friday, 3 February 2023 16:32:45 UTC
> React keyed nodes I'd like to understand the exact use case you're describing. Is it this: *Replace children of a node with a given list of nodes, in the specified order* And expect the UA to do so in the most efficient way possible, such as by avoiding re-creation of nodes in the list that are already children of the given node? Is this algorithm used in a diffing algorithm for React or some other common library? -- Reply to this email directly or view it on GitHub: https://github.com/whatwg/dom/issues/586#issuecomment-1416110060 You are receiving this because you are subscribed to this thread. Message ID: <whatwg/dom/issues/586/1416110060@github.com>
Received on Friday, 3 February 2023 16:32:45 UTC