© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2022
R. WienerGeneric Data Structures and Algorithms in Gohttps://doi.org/10.1007/978-1-4842-8191-8_7

7. Hash Tables

Richard Wiener1  
Colorado Springs, CO, USA

In the previous chapter, we introduced queues and lists. We presented several specialized types of queues and their applications.

A map is a function that converts (maps) some key to a value in a key-value pair. The key and value may be of any type. A hash table is an unordered collection of key-value pairs where each key is distinct (no duplicate keys). Values are not required to be distinct, so two or more keys may map to the same value. Hash tables support very fast access to information accessed through ...

Get Generic Data Structures and Algorithms in Go: An Applied Approach Using Concurrency, Genericity and Heuristics 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.