Following google SoC and TODO item,
https://rt.perl.org/rt3//Ticket/Display.html?id=33922, here is the
scheme proposal for a new parrot GC (many thanks to leo for his help).
=
In order to allow more powerful GC schemes, we need to be
Sorry for answering so late...
On 6/8/05, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> jerry gay wrote:
> > i'm no gc expert, but here's my comments after discussions with
> > alexandre on #parrot.
> >
> > On 6/8/05, Alexandre Buisse <[EMAIL PROTECTED
On 7/25/05, Bob Rogers <[EMAIL PROTECTED]> wrote:
> I'm still digesting it (and trying to bone up on GC algorithms at the
> same time), but it does sound like it should work. I assume that
> "forall (p -> q)" above really means "forall (q0 -> q where q0 == p)",
> i.e. process all IGP entries from
On 9/2/05, Nattfodd <[EMAIL PROTECTED]> wrote:
>
> ...but it should be fine as
> long as you define GMC_GC_RUN (at least to see if it can run correctly
> miniparrot)...
err, it was GMC_NO_GC_RUN, of course.
Now I'll really use some sleep :)
