Re: Recursion performance (fibonacci numbers)

> Or if you want timing information:
>
> java net.sf.saxon.Transform -t fibonacci2.xsl fibonacci2.xsl n=30
>
> though you need to be aware that for anything less than a second or two,
the
> timings will be meaningless as they are dominated by Java warm-up time.

If you use easytransformer (a graphical front end for Saxon) then the
timings below 2 seconds should be more accurate than from the command
line as it doesn't include java start up or stylesheet parsing - it
starts only when the transformation begins (when the XML is parsed).

http://sourceforge.net/projects/easytransformer

(easytransformer uses SaxonB 8.6.1, so an XSLT 1.0 stylesheet would be
running with an 2.0 processor, if that's significant.  In this case
you would ideally give the root matching template a name and then use
the "standalone" tab, so you dont have to apply the stylesheet to
itself)