Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: A different OO approach

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


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

++ That is very nice. I didn't realise that you could use my and \() like that. Learn something new every day!

The only pain is that you have to remember to do:

my @A = \my %Foo;

not

my @A = \my (%Foo);

... which could lead to some nasty buggettes if you're not careful.


Comment on Re^3: A different OO approach
Select or Download Code
Replies are listed 'Best First'.
Re^4: A different OO approach
by Aristotle (Chancellor) on Dec 15, 2002 at 03:32 UTC
    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.

      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://219949]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (10)
As of 2015-07-29 17:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (266 votes), past polls