| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910338007503321 |
|
|
Autore |
Mailund Thomas |
|
|
Titolo |
The joys of hashing : hash table programming with C / / by Thomas Mailund |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berkeley, CA : , : Apress : , : Imprint : Apress, , 2019 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2019.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XI, 206 p. 72 illus.) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Programming languages (Electronic computers) |
Computer programming |
Programming Languages, Compilers, Interpreters |
Programming Techniques |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references. |
|
|
|
|
|
|
Nota di contenuto |
|
1. The Joys of Hashing -- 2. Hash Keys, Indices and Collisions -- 3. Collision Resolution, Load Factor and Performance -- 4. Resizing -- 5. Adding Application Keys and Valuse -- 6. Heuristic Hash Functions -- 7. Universal Hashing -- 8. Conclusions. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Build working implementations of hash tables, written in the C programming language. This book starts with simple first attempts devoid of collision resolution strategies, and moves through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. Hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations. The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments. You will: Master the basic ideas behind hash tables Carry out collision resolution, including strategies for handling collisions and their consequences for performance Resize or grow and shrink tables as needed Store values |
|
|
|
|
|
|
|
|
|
|
by handling when values must be stored with keys to make general sets and maps. |
|
|
|
|
|
| |