- From: Boris Zbarsky <bzbarsky@MIT.EDU>
- Date: Thu, 11 Jul 2013 23:47:55 -0400
- To: François REMY <francois.remy.dev@outlook.com>
- CC: "www-style@w3.org" <www-style@w3.org>
On 7/11/13 11:28 PM, François REMY wrote: > However, you can take a very different approach for them if you're not forced to be exact about them every time. For instance, let's say the author want the selector matching be accurate within 250ms, that leaves you 15 frames to accomplish the task. instead of optimising upfront you just queue all the possibly influenced elements in a list and you process them in a background thread asynchronously. Processing in the background thread in parallel with DOM mutations involves figuring out whether the DOM mutations invalidate the results of your background processing, as you note. Unless you're willing to just give up any guarantees of ever having this algorithm converge on the "right" rendering. -Boris
Received on Friday, 12 July 2013 03:48:24 UTC