Subject: [xsl] flat tree to expanded tree From: "bix xslt" <bix_xslt@xxxxxxxxxxx> Date: Thu, 12 Dec 2002 22:04:36 +0000 |
From the list I've gathered that I more than likely need to use SteveMuench's algorithm to quickly and effectively sort my somewhat complex list. However, I'm at a loss as to how to procede.
<!ELEMENT list (proc)*> <!ELEMENT proc (exec|dpnd)*> <!ELEMENT exec (item)*> <!ELEMENT dpnd (item)*> <!ELEMENT item EMPTY>
<!ATTLIST list mode CDATA #IMPLIED
<!ATTLIST proc id ID #REQUIRED type (r|e) 'r'
<!ATTLIST exec type (i|a) 'i'
<!ATTLIST item idr IDREF #REQUIRED
-- file 1 -- <list mode="normal"> <proc id="a" /> </list>
-- file 2 -- <list mode="normal"> <proc type="r" id="b"> <exec type="a"> <item idr="c" /> <item idr="d" /> </exec> </proc>
<proc type="e" id="c"> <dpnd> <item idr="a" /> </dpnd> <exec type="a"> <item idr="e" /> <item idr="f" /> </exec> </proc> </list>
-- file 3 -- <list mode="normal"> <proc id="d"> <dpnd> <item idr="g" /> </dpnd> </proc> </list>
-- file 4 -- <list mode="normal"> <proc id="e" /> <proc id="f" />
<proc id="g" /> </list>
So as an output, I might have: 1) an alphabetical listing: a b c d e f g
a b d c e f g
3a) an execution listing (this can be an expandable tree - preferred): b g d a c e f
3b) an execution listing (flat list - acceptable): b g d a c e f
Thanks, Bix
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
RE: [xsl] accessing individual node, Martinez, Brian | Thread | Fwd: Re: [xsl] flat tree to expande, Kevin Jones |
RE: [xsl] About validating post xsl, Dion Houston | Date | RE: [xsl] accessing individual node, Martinez, Brian |
Month |