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

RE: transforming flat data to hierarchical data. Recur

Subject: RE: transforming flat data to hierarchical data. Recursion??
From: Jarno.Elovirta@xxxxxxxxx
Date: Fri, 6 Jun 2003 11:37:29 +0300
hierarchical data xsl
Hi,

> I think I need to use recursion but I cannot get the output I want.
> I tried replacing every /Next/@id with its matching element 
> using a xsl:key 
> on the PAGE elements based on id
> but that only replaces on one level and since I don't know 
> the lenght of the 
> linked lists I cannot use this principle.
> 
> Does anybody have an idea how to solve this
> I'm not really that familiar with xslt

How about

<xsl:key name="id" match="PAGE" use="@id" />
<xsl:key name="idref" match="Next" use="@id" />

<xsl:template match="Pages">
  <xsl:copy>
    <xsl:apply-templates select="PAGE[not(key('idref', @id))]" />
  </xsl:copy>
</xsl:template>

<xsl:template match="Next">
  <xsl:copy>
    <xsl:apply-templates select="key('id', @id)" />
  </xsl:copy>
</xsl:template>

<xsl:template match="@*|node()">
  <xsl:copy>
    <xsl:apply-templates select="@*|node()"/>
  </xsl:copy>
</xsl:template>

Cheers,

Jarno - Dulce Liquido: [expletive deleted] Off

 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list


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-2013 All Rights Reserved.