- From: Boris Zbarsky <bzbarsky@MIT.EDU>
- Date: Tue, 19 Oct 2010 12:31:26 -0400
- To: shelby@coolpage.com
- CC: www-style list <www-style@w3.org>
On 10/19/10 12:14 PM, Shelby Moore wrote: > How does it "complicate" orthogonal algorithms? For example, a visual > bounds test walks the element tree No UA I'm aware of walks the element tree here; all would operate on the box model instead... > If pagination algorithm has been designed to be sufficiently orthogonal, > then afaics it should also not be touched for this proposal. Are you > concerned or aware that some layout engines may not be coded with > sufficiently orthogonal (non-spaghetti) design? "All of them", I would expect. > I do not know what you mean by "incremental update"? Is that an algorithm > that bypasses full document relayout computation? Yes. The thing that happens any time you change the DOM, resize the window, etc. The hard part of implementing CSS, in many ways. -Boris
Received on Tuesday, 19 October 2010 16:32:04 UTC