Beefy Boxes and Bandwidth Generously Provided by pair Networks DiBona
go ahead... be a heretic
 
PerlMonks  

Re: Re: Re^3: (~OT) How to measure Perl skills?

by QM (Vicar)
on Mar 24, 2004 at 23:53 UTC ( #339593=note: print w/ replies, xml ) Need Help??


in reply to Re: Re^3: (~OT) How to measure Perl skills?
in thread How to measure Perl skills?

There's a method cache table??? You [or I, in this case] learn something new everyday.

-QM
--
Quantum Mechanics: The dreams stuff is made of


Comment on Re: Re: Re^3: (~OT) How to measure Perl skills?
Re: Re: Re: Re^3: (~OT) How to measure Perl skills?
by diotalevi (Canon) on Mar 25, 2004 at 00:03 UTC
    Sure. If you say $obj->foo more than once only the first time suffers an OO penalty. The rest are just hash lookups and IIRC aren't more expensive than function calls. The whole OO-penalty thing people go on about is really about the process of finding foo in $obj's @ISA but that only happens when there isn't a current cache entry to pull from.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (8)
As of 2014-04-18 22:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    April first is:







    Results (472 votes), past polls