[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
visible hash tables
- To: barmar@think.com
- Subject: visible hash tables
- From: Jon L White <edsel!jonl@labrea.stanford.edu>
- Date: Tue, 17 May 88 22:53:07 PDT
- Cc: MLY@ai.ai.mit.edu, Dave.Touretzky@c.cs.cmu.edu, common-lisp@sail.stanford.edu
- In-reply-to: Barry Margolin's message of Tue, 17 May 88 11:58 EDT <19880517155802.0.BARMAR@OCCAM.THINK.COM>
re: That's not an unprecedented flaw. Arrays have a number of properties
that are not represented in their printed representations, such as
adjustability, fill pointer, and element type.
Not all arrays have these properties; contrast that with all hashtables
having the rehash-size and rehash-threshold slots.
I think my message did address the question about arrays, in the first
paragraph, when enumerating the types that don't have adequate print
representations and for which MLY's suggestion might be a solution:
". . . and non-simple ARRAY and ARRAY with specialized element-type
not among {'bit', 'string-char', 'T'}."
-- JonL --