[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Issue: HASH-TABLE-ACCESS (version 1)
- To: firstname.lastname@example.org
- Subject: Issue: HASH-TABLE-ACCESS (version 1)
- From: vanroggen%aitg.DEC@decwrl.dec.com
- Date: Tue, 13 Sep 88 12:30:52 PDT
References: hash-tables (Chapter 21 of CLtL)
Edit History: 13-Sept-88, version 1 by Walter van Roggen
There are many characteristics of hash-tables which are specified upon
creation but are not accessible afterwards.
Add the following functions to the language:
Returns the current rehash size of a hash table.
Returns the current rehash threshold of a hash table.
Returns the current size of a hash table.
Returns the test used for comparing keys in the hash table.
By default the value will be either EQL or #'EQL.
VAX LISP implements the proposal.
Cost to Implementors:
Most of these should be trivial to implement, since the information
must be present for nearly all types.
Cost to Users:
None. This is an upward-compatible extension.
Cost of Non-Adoption:
The benefits would not be available in a portable fashion.
Programs would be able to access useful information otherwise hidden.
For example, it would allow programs to gain statistics about hash
table usage that might enable better tuning.
None of these are required to be SETF'able, though that might be
a reasonable implementation-dependent extension.
This first appeared in ">GLS>clarifications.text" of 12/06/85.