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

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

by ikegami (Pope)
on Dec 06, 2011 at 10:43 UTC ( #941995=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?

So why does perl make copies instead of real references when you think your making a reference?

$s = $x . $y;

Wouldn't it be nice if concat didn't have to allocate a scalar that will just end up being copied into $s and deallocated?

Well guess what, it doesn't. That instance of the concat operator will always return the same scalar. This saves allocating a scalar and deallocating a scalar.

But of course, doing that alone would break weird code like following:

my @b = map { \($prefix.$_) } @a;

So the deref operator must be complicit and make a copy of the scalar if it comes from concat.

Why doesn't entersub clone PADTMPs into unique mortal SVs if PADTMPs are found on the stack automatically

Cause that defies the whole point of avoiding the creation of those scalars.

Shouldn't making a ref in XS be identical to making a ref in Perl?

Sure, but it's not Perl's fault your XS code isn't identical to its code.

Should there be a function for creating references that checks PADTMP? Maybe. Yes, p5p would be appropriate for this.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://941995]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (5)
As of 2018-06-22 06:36 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (122 votes). Check out past polls.