Re: Memory leak on definition of anonymous code?

Yes, we're still waiting to find out whether Perl6 will get real garbage collection that would fix this, or have the same reference counting that Perl5 has.

$;=sub{$/};@;=map{my($a,$b)=($_,$;);$;=sub{$a.$b->()}}
split//,".rekcah lreP rehtona tsuJ";$\=$ ;->();print$/
[download]

Comment on Re: Memory leak on definition of anonymous code? Download Code

Replies are listed 'Best First'.
Re: Re: Memory leak on definition of anonymous code? by sandfly (Beadle) on Oct 06, 2003 at 20:46 UTC
I believe the issue has been decided - Perl 6 will have real GC.	[reply]
Re: Memory leak on definition of anonymous code? by jonadab (Parson) on Oct 06, 2003 at 20:49 UTC
I believe the issue has been decided - Perl 6 will have real GC. Really? Cooool. `$;=sub{$/};@;=map{my($a,$b)=($_,$;);$;=sub{$a.$b->()}} split//,".rekcah lreP rehtona tsuJ";$\=$ ;->();print$/` [download]	[reply] [d/l]
Re^2: Memory leak on definition of anonymous code? by Aristotle (Chancellor) on Oct 07, 2003 at 06:57 UTC
Yes it will, courtesy of the Parrot VM it will run on, which (AFAIK) uses a mark and sweep type GC. Makeshifts last the longest.	[reply]
Re: Mark-and-sweep in Parrot by jonadab (Parson) on Oct 07, 2003 at 12:57 UTC
`[`Thinks about this answer for a brief moment.] So, if the GC is built into Parrot... does that mean Ponie will get it too? `$;=sub{$/};@;=map{my($a,$b)=($_,$;);$;=sub{$a.$b->()}} split//,".rekcah lreP rehtona tsuJ";$\=$ ;->();print$/` [download]	[reply] [d/l] [select]
Re: Re: Memory leak on definition of anonymous code? by Elian (Parson) on Oct 07, 2003 at 15:04 UTC
No we're not. The decision's been made for years... No refcounting for perl 6.	[reply]


Don't ask to ask, just ask
	PerlMonks