[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: how to rearrange nodes based on a dependency graph
I still can't see what this would do. This isn't about simply filtering out nodes with dependencies, it is filtering out those nodes that had already been processed because of the dependency graph walk. The only way I can see to do this is to somewhere keep a list of the processed nodes, but how can I do that with XSL? (I guess I can't). The only alternative would be to decide for every node if it would have been in the dependency graph of any prior node. But that would mean that all dependency graphs need to be always chased for every node, that's kind of mind-boggling. -Gunther Chris Bayes wrote: Or even <xsl:key name='fragkey' match='frag' use='@id' /> <xsl:template match="frag[@requires]"> <xsl:for-each select="@requires"> <xsl:for-each select="key('fragkey',.)[not(@requires)]"> <xsl:copy-of select="." /> </xsl:for-each> </xsl:for-each> <xsl:copy-of select="." /> </xsl:template> <xsl:template match="frag" /> -- Gunther Schadow, M.D., Ph.D. gschadow@xxxxxxxxxxxxxxx Medical Information Scientist Regenstrief Institute for Health Care Adjunct Assistant Professor Indiana University School of Medicine tel:1(317)630-7960 http://aurora.regenstrief.org XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|