Re: Scheme style auto-resizing hashtable (fwd)

[Jay Glascoe <jglascoe@jay.giss.nasa.gov>]

> Of these three approaches, the iterator approach would be more memory
> efficient, but probably a mess otherwise.

actually, hash->alist would give you a list of pairs.  These pairs would
be the same objects as the pairs in the hash table, so creating the list
wouldn't use up much memory at all.  It's also probably the fastest
approach (you'd only call hash->alist once: BANG! it's done.  whereas with
an iterator, you'd wind up calling it many times (bang!, bang!, bang!...). 

> > Rob Browning <rlb@cs.utexas.edu> PGP=E80E0D04F521A094 532B97F5D64E3930
> > 
> 
> 	Jay
> 	jglascoe@jay.giss.nasa.gov
> 
>