3 ms·
This technique should be O(n) in every browser (where n is the size of the inserted tree), unless large parts of the tree are hidden with display:none. After r
by jlokier 7y ago
This technique should be O(n) in every browser (where n is the size of the inserted tree), unless large parts of the tree are hidden with display:none.
After replaceChild(), the inserted tree must be analysed in context for CSS, layout and rendering. That will take O(n) unless parts can be skipped.
Do you mean that IE does a separate CSS or layout calculation for each node as they are inserted one by one?