Subject: Re: [xsl] how to rearrange nodes based on a dependency graph? From: Wendell Piez <wapiez@xxxxxxxxxxxxxxxx> Date: Thu, 20 Dec 2001 18:46:36 -0500 |
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.
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 ======================================================================
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] how to rearrange nodes ba, Gunther Schadow | Thread | RE: [xsl] how to rearrange nodes ba, Chris Bayes |
Re: [xsl] how to rearrange nodes ba, Gunther Schadow | Date | RE: [xsl] how to rearrange nodes ba, Chris Bayes |
Month |