Re: [xsl] Help, my problem is n-cubed ... and so is my XSLT code

["Graydon graydon@xxxxxxxxx" <xsl-list-service@xxxxxxxxxxxxxxxxxxxxxx>]

On Fri, Mar 14, 2025 at 04:26:54PM -0000, Michael Kay michaelkay90@xxxxxxxxx scripsit:
> Three options:
> 
> (a) use xsl:key
> 
> (b) use an XSLT processor that optimizes joins (such as Saxon-EE) (but you may need to write the search using predicates, not using xsl:for-each and xsl:if)
> 
> (c) build your own indexes as maps, as you suggest.

Tangentially, is there a use case where xsl:key is expected to be
preferable in performance terms to using maps?

(As I recall, the last time I used xsl:key was also the last time I had
to use XSLT 2. But this may not be sensible of me.)

Thanks!
Graydon


--  
Graydon Saunders  | graydonish@xxxxxxxxxxxx
\xDE\xE6s ofer\xE9ode, \xF0isses sw\xE1 m\xE6g.
-- Deor  ("That passed, so may this.")