Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^4: A different OO approach

by Aristotle (Chancellor)
on Dec 15, 2002 at 03:32 UTC ( #219953=note: print w/ replies, xml ) Need Help??


in reply to Re^3: A different OO approach
in thread A different OO approach

Odd. I didn't even notice. I'm not sure I understand - I shuffled parens around but there's no difference. This is funny and sort of embarrassing.. what am I missing?

Makeshifts last the longest.


Comment on Re^4: A different OO approach
Re^5: A different OO approach
by adrianh (Chancellor) on Dec 15, 2002 at 03:37 UTC

    A single hash is a special case with \(). From perlref.

    As a special case, "\(@foo)" returns a list of refer- ences to the contents of @foo, not a reference to @foo itself. Likewise for %foo, except that the key refer- ences are to copies (since the keys are just strings rather than full-fledged scalars).

    Annoying eh?

      Wow, ya learn something new every day. Yes, annoying indeed. Ugh.

      Makeshifts last the longest.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (8)
As of 2014-12-29 15:24 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

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





    Results (192 votes), past polls