Re: Down with weak lists!
sperber(a)informatik.uni-tuebingen.de (Michael Sperber [Mr. Preprocessor]) writes:
Because it exposes the internal representation: Since these
procedures are currently the *only* way to get at the list elements,
they need to be fast. This in turn pins down that weak lists pretty
much must be represented as a special header around regular lists.
Not necessarily. You could have an internal data structure along with
a regular list, and update the list lazily as needed.