Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

Re: Re: Re: Re: RegExps, Prematch and Postmatch without efficiency penalty

by liz (Monsignor)
on Sep 14, 2003 at 16:27 UTC ( [id://291415]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Re: RegExps, Prematch and Postmatch without efficiency penalty
in thread RegExps, Prematch and Postmatch without efficiency penalty

...you should do benchmark them in separate scripts.

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

  • Comment on Re: Re: Re: Re: RegExps, Prematch and Postmatch without efficiency penalty

Replies are listed 'Best First'.
Re: Re: Re: Re: Re: RegExps, Prematch and Postmatch without efficiency penalty
by demerphq (Chancellor) on Sep 16, 2003 at 09:41 UTC

    for an example of how I embedded scripts within scripts to get a clean memory benchmark.

    I started work on a generic tool to do this as part of my OO::Benchmark stuff. Never got around to finishing it though.


    ---
    demerphq

    <Elian> And I do take a kind of perverse pleasure in having an OO assembly language...

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://291415]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others having a coffee break in the Monastery: (6)
As of 2024-04-19 07:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found