[XSL-LIST Mailing List Archive Home] [By Thread] [By Date]

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


Subject: RE: [xsl] 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 22:41:34 -0000

> probably not a direct reference, but by calling a function myLast()
> that returns
>        $sequence[last]
> 
> I want this to be calculated only once. My question was will it be
> successful to use the
> 
> saxon:memo-function="yes" attribute 
> 
> on the definition of myLast()

I suspect that's not a good idea. Evaluating $seq[last] is probably much
faster than calculating the hash key to discover that the result is already
stored. Memo functions work best when the arguments are small.

As always, though, the only definitive answer is to measure it.

Michael Kay
http://www.saxonica.com/


Current Thread