My rough check, with 1 mismatch, works out to the same order of magnitude as choroba's first try, but maybe 2x slower. With more mismatches, my solution goes exponential creating regexes, but should take a bit less time in the matching phase. (Hand-wavy arguments go here.)
Code:
-QM
--
Quantum Mechanics: The dreams stuff is made of
In reply to Re: How do you match a stretch of at least N characters
by QM
in thread How do you match a stretch of at least N characters
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |