Subject: Re: Performance versus legibility From: Dimitre Novatchev <dnovatchev@xxxxxxxxx> Date: Sat, 25 Nov 2000 00:30:30 -0800 (PST) |
> not(string(.)) string-length(.)=0 > not(x) count(x)=0 > not(x=y) x!=y This is an interesting idea. If there is a known set of equivalent expresions: Exp1 <---> Exp2 <---> ... ExpN, then an XSLT processor can choose to implement any expression in the chain with the one that will be most efficient. Therefore, it would be very useful to establish and publish a good rich set of such equivalence-expression-chains. Dimitre Novatchev. __________________________________________________ Do You Yahoo!? Yahoo! Shopping - Thousands of Stores. Millions of Products. http://shopping.yahoo.com/ XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: Performance versus legibility, Dimitre Novatchev | Thread | [Zvon Announcement] Namespace refe, Miloslav Nic |
Re: Char node-type, Dimitre Novatchev | Date | RE: Implementing recursion (Was Re:, Dimitre Novatchev |
Month |