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-set Re: [xsl] Computational complexity of accessing the Nth item in a sequence and in a node-setTo: Date: 1/4/2005 9:23:00 AM On Mon, 3 Jan 2005 22:41:34 -0000, Michael Kay <mike@xxxxxxxxxxxx> wrote: > > 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. Thank you, Mike. | ||||||
| Company | Legal | Press | Partners | Careers | Sitemap | Contact Us | Altova Blog | Mobile | Full Site | |||
|
