Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re: '%hash = ()' is slower than 'undef %hash'

by kcott (Bishop)
on May 19, 2018 at 06:55 UTC ( #1214896=note: print w/replies, xml ) Need Help??

in reply to '%hash = ()' is slower than 'undef %hash'

G'day rsFalse,

"What is your opinion?"

Unfortunately, you've provided very little information upon which an opinion might be based. Answers to the following would have been useful in your OP.

  • How did you declare %hash? my? our? no strict 'vars'; and just let it pop into existence? something else?
  • In what context are you using %hash?
  • Why are you attempting to get rid of its contents (with undef or =())?
  • Where's your benchmark code?
  • Where's your benchmark results? [Sorry, but just saying "%hash = () is slower than undef %hash about 1.2 times" is not sufficient.]

Given all those unknowns, my opinion is that you should consider code like this:

{ my %hash = (...); # operations on %hash here } # %hash doesn't exist here. Does that solve your problem?

Of course, with some answers to those questions, a better response might be forthcoming.

— Ken

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (5)
As of 2019-08-20 12:41 GMT
Find Nodes?
    Voting Booth?

    No recent polls found