This is similar to the problem I had trying to benchmark the memory footprint of threaded applications. See Benchmark::Thread::Size for an example of how I embedded scripts within scripts to get a clean memory benchmark. I think a similar (probably simpler) approach could be taken to benchmark alternate approaches to $`, $& and $'.
Liz
In reply to Re: Re: Re: Re: RegExps, Prematch and Postmatch without efficiency penalty
by liz
in thread RegExps, Prematch and Postmatch without efficiency penalty
by davido
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |