Re: Scheme style auto-resizing hashtable

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

On 26 Oct 1998, Harvey J. Stein wrote:

> I did a very rough comparison of Guile's hash tables vs STk's
> hash tables.  Of course, they're hard to compare because STk & guile
> are different interpreters.  But, the hash table insertion timings are
> different enough & the overhead timings are close enough that it seems
> that STk's hash tables are faster than Guile's (on the order of 20%
> faster when computing runtime-overhead, and on the order of 50% when
> doing runtime-gc-overhead, assuming (gc-run-time) returns time in
> milliseconds).
> 

what do the STk hash tables look like?  Are they vectors and pairs 
of basic Scheme types or are they opaque and implemented as C structures?
Can you write procedures in Scheme to operate on the internals of the hash
table?  Can you "read" and "write" them to/from a file?

> -- 
> Harvey J. Stein
> BFM Financial Research
> hjstein@bfr.co.il
> 

	Jay
	jglascoe@jay.giss.nasa.gov