If you want to generalize the process to a n-set, a recursion method is
XSLT looks the best candidate to me to do this. I will tackle it when I find
----- Original Message -----
From: "Xepherys" <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Thursday, October 10, 2002 8:26 AM
Subject: [PHP-DB] MySQL REGEXP functionality... any way to make this easier?
> Right now, a sample query I might have would be...
> SELECT * FROM ospd WHERE word REGEXP '^([a]?[p]?[e]?)$|^[p]?[a]?[e]?$|^[a
> where basically I need to query every combination of a, p and e. This is
> pain, but for only three letter is not so bad. As you can see, this could
> become unruly with larger numbers of letters. Each instance of a letter
> only occur once. However, a letter may be duplicated and used once for
> instance. Hence the statement steps through... it could also be something
> SELECT * FROM ospd WHERE word REGEXP
> more easily written because one letter is used twice and can occure once
> each instance. Please let me know if you have any ideas.
> [EMAIL PROTECTED]
> PHP Database Mailing List (http://www.php.net/)
> To unsubscribe, visit: http://www.php.net/unsub.php
PHP Database Mailing List (http://www.php.net/)
To unsubscribe, visit: http://www.php.net/unsub.php