Subject: Re: [xsl] XSL-FO result tree structure design From: "G. Ken Holman" <gkholman@xxxxxxxxxxxxxxxxxxxx> Date: Thu, 24 May 2012 13:05:34 -0400 |
The transformed FO output reflects containers within containers within the body flow (I use the id for reading ease, not in actual output): <block id="chapter"> <block id="sect1"> <block id="sect2"> <block id="para">A lonely para in a cruel sect2.</block> </block> </block> </block>
The second way is to create loose blocks, outside of other containing blocks, where possible. Example 2: Loose Blocks (I don't mean blocks that are immoral) - result FO:
<block id="chapter"/> <block id="sect1"/> <block id="sect2"/> <block id="para">A lonely para in a cruel sect2.</block>
<block id="chapter" keep-with-next="always"/> <block id="sect1" keep-with-next="always"/> <block id="sect2" keep-with-next="always"/> <block id="para">A lonely para in a cruel sect2.</block>
Finally, my questions, based on the above, and my limited knowledge on how the Arbortext PE (and FO processors) work: 1) Is there a preferred method in result tree design that FO processors prefer, especially related to memory allocation or chunking?
2) Are there specific risks or benefits to using one of these two methods?
3) Are there other methods I am missing? Hybrid, etc.
-- Public XSLT, XSL-FO, UBL and code list classes in Europe -- Oct 2012 Contact us for world-wide XML consulting and instructor-led training Free 5-hour lecture: http://www.CraneSoftwrights.com/links/udemy.htm Crane Softwrights Ltd. http://www.CraneSoftwrights.com/s/ G. Ken Holman mailto:gkholman@xxxxxxxxxxxxxxxxxxxx Google+ profile: https://plus.google.com/116832879756988317389/about Legal business disclaimers: http://www.CraneSoftwrights.com/legal
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
[xsl] XSL-FO result tree structure , Michael Friedman | Thread | Re: [xsl] XSL-FO result tree struct, Tony Graham |
Re: [xsl] Diagram of XPath axes, Imsieke, Gerrit, le- | Date | Re: [xsl] XSL-FO result tree struct, Tony Graham |
Month |