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.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | GitHub |
| Canonical URL | https://github.com/RaphaelPrevost/hashmap-benchmark |
| Publication time | Wed, 20 May 2026 12:54:46 +0000 |
| Retrieval time | 2026-05-20T13:05:02.450Z |
| Last seen | 2026-05-20T13:05:02.450Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | d_VUEHdxqy4V |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
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.