[r6rs-discuss] Hash function return value constraints

[leppie]

----- Original Message ----- 
From: "Brian Harvey" <bh at eecs.berkeley.edu>

> Okay, I'm confused,  A hash value is an index into an array.  If the
> hash value doesn't fit in a fixnum, then the array doesn't fit in memory,
> or even in the virtual address space (by a factor of 4 on a 32-bit 
> machine).
> What am I missing here?


Something other than the most extreme naive implementation of a hashtable, 
ever.  :)

It's up to the implementation to choose how it converts the hash value into 
a meaningful index (or perhaps something else).

Cheers

leppie