Implementing a HashMap in C [closed]

by

Well if you know the basics behind them, it shouldn’t be too hard.

Generally you create an array called “buckets” that contain the key and value, with an optional pointer to create a linked list.

When you access the hash table with a key, you process the key with a custom hash function which will return an integer. You then take the modulus of the result and that is the location of your array index or “bucket”. Then you check the unhashed key with the stored key, and if it matches, then you found the right place.

Otherwise, you’ve had a “collision” and must crawl through the linked list and compare keys until you match. (note some implementations use a binary tree instead of linked list for collisions).

Check out this fast hash table implementation:

https://attractivechaos.wordpress.com/2009/09/29/khash-h/

More Related Contents:

  1. Find the Biggest Number in C, BUT with characters
  2. Recursive and non-recursive traversal of three degree tree
  3. How are multi-dimensional arrays formatted in memory?
  4. How to reverse a singly linked list using only two pointers?
  5. Is using flexible array members in C bad practice?
  6. Quick Way to Implement Dictionary in C
  7. Are there any open source C libraries with common data structures? [closed]
  8. How to understand Locality Sensitive Hashing? [closed]
  9. How do you implement a circular buffer in C?
  10. C – How to implement Set data structure?
  11. Good STL-like library for C [closed]
  12. What is a hash table and how do you make it in C? [closed]
  13. Deleting a middle node from a single linked list when pointer to the previous node is not available
  14. Merging two sorted linked lists
  15. Does C have any tools for doing string addition?
  16. Automated field re-ordering in C structs to avoid padding
  17. Standard data structure library in C? [closed]
  18. what the output of this code and why?
  19. Passing values to macros by for loop
  20. Length of array in function argument
  21. How does one encode a series of images into H264 using the x264 C API?
  22. Segmentation Fault when writing to a string [duplicate]
  23. Using SO_REUSEADDR – What happens to previously open socket?
  24. Why is a point-to-volatile pointer, like “volatile int * p”, useful?
  25. When an int is cast to a short and truncated, how is the new value determined?
  26. Executing code before main()
  27. C initialize array within structure
  28. How does the compare function in qsort work?
  29. Assign string to element in structure in C
  30. Order of fields when using a bit field in C

Leave a Comment