[xsl] RE: Simple problem - complicated solution

[michael.h.kay@xxxxxxxxxxxx]

> 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