Tests all the kinds of dictionary defined in this package.
RETURN: the number of associations in the DICTIONARY.
DICTIONARY-DELETE (DICTIONARY KEY)
Remove the KEY from the DICTIONARY.
DICTIONARY-GET (DICTIONARY KEY &OPTIONAL DEFAULT)
RETURN: The value associated with the KEY in the DICTIONARY.
DICTIONARY-MAP (FUN DICTIONARY)
Call the function FUN on each KEY VALUE association in the DICTIONARY.
DICTIONARY-SET (DICTIONARY KEY VALUE)
Enter or update the VALUE associated with the KEY into the DICTIONARY.
MAKE-DICTIONARY (TYPE &KEY TEST SIZE CONTENTS (CONTENTS 'NIL) (SIZE 8) (TEST #'EQL))
TYPE: Name of a class implementing the dictionary protocol. TEST: Restricted to EQL, EQUAL or EQUALP when type is HASH-TABLE. CONTENTS: A p-list containing the initial key value pairs.
The The number of elements over which the adaptating DICTIONARY switches to hash-tables, and below which it switches to A-lists.
SETFADAPTATING-DICTIONARY-LIMIT (NEW-VALUE OBJECT)
Set the The number of elements over which the adaptating DICTIONARY switches to hash-tables, and below which it switches to A-lists.
The The data in the dictionary.
SETFDICTIONARY-DATA (NEW-VALUE OBJECT)
Set the The data in the dictionary.
The RETURN: The test function of the dictionary.
A dictionary implemented as an A-list.
A dictionary that changes between an A-list implementation and a hash-table implementation depending on the number of entries.
An abstract Dictionary clas.
A dictionary implemented as a P-list.