then you should measure how fast those substrs operate without the regex and if they really always deal with strings of the same length.
Cheers Rolf
(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery
In reply to Re: Are beheaded strings known to be slow?
by LanX
in thread Are beheaded strings known to be slow?
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |