W3C home > Mailing lists > Public > www-style@w3.org > October 2010

RE: Positioned Layout proposal

From: Shelby Moore <shelby@coolpage.com>
Date: Tue, 19 Oct 2010 12:14:50 -0400
Message-ID: <96aebb7e4ba339714f97b2c598c5a077.squirrel@sm.webmail.pair.com>
To: "Alex Mogilevsky" <alexmog@microsoft.com>
Cc: "Tab Atkins Jr." <jackalmage@gmail.com>, "www-style list" <www-style@w3.org>

> 2) It appears easy when it only applies to absolute positioning


> (although
> implementation will not be that easy - it will complicate calculating
> visual bounds, incremental update, pagination and more...).

How does it "complicate" orthogonal algorithms? For example, a visual
bounds test walks the element tree and buildings bounding box from
rectange unions, thus afaics is not concerned with nor aware of (i.e.
orthogonal to) the positioning method is employed.

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?

I do not know what you mean by "incremental update"? Is that an algorithm
that bypasses full document relayout computation?  Specifics?

> But will it be
> enough? If such a major concept is added to layout model, wouldn't it be
> expected to extend to in-flow content (which of course would be much
> harder, adding circular size dependencies)?

Is that a problem if we restrict that they are only non-float siblings or
parent hierarchy, which are not cols or rows elements? See my prior post

Received on Tuesday, 19 October 2010 16:15:24 UTC

This archive was generated by hypermail 2.3.1 : Monday, 2 May 2016 14:38:39 UTC