"Robert P. Goldman" <[EMAIL PROTECTED]> writes:
> Specifically, hash tables are defined to test on eq, eql, equal or
> equalp. But none of these do deep equality on CLOS objects, and none of
> them are generic functions?
"Deep equality" may not be a well-defined concept. See, for example,
Kent Pitman's discussion of EQUAL (and a generic COPY) at
http://world.std.com/~pitman/PS/EQUAL.html
The summary: equality is application-defined. You can't tell from the
representation how deep you need to go.
> What should one do if one wishes to make a hash table of objects is CMUCL?
> So how do you all do table lookup for CLOS objects?
I've got a copy of some "fast, deep" EQUALP code written in 2000 by
William Harold Newman <william.newman@@airmail.net>
Not sure whether that made it into the main CMUCL branch or not.
You might want to contact him and ask for more details.
-- Don
_______________________________________________________________________________
Don Geddis http://don.geddis.org [EMAIL PROTECTED]
When I was a child, there were times when we had to entertain ourselves. And
usually the best way to do that was to turn on the TV.
-- Deep Thoughts, by Jack Handey [1999]
