dyb at cs.indiana.edu writes:
> The efficiency issue arises because some collectors move objects,
> so any hash code derived from the pointer changes over time. In user
> land, this means that some less efficient hashing algorithm must
> be used, e.g., one based on the structure of the object. In system
> land, the gc and hash table mechanism can cooperate to keep the hash
> table up to date when objects move.
Thanks for explaining this!
If I may ask with an eye towards our own implementation: In a
generational (or otherwise incremental) GC how do you keep track of
what objects that are moved occur in an eq? hash table and thus may
need rehashing there?
--
Cheers =8-} Mike
Friede, Völkerverständigung und überhaupt blabla