- From: Boris Zbarsky <bzbarsky@MIT.EDU>
- Date: Wed, 20 Oct 2010 14:10:41 -0400
- To: shelby@coolpage.com
- CC: www-style list <www-style@w3.org>
On 10/20/10 1:38 PM, Shelby Moore wrote: > The pagination algorithm tests the containing block for intersection with > the page boundary, then it flags the constraint and re-runs the layout > (which calls the various constraint algorithms). This repeats until there > are no more intersections. Uh... in general, you never got to "no more interesections". So I'm not sure what you're talking about here. > You optimize this for incremental updates, by making special case rules > about how certain constructs can change layout when changed, e.g. > identifying propogation boundaries, but you still need the generalized > algorithm above for those cases that your special case optimizer can't > handle. > > Am I far off base? Dunno. The one pagination setup in a browser that I'm very familiar with works nothing like this; the second one I've sort of looked at doesn't seem to either. -Boris
Received on Wednesday, 20 October 2010 18:11:21 UTC