Subject: Re: Speed, Faster... Faster... Slower?
From: Erik Naggum <>
Date: 2000/01/18
Newsgroups: comp.lang.lisp
Message-ID: <>

* Tony <>
| Some of the data is contained in simple-vectors, other bits
| in arrays, within the structures, but the use of arrays is
| wastefull in this situation as the ultimate size is unknown.

  well, you _could_ use adjustable vectors with fill pointers if such is
  your concern.  Common Lisp knows that the tradeoff that people made with
  lists carried a performance penalty.  look at VECTOR-PUSH and VECTOR-POP
  for ways to deal with unknown sizes and still get O(1) access times.