This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
Re: Ordering of Blocks based on Input/Output
- To: xsl-list at lists dot mulberrytech dot com
- Subject: Re: [xsl] Ordering of Blocks based on Input/Output
- From: Dan Diebolt <dandiebolt at yahoo dot com>
- Date: Tue, 8 May 2001 13:27:05 -0700 (PDT)
- Reply-To: xsl-list at lists dot mulberrytech dot com
F>Hope this helps - a fun challenge at the end of the day!
Thanks Francis. I will have to study this and compare it.
If I haven't mentioned it before, I have a lot of graph
manipulation problems similar to this. For the most part,
I have something that works in every area of my application
but I now have to start looking for the best implementation
(fastest) as I have thousand upon thousand of nodes. I try to
clean up and simplify my questions before posting to the list,
but they are then often removed from the larger context.
The suggestion from Ingo to process in two passes is something
I am strongly considering. The first pass could potentially
reform the XML to make it more accessible for the second
pass which did the actual presentation transformation. Earlier
in the day there was a post from Swen concerning tokenizing
<text>A:a;B:b;C:c;D:d</text>. I have found out the hard way
it is often easier to process the XML in two passes. In this
case transform to <text><A>a</A><B>b</B><C>c</C><D>d</D></text>
and then do the presentation transformation in the second pass.
I am trying to evaluate this same appraoch to the current problem.
I am still looking for more input (from Jeni?) so please feel
free to comment on various approaches.
Regards,
Dan
The lesson I keep experiencing
is your XML processing is easier
__________________________________________________
Do You Yahoo!?
Yahoo! Auctions - buy the things you want at great prices
http://auctions.yahoo.com/
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list