Show HN: A fast, thread-safe C hashmap with lazy sorting
A new C hashmap implementation called ASKL's Map has been benchmarked against several established hash map libraries. The benchmarks focus on performance in various workloads, including insert, update, retrieve, and miss operations. ASKL's Map is designed to be thread-safe and offers features like stable traversal order and lazy sorting.
- ▪ASKL's Map is a fast and thread-safe hashmap implementation in C.
- ▪The benchmark compares ASKL's Map with other libraries like Abseil and Rust's HashMap.
- ▪Performance metrics were gathered using a M2 Max machine across different workloads.
Opening excerpt (first ~120 words) tap to expand
Hashmap benchmark report This benchmark pits my hash map implementation, ASKL's Map, against what I hope is a representative sample of the state of the art: Abseil, written in C++ and SwissTable-based F14 FastMap, written in C++ and optimised for raw speed Rust's standard library HashMap, based on hashbrown M*DICT, a high quality hash map written in C Verstable, Jackson Allan's clever generic hashtable written in C the Python dictionary, which is written in C under the hood khash, probably the most famous C hash map, and its descendant khashl What does ASKL bring to the table? Like all the strong contenders above, it's portable, but it's also thread-safe, comes with an iterator and stable traversal order, and a fun lazy sort feature.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at GitHub.