Integer Map Data Structure
This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).
Integer Map Data Structure launched on January 25, 2024 with 91 votes, #705 of 4,438 launches that month and more than 90% of that year's launches. The site was still online in September 2026, 2 years on.
In plain words
Integer Map Data Structure is a new data structure for storing ordered integer maps. Built as a compressive, cache-friendly radix tree, it offers performance comparable to unordered maps while being substantially faster than ordered maps. The project targets developers needing efficient integer-to-value mappings with maintained ordering, available on GitHub.
written from the facts on this page · September 2026
From the sources
Integer Map Data Structure. Contribute to billziss-gh/imap development by creating an account on GitHub.
Does a similar job
all alternatives →
A hash array-mapped trie implementation in C2023 · github.com · ▲171Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…
- OAOrdered – A sorted collection library for ZigOct 2025 · ▲21
I made an early version of a sorted collection library for Zig. Sorted collections are data structures that maintain the data in sorted order. Examples of these data structures are `java.util.TreeMap` in Java and `std::map` in C++. These data structures are mainly used for fast lookups (point search) and fast range searches. The library is available on GitHub: https://github.com/CogitatorTech/ordered
A portable hash map in C2024 · github.com · ▲176A small, portable, linear probing hash map. Contribute to e-dant/salmagundi development by creating an account on GitHub.
Glidesort, a new stable sort in Rust up to ~4x faster for random data2023 · github.com · ▲389Hi all, I've talked about glidesort a few times on HN already, but it's finally ready for release. If you have any questions, feel free to ask. An academic paper on glidesort that goes into a lot more detail than the readme is upcoming, but is not ready yet. I will be giving a talk on glidesort tomorrow at FOSDEM 2023 in the Rust Devroom at 16:10, you can seek me out there as well. In other news, I am leaving academia soon, so if you have interesting (Rust) jobs the coming months feel free to approach me.
- AS
A concurrent thread-safe hash map implemented in C++2017 · github.com · ▲17A concurrent thread-safe hash map implemented in C++ - kshk123/hashMap
More work this month
the category →
Endless lofi beats composed live in your browser, over pixel-art nights in Paris, Tokyo, New York, Hong Kong, Sydney, San Francisco and more. Free, no sign-up.
Work · 24d ago · loficities.com
Smooth Recorder▲257Mac screen recordings that look edited when you hit stop
Work · 18d ago · smoothrecorder.com
Work · 12d ago · readrare.com
Source: Show HN post ↗
Launched alongside, January 2024
the whole month →
Amie▲1,334Turn meeting notes into automated workflows. Handle meetings, summaries, todos and emails (soon) with your AI personal assistant.
Work · 2024 · amie.so
- IM
Sit in Shade - Discover the optimal seat to stay in the shade during your journey. Sit In Shade provides real-time sun exposure data and route visualization.
Life & fun · 2024 · sitinshade.com
