Chapter 6: Hash Tables, Maps, and Sets

Edmund Weitz · Apress eBooks · 2016

As stated in the introduction to Chapter 5 , lists aren’t the only data structure in Common Lisp . In addition to arrays, the standard also offers hash tables which are data structures that map keys to values by means of a hash function . Ideally, the cost of hash table lookups, as well as insertions or deletions of new entries, is independent of the number of elements stored in the table (although, see Recipe 6-5 ), which makes them a powerful alternative to other ways of organizing data. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Read the paper · More papers on PaperTik