Re^5: 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

Replies are listed 'Best First'.
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).	[reply] [d/l] [select]