Hash tables

[barmar@Think.COM (Barry Margolin)]

    Date: Wed, 1 Aug 90 08:05 CDT
    From: lgm@iexist.att.com

	Date: Tue, 31 Jul 90 13:21 EDT
	From: Barry Margolin <barmar@Think.COM>

	Since non-EQ structures can never be EQUAL or EQUALP, there's no reason
	the hash table implementation should hash on the structure contents.

    I thought that the eventual decision of X3J13 was that distinct
    DEFSTRUCT structures were indeed EQUALP if their corresponding slots
    were EQUALP.  This is the definition on page 109 of CLtL/2e, anyway.

Yeah, I was looking on p.108, where it says that it doesn't descend
structures.  P.109 is correct.  I've corrected my copy so that I won't
make this mistake in the past.

But my point is still correct for EQUAL hash tables.

                                                barmar