This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
RE: Re: topological sort
- To: "'xsl-list at lists dot mulberrytech dot com'" <xsl-list at lists dot mulberrytech dot com>
- Subject: RE: [xsl] Re: topological sort
- From: Kay Michael <Michael dot Kay at icl dot com>
- Date: Mon, 8 Jan 2001 16:07:11 -0000
- Reply-To: xsl-list at lists dot mulberrytech dot com
> Furthermore, if i were to build an XSL processor, i would compute
> the cardinality of a set while constructing it, which would make
> count($setvar) O(1) instead of O(card($setvar)) if the variable has
> been evaluated before. This way count($processed) would come for
> free, because the set will have to be constructed in full anyway.
It's not quite as simple as that because some of the ways of constructing a
node-set don't naturally eliminate duplicate nodes, so a processor may
construct a bag of nodes and delay converting it to a set until count() is
called.
I've no idea, of course, if Xalan does this.
Mike Kay
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list