Subject: Re: comparing sequences that contain more than one of the same item
From: Ronan Klyne <ronan.klyne@xxxxxxxxxxx>
Date: Fri, 22 Feb 2008 15:42:01 +0000
|
Andrew Welch wrote:
On 22/02/2008, Michael Kay <mike@xxxxxxxxxxxx> wrote:
Sort the characters in the long string into code point order
farmer => aefmrr
Turn this into a regular expression in which each character is optional
a?e?f?m?r?r?
Sort the characters in the short string into code point order, and test
whether the result matches this regular expression.
I can't see what you're getting at, but I can't convert it into a
working example:
matches('hello', 'a?e?f?m?r?r?')"
returns true, which suggests the regex needs work... but I don't know
regex's well enough to correct it.
Add a caret and a dollar to mark the beginning and end of the string,
otherwise it's allowed to match a zero length substring
matches('ehllo', '^a?e?f?m?r?r?$')
# r
--
Ronan Klyne
Business Collaborator Developer
Tel: +44 01189 028518
ronan.klyne@xxxxxxxxxxx
www.groupbc.com
|
Cart
