I like the idea, but I don't know how to do that. Can you take pity on
an XSL newbie and kindly show me how to do that?
marvin(_dot_)the(_dot_)cynical(_dot_)robot(_at_)gmail(_dot_)com 10/12/04
10:09AM >>>
Hi,
Why dont you write a second XSL program and have it operate on the
sorted output of the first? The document order for the
preceding-sibling in the second program will be the right order that
you need.
Regards,
Kenneth
On Tue, 12 Oct 2004 09:55:29 -0400, Hardy Merrill
<hmerrill(_at_)dhcr(_dot_)state(_dot_)ny(_dot_)us> wrote:
I was trying to use "preceding-sibling" to figure out if the
previous
sibling ***in sorted order*** had the same district, but I've now
figured out after reading on the subject that "preceding-sibling"
does
not operate on the sorted tree - instead it operates on the original
tree that is in "document" order.
I'd like to use the best/most efficient method to solve this problem
-
the muncheon technique using keys if possible. Can I do that, and
if
so, how?
--+------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--+--