This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
RE: Simple problem - complicated solution
- From: michael dot h dot kay at ntlworld dot com
- To: xsl-list at lists dot mulberrytech dot com
- Date: Fri, 17 May 2002 7:39:43 +0000
- Subject: [xsl] RE: Simple problem - complicated solution
- Reply-to: xsl-list at lists dot mulberrytech dot com
> The solutions that Joerg presented work correctly, but they are both O(n^2) solutions.
That rather depends on the optimizer. It's not very hard for an optimizer to turn $x[not($x>.)] into an O(n) expression. Though Saxon doesn't currently do it, I regret.
Michael Kay
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list