Andrew Welch wrote:
On 22/02/2008, Michael Kay <mike(_at_)saxonica(_dot_)com> 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(_dot_)klyne(_at_)groupbc(_dot_)com
www.groupbc.com
--~------------------------------------------------------------------
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>
--~--