RE: Computational complexity of accessing the Nth item
> 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/
PURCHASE STYLUS STUDIO ONLINE TODAY!
Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!
Download The World's Best XML IDE!
Accelerate XML development with our award-winning XML IDE - Download a free trial today!
Subscribe in XML format