in reply to Re: Efficient log parsing?
in thread Efficient log parsing?
I naïvely thought m//g would return the same kind of stuff as m// without the /g flag, so that I could iterate over the string, obtaining one array of subpatterns at a time.
But m// resets pos() and always begin at the start of the string, so that won't do either.
Is there some way I could get m// to start searching where the last match left off? Using substr()? How efficient is that? Does it make a new copy of the string, or operate directly on the original?
|
|---|