mirror of
https://github.com/servo/servo
synced 2026-05-08 16:12:15 +02:00
Previously the code was computing a prefix sum over the number of preceding elements in tree order to get the index that the node should be inserted in. That's not great if the DOM tree is big. Instead, we can compare two nodes individually by looking at their ancestor chain and then find the correct position with binary search. On https://262.ecma-international.org/16.0/index.html, this reduces the time it takes for content to appear from around 33s to 16s. Part of https://github.com/servo/servo/issues/44113 --------- Signed-off-by: Simon Wülker <simon.wuelker@arcor.de>