Newsgroups: alt.lang.design,comp.lang.c,comp.lang.c++,comp.lang.lisp,zer.z-netz.sprachen.algorithmen
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!swrinde!pipex!uunet!allegra!alice!ark
From: ark@research.att.com (Andrew Koenig)
Subject: Re: Reference Counting (was Re: Searching Method for Incremental Garbage Collection)
Message-ID: <CzoE9n.3oM@research.att.com>
Organization: Software Engineering Research Department
References: <CzHCvp.9rM@rheged.dircon.co.uk> <TFB.94Nov21091959@burns.cogsci.ed.ac.uk> <1994Nov21.181455.13457@isis.muc.de>
Date: Tue, 22 Nov 1994 15:41:47 GMT
Lines: 14
Xref: glinda.oz.cs.cmu.edu comp.lang.c:117493 comp.lang.c++:99893 comp.lang.lisp:15744

In article <1994Nov21.181455.13457@isis.muc.de> Mike.Chapman@muc.de (Mike Chapman) writes:

> Almost any non trivial structure in the real world, 
> if you are actually going to do anything with it,
> needs back pointers (simple example - doubly linked lists) 
> or pointers to parents (simple example - almost any tree structure)
> or whatever.

Sure, but such pointers do not prevent reference counting from working.


-- 
				--Andrew Koenig
				  ark@research.att.com
