|Perl Monk, Perl Meditation|
that is effectively similar to simply ignoring non-aligned matched ... How so?
Although embedding the called-back code within the regex as a zero-length code assertion looks like its not exiting the regex engine; the effect on performance shows that the need to set-up and tear down a scope and invoke that code has a very significant effect:
If it was possible to avoid running 3 orders of magnitude slower, the benefits would be enormous for my application.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
In reply to Re^6: A regex that only matches at offset that are multiples of a given N? (Update:almost perfect!)