For my own curiousity, does XSLT 2.0/XPath 2.0 get around
this limitation?
In 1.0, the only operation that does alphabetic order comparison is sorting.
In 2.0, you can use the comparison operators < and > (or lt, gt) to compare
strings, so there's a much wider range of possibilities. In fact, the
solution you provide for numbers:
Elements/Element[. < preceding-sibling::node()]
will do a string comparison rather than a numeric comparison in 2.0. It's
wrong, however: you should write
Elements/Element[. < preceding-sibling::*[1]]
Michael Kay
http://www.saxonica.com/
--~------------------------------------------------------------------
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>
--~--