-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
On Jul 29, 2005, at 23:25, Jeremias Maerki wrote:
Strike that. Just found a mean case where my quick hack breaks. Back to
frame one and a half. It's going to be a bit more difficult.
FWIW: It occurred to me that, with a break-before="page" on the
fo:block in the second column/second row, the result you initially
posted would be correct... at least, I think so :-/
This made me wonder if the rule has to be formulated differently.
Let's make it: until we reach the first grid unit in the row that has a
box that actually causes a break --either through a forced break or
imposed by bpd constraints-- all break possibilities in previous grid
units are ONLY possibilities.
Those possibilities need to be taken into consideration, if and only if:
1) the breaking grid unit has previous boxes that still fit on the page
2) or the break was forced
(or = inclusive)
For the following grid units in the same row, we have enough
information to decide if we need to break before their first box or
not, so they do not necessarily have to have contributed their 'one
box'.
So, IIC, the grid units in a row each have to contribute ALL of their
boxes until the first real break (more than a possible break). In the
presented case, this comes down to the same thing as saying that they
have to contribute one box, but that was a simplified case for
demonstration purposes.
If implementing the rule that way is possible, I think this would hold
for most cases.
HTH!
Cheers,
Andreas
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.1 (Darwin)
iD8DBQFC61+LyHTbFO9b8aARAqZ1AKCUS3ZNlH9czbSJhvfAS6PDLy57KQCgsqTw
/J/AVs16QS3GtSTAUcipDMs=
=UxX7
-----END PGP SIGNATURE-----
