[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Hash Tables and GC

To: goldman@vaxa.isi.edu
Subject: Re: Hash Tables and GC
From: Gregor.pa@Xerox.COM
Date: Tue, 6 Sep 88 19:50 PDT
Cc: COMMON-LISP@sail.stanford.edu, jeff%aiai.edinburgh.ac.uk@nss.cs.ucl.ac.uk
Fcc: BD:>Gregor>mail>outgoing-mail-4.text.newest
In-reply-to: <8809070108.AA13965@vaxa.isi.edu>
Line-fold: no

As I understand it, finalization is a mechanism for recording a function
which the garbage collector should call on an object when it is about to
be GC'd.

I find it surprising that no one has talked about finalization during
this discussion.  This may not be facility we want to add to Common
Lisp, but as near as I can tell, weak pointers and finalization are the
primitives you need to build these kind of hash tables.

In addition, finalization is a useful mechanism to have direct access
to.
-------

Follow-Ups:
- Re: Hash Tables and GC
  - From: Michael Greenwald <Greenwald@STONY-BROOK.SCRC.Symbolics.COM>
- Re: Hash Tables and GC
  - From: David L. Andre <DLA@JASPER.SCRC.Symbolics.COM>

References:
- Hash Tables and GC
  - From: goldman@vaxa.isi.edu

Prev by Date: Hash Tables and GC
Next by Date: Implementing :TEMPORARY hash tables at the Lisp level?
Previous by thread: Hash Tables and GC
Next by thread: Re: Hash Tables and GC
Index(es):
- Date
- Thread