Re: avl-trees vs. hashes

[Tel <telford@eng.uts.edu.au>]

> also, my buckets are now true alists (as God intended):
> 
> (list (cons hash1 (cons key1 value1)) (cons hash2 (cons key2 value2)))

Just a suggestion, maybe storing the hash value should be an optional
thing too since it is a fixed speed overhead versus a fixed memory overhead,
there are arguments for both depending on the situation. Ignore this
if it makes your code horribly complicated.

	- Tel