xsl-list
[Top] [All Lists]

Re: [xsl] Word Ladders as an example of a "Find shortest path between two nodes in a graph" problem

2012-12-06 12:40:38

On 06/12/2012 18:01, Hermann Stamm-Wilbrandt wrote:
constant time array access
XSLT doesn't define how sequences are implemented. Generally in Saxon, array access is constant-time - to the detriment of other things, of course. But a smart optimizer will choose between array-based and list-based implementations of sequences based on the usage.

Michael Kay
Saxonica

--~------------------------------------------------------------------
XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--

<Prev in Thread] Current Thread [Next in Thread>