Subject: RE: Combining two node Sets into one
From: "Williamson, Chris" <cwilliamson@xxxxxxxxx>
Date: Fri, 1 Apr 2005 17:05:49 -0500
|
You can probably tell my inexperience with this because I probably opted to
take the most complex path possible. I will give this a try on Monday and
see what I can come up with.
Thanks again for the help,
Chris
-----Original Message-----
From: Wendell Piez [mailto:wapiez@xxxxxxxxxxxxxxxx]
Sent: Friday, April 01, 2005 4:49 PM
To: xsl-list@xxxxxxxxxxxxxxxxxxxxxx
Subject: RE: Combining two node Sets into one
Chris,
At 04:24 PM 4/1/2005, you wrote:
>I have no way now to get the dates in order without calling some
>ridiculous recursive template that sorts the nodes for me and prints
>the appropriate one. Loop.. Print. which could result in a high number
>of passes..
Why not sort them with the same instruction you'd use to sort them if
converting them to an intermediate format?
<xsl:template match="/">
<table>
<xsl:apply-templates select="//Disbs | //Refunds">
<xsl:sort select="DisbDetail/Ddate | RefDetail/Rdate"/>
</xsl:apply-templates>
</table>
</xsl:template>
<xsl:template match="Disbs | Refund">
<tr class="{local-name()}">
... etc ...
</tr>
</xsl:template>
... the 'class' attribute there gets the value "Disbs" or "Refund" -- i.e.
the name of the matched element.
There are cases where complex sorting and grouping requirements push us
into having to process temporary trees, but I haven't yet seen anything
here that makes me think this is one of them.
Cheers,
Wendell
======================================================================
Wendell Piez mailto:wapiez@xxxxxxxxxxxxxxxx
Mulberry Technologies, Inc. http://www.mulberrytech.com
17 West Jefferson Street Direct Phone: 301/315-9635
Suite 207 Phone: 301/315-9631
Rockville, MD 20850 Fax: 301/315-8285
----------------------------------------------------------------------
Mulberry Technologies: A Consultancy Specializing in SGML and XML
======================================================================
|