لذت‌های هش: برنامه‌نویسی جدول هش با C

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 Collision risk Conclusion Chapter 3: Collision Resolution, Load Factor, and Performance Chaining Linked Lists Chained Hashing Collision Resolution Open Addressing Probing Strategies Load and Performance Theoretical Runtime Performance Chained Hashing Open Addressing Hashing 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 Generic Lists Generating a Hash Set Hash Maps Key and Value Types Hash Map Definition Creating and Resizing a Table Freeing Tables Lookup Adding and Deleting Conclusions Chapter 6: Heuristic Hash Functions What Makes a Good Hash Function? Hashing Computer Words Additive Hashing Rotating Hashing One-at-a-Time Hashing Jenkins Hashing Hashing Strings of Bytes Chapter 7: Universal Hashing Uniformly Distributed Keys Universal Hashing Stronger Universal Families Binning Hash Keys Collision Resolution Strategies Constructing Universal Families Nearly Universal Families Polynomial Construction for k-Independent Families Tabulation Hashing Performance Comparison Re-hashing Chapter 8: Conclusions Index df-0.jpg