Altova Mailing List Archives>Archive Index >xsl-list Archive Home >Recent entries >Thread Prev - Re: [xsl] Computational complexity of accessing the Nth item in a sequence and in a node-set [Thread Next] RE: [xsl] Computational complexity of accessing the Nth item in a sequence and in a node-setTo: Date: 1/3/2005 9:07:00 PM > 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/ | ||||||
| Company | Legal | Press | Partners | Careers | Sitemap | Contact Us | Altova Blog | Mobile | Full Site | |||
|
