[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: Output flat file results 2 nodes at a time?

Subject: Re: Output flat file results 2 nodes at a time?
From: Abel Braaksma <abel.online@xxxxxxxxx>
Date: Wed, 09 May 2007 17:00:22 +0200
Re:  Output flat file results 2 nodes at a time?
David Carlisle wrote:
(ah, I see that David beat me to it with a much shorter approach ;)

Nah, that was the long approach, the shorter approach is just to use a single xpath 2 expression:



<xsl:stylesheet version="2.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
<xsl:output method="text"/>


<xsl:template match="shipment">
<xsl:value-of select="'&#10;REC1*',header/string(shipmentId),
detail/po/(if(position() mod 2 = 1) then '&#10;REC2*' else '*', string()),
detail/containers/box/(if(position() mod 4 = 1) then '&#10;REC3*' else '*',string())"
separator=""/>
</xsl:template>
</xsl:stylesheet>


That's a beauty!
Reading it, I much like the shortcut of deatil/po(if ...) etc. I then hoped, that the if-statement could be replaced with a predicate, but that wouldn't work, as the position() will then be about the sequence and not the element, like here:


detail/po/(('*', '&#10;REC2*')[position() mod 2 + 1], string())

and even if it worked, it'd be questionable whether it'd be clearer than the if-syntax.

Current Thread

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2011 All Rights Reserved.