© Thomas Mailund 2019
Thomas MailundThe Joys of Hashinghttps://doi.org/10.1007/978-1-4842-4066-3_2

2. Hash Keys, Indices, and Collisions

Thomas Mailund1 
(1)
Aarhus N, Denmark
 

As mentioned in the introduction, this book is primarily about implementing hash tables and not hash functions. So to simplify the exposition, assume that the data values stored in tables are identical to the hash keys. In Chapter 5, you will address which changes you have to make to store application data together with keys, but for most of the theory of hash tables you only need to consider hash keys; everywhere else, you will view additional data as black box data and just store their keys. While the code snippets below cover all that you need to implement the concepts in ...

Get The Joys of Hashing: Hash Table Programming with C 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.