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

Re^3: lexicals are all the same scalar and never go out of scope?

by Eliya (Vicar)
on Dec 06, 2011 at 10:32 UTC ( #941992=note: print w/ replies, xml ) Need Help??


in reply to Re^2: lexicals are all the same scalar and never go out of scope?
in thread lexicals are all the same scalar and never go out of scope?

By your logic, the following never deallocates the referenced array: ...

This isn't even remotely what I said.  I said the scalar (i.e. the SV, what you call TARG) is the same, and a copy of it is created when a reference to it is pushed onto the array — nothing more.  That's in essence the same you pointed out in your reply.


Comment on Re^3: lexicals are all the same scalar and never go out of scope?
Re^4: lexicals are all the same scalar and never go out of scope?
by ikegami (Pope) on Dec 06, 2011 at 10:44 UTC

    I said the scalar (i.e. the SV, what you call TARG) is the same,

    You also posted a code snippet and its output. With no explanation, the implication is that it supports the accompanying claim. And it does no such thing.

    That's in essence the same you pointed out in your reply.

    Reaching the correct conclusion doesn't make how you reached it correct.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (5)
As of 2014-07-26 18:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (178 votes), past polls