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

Re^5: How do you find keys of a Blessed Hash?

by moritz (Cardinal)
on Oct 08, 2012 at 05:44 UTC ( #997742=note: print w/ replies, xml ) Need Help??


in reply to Re^4: How do you find keys of a Blessed Hash?
in thread How do you find keys of a Blessed Hash?

To the best of my knowledge, //, say and state work as designed, and the design is sound. (The first two are my favorite features from 5.010).

Also it makes you appreciate how hard programming language design is.


Comment on Re^5: How do you find keys of a Blessed Hash?
Download Code
Re^6: How do you find keys of a Blessed Hash?
by james2vegas (Chaplain) on Oct 08, 2012 at 07:16 UTC
    Sure, those work fine, but aren't really new work, just syntactic sugar over $x = defined($x) ? $x : $value, a local $\ = "\n" (and print), and a function closed over a variable declared in an outer lexical scope (this is actually superior to the sugar, since you can have multiple functions sharing the same variable).

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (6)
As of 2014-12-25 21:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (163 votes), past polls