[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

RE: Computational complexity of accessing the Nth item

Subject: RE: Computational complexity of accessing the Nth item in a sequence and in a node-set
From: "Michael Kay" <mike@xxxxxxxxxxxx>
Date: Mon, 3 Jan 2005 21:06:40 -0000
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/

Current Thread

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.