Weak Datastructures

This talk explains the benefits and drawbacks of weak references. It generalizes the data types of weak pointer, weak list and weak hash-table. It explains how to implement these data types correctly and efficiently.

View now or get OpenOffice 1.0.2 presentation or get printable presentation. (18 slides)

Writeup (8 pages)

This talk was held at the European Common Lisp Meeting on 24 April 2005.

Weak Datastructures
Bruno Haible <bruno@clisp.org>

Last modified: 28 April 2005.