Common Lisp the Language, 2nd Edition

next up previous contents index
Next: Readtables Up: Data Types Previous: Bit-Vectors

2.6. Hash Tables

Hash tables provide an efficient way of mapping any Lisp object (a key) to an associated object. They are provided as primitives of Common Lisp because some implementations may need to use internal storage management strategies that would make it very difficult for the user to implement hash tables in a portable fashion. Hash tables are described in chapter 16.