The Joys of Hashing Hash Table Programming with C Edition: 2
Programming
Book Details
Book Title
The Joys of Hashing Hash Table Programming with C Edition: 2
Author
Thomas Mailund
Publisher
Apress
Publication Date
2024
ISBN
9798868808265
Number of Pages
225
Language
English
Format
File Size
5.1MB
Subject
Algorithms and Data Structures
Table of Contents
- About the Author
- About the Technical Reviewer
- Acknowledgments
- Chapter 1: Introduction
- Chapter 2: Hash Keys, Indices, and Collisions
- Mapping from Keys to Indices to Bins
- Hash table operations
- Conclusion
- Chapter 3: Collision Resolution, Load Factor, and Performance
- Chaining
- Open Addressing
- Load and Performance
- Experiments
- Conclusion
- Chapter 4: Resizing
- Amortizing Resizing Costs
- Resizing Chained Hash Tables
- Resizing Open Addressing Hash Tables
- Theoretical Considerations for Choosing the Load Factor
- Experiments
- Resizing When Table Sizes Are Not Powers of Two
- Dynamic Resizing
- Chapter 5: Adding Application Keys and Values
- Generating Hash Sets
- Hash Maps
- Conclusions
- Chapter 6: Heuristic Hash Functions
- What Makes a Good Hash Function?
- Hashing Computer Words
- Hashing Strings of Bytes
- Chapter 7: Universal Hashing
- Uniformly Distributed Keys
- Universal Hashing
- Stronger Universal Families
- Constructing Universal Families
- Re-hashing
- Chapter 8: Conclusions
- Index