Boost logo

Boost :

From: Philippe A. Bouchard (philippeb_at_[hidden])
Date: 2003-11-20 01:10:12


Hurd, Matthew wrote:

[...]

>> How could you get rid of cyclic references instantly?
>
> Larry,
>
> Just a small point... You've quoted it so it looks a little like I
> wrote
> this... I didn't. I too would like to see such code. In my head it
> seems like detecting cycles in a directed graph. Not sure how
> efficient
> this is can be...
>
> Philippe?

I like Larry's solution... Their functionnality are similar though
(proxies, containers, proxy_descriptor, etc.). Maybe an abstraction could
be made to highlight the common classes.

Mine require 2 counters to handle for each smart pointer but you won't need
any graph (it is mixed with the pointer... no extra allocation). But I need
to figure out multithread issues before going further. I can drop in an
example as well as a reference counter maximized for Gcc + Intel (if Boost
would accept -- I could handle its maintenance).

Philippe


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk