Subject: Re: [xsl] Sorting substitution instructions by max. length of matches From: "Yves Forkl (SRZ)" <Y.Forkl@xxxxxx> Date: Fri, 05 Oct 2007 17:41:20 +0200 |
I'd probably use analyze-string rather than using an explicit recursion to do the lookup.
Thank you for this solution which is really elegant. Once I have seen this, I come to think that I've exposed a rather trivial problem... :-)
(I think in both cases they may fail to find the longest match possible, as earlier matches may obscure a possible later longer match)
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Sorting substitution inst, David Carlisle | Thread | Re: [xsl] Sorting substitution inst, David Carlisle |
Re: [xsl] Sorting substitution inst, David Carlisle | Date | RE: [xsl] Selecting similar XML nod, Chaudhary, Harsh |
Month |