Related articles |
---|
[23 earlier articles] |
Re: Best Ref-counting algorithms? cppljevans@gmail.com (Larry) (2009-07-17) |
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-17) |
Re: Best Ref-counting algorithms? gah@ugcs.caltech.edu (glen herrmannsfeldt) (2009-07-17) |
Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-17) |
Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-17) |
Re: Best Ref-counting algorithms? DrDiettrich1@aol.com (Hans-Peter Diettrich) (2009-07-18) |
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-18) |
Re: Best Ref-counting algorithms? gah@ugcs.caltech.edu (glen herrmannsfeldt) (2009-07-18) |
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-18) |
Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-21) |
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-22) |
Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-25) |
Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-27) |
[4 later articles] |
From: | =?ISO-8859-1?Q?Christoffer_Lern=F6?= <lerno@dragonascendant.com> |
Newsgroups: | comp.compilers |
Date: | Sat, 18 Jul 2009 00:12:34 -0700 (PDT) |
Organization: | Compilers Central |
References: | 09-07-018 09-07-039 09-07-043 09-07-059 |
Keywords: | GC |
Posted-Date: | 18 Jul 2009 08:08:12 EDT |
> > I implemented the simple non-concurrent version of the algorithm as
> > described in Bacon's paper and I did not find it all that complex, the
> > concurrent version is naturally more involved though.
>
> How did you implement the children function in figure 2 on page 6 of
> the Bacon 2001 article available at:
>
> http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.132.2464&rep...
> pe=url&i=0
>
> ? More specifically, how would you calculate children for:
>
> boost::fusion::vector<T1,T2,.., Tn>
As I wrote elsewhere, this is for a new language, so for this case it
is simply a matter of going through all member variables of the
object. Arrays/MutableArrays are built-in objects where implementation
will assure that all entries in the array behave as member variables
in this regard.
/C
Return to the
comp.compilers page.
Search the
comp.compilers archives again.