© Vsevolod Domkin 2021
V. DomkinProgramming Algorithms in Lisphttps://doi.org/10.1007/978-1-4842-6428-7_8

8. Hash-Tables

Vsevolod Domkin1  
(1)
Kyiv, Ukraine
 
../images/502489_1_En_8_Chapter/502489_1_En_8_Figa_HTML.png

Now, we can move on to studying advanced data structures which are built on top of the basic ones such as arrays and lists, but may exhibit distinct properties and have different use cases and special algorithms. Many of them will combine the basic data structures to obtain new properties not accessible to the underlying structures. The first and most important of these advanced structures is, undoubtedly, the hash-table. However vast is the list of candidates to serve as key-values, hash-tables ...

Get Programming Algorithms in Lisp: Writing Efficient Programs with Examples in ANSI Common Lisp now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.