xsl-list
[Top] [All Lists]

RE: Computational complexity of accessing the Nth item in a sequence and in a node-set

2005-01-03 14:06:40
So, if I have understood correctly, having

   $sequence[last()]

(and somehow more than one reference to $sequence)
will guarantee that any further access to the items of $sequence will
be performed in constant time?

No guarantees: but yes, that's what I would expect to happen.

Cant this be pre-computed automatically by the XSLT processor?
Something like computing a function with @memo-function="yes", but
done by the XSLT processor?

I'm not clear what you mean.

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>
--~--