[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
HASH-TABLE-PRINTED-REPRESENTATION
- To: labrea!Dave.Touretzky@CS.CMU.EDU
- Subject: HASH-TABLE-PRINTED-REPRESENTATION
- From: Jon L White <edsel!jonl@labrea.stanford.edu>
- Date: Mon, 23 May 88 15:37:48 PDT
- Cc: cl-cleanup@sail.stanford.edu
- In-reply-to: Dave.Touretzky@B.GP.CS.CMU.EDU's message of Mon, 23 May 88 11:27:58 EDT <361.580404478@DST.BOLTZ.CS.CMU.EDU>
re: One problem with the currently proposed #H notation is that it provides no
way to specify a rehash-size or rehash-threshold. This should not be a
fatal flaw, though. The #() notation is also incomplete: it cannot
indicate whether the vector has a fill pointer, nor can it show when the
element-type is something more specific than T. The latter problem is also
shared by #nA notation.
I think this is a fatal flaw. The fact that *some* complex classes of
arrays also share this fatal flaw is no argument for retaining it. It
is still the case that simple arrays of the more common element types
do not have the flaw; and several years ago there was some discussion
on how to fix other manifestations of the flaw on multi-dimensional arrays.
-- JonL --