Subject: Re: [xsl] Sorting substitution instructions by max. length of matches From: David Carlisle <davidc@xxxxxxxxx> Date: Fri, 5 Oct 2007 17:56:59 +0100 |
> Can you think of an example input "ababaaaaaaaaa' regex: a+ba+ so the longest match has length 11 (the last 11 characters) but the algorithms as posted report length 3 (matching the first three characters) because that first match eats the second a thus preventing any further matches. If this is really a problem I think you have to go back to stepping through by hand, but this time eating one character at a time rather than removing everything up to the last match. David ________________________________________________________________________ The Numerical Algorithms Group Ltd is a company registered in England and Wales with company number 1249803. The registered office is: Wilkinson House, Jordan Hill Road, Oxford OX2 8DR, United Kingdom. This e-mail has been scanned for all viruses by Star. The service is powered by MessageLabs. ________________________________________________________________________
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Sorting substitution inst, Yves Forkl (SRZ) | Thread | [xsl] Stripping Only Newlines from , Rudder, Doug Jr |
RE: [xsl] Selecting similar XML nod, Scott Trenda | Date | [xsl] Stripping Only Newlines from , Rudder, Doug Jr |
Month |