[plt-scheme] Effect of caching using hash-tables vs vectors

From: Daniel Yoo (dyoo at cs.wpi.edu)
Date: Sun Mar 18 19:20:57 EDT 2007

On Sun, 18 Mar 2007, Eli Barzilay wrote:

> On Mar 18, jos koot wrote:
>> Hi Eli,
>> I am interested in how you solved the problem using a vector while
>> not knowing beforehand the maximum number that will be generated
>> while cycling.
> My code does not use vectors...  (But a standard approach is to wrap 
> vector access by a layer that copies the vector to one that is twice the 
> size whenever a larger index is used.)

For example, the 'evector' library in PLaneT does this:


Posted on the users mailing list.