Hash Keys, Indices, and Collisions

  • Thomas Mailund


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 the chapter, you cannot easily compile them from the book, but you can download the complete code listings from .

Copyright information

© Thomas Mailund 2019

Authors and Affiliations

  • Thomas Mailund
    • 1
  1. 1.Aarhus NDenmark

Personalised recommendations