Work · alternatives · 2026
24 alternatives to 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 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… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Integer Map Data Structure launched in 2024; newer entries below may have overtaken it.
- 1
Long-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…
2023 · github.com · its alternatives →
- 2OA
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
Oct 2025 · its alternatives →
- 3
A small, portable, linear probing hash map. Contribute to e-dant/salmagundi development by creating an account on GitHub.
2024 · github.com · its alternatives →
- 4
Hi 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.
2023 · github.com · its alternatives →
- 5AS
- 6
A concurrent thread-safe hash map implemented in C++ - kshk123/hashMap
2017 · github.com · its alternatives →
- 7
📶 A lock- and wait-free hashtable (and an array too) - mulle-concurrent/mulle-concurrent
2016 · github.com · its alternatives →
- 8
A header only C++11 LRU Cache template class that allows you to define key, value and optionally the Map type. uses a double linked list and a std::unordered_map style container to provide fast insert, delete and update No dependencies other than the C++ standard library. This is a C++11 remake of m
2016 · github.com · its alternatives →
- 9
A fast, multi-threaded Redis® and Valkey alternative written in Rust: drop-in compatible, with full-text and vector search built in - kividbio/kividb
2d ago · github.com · its alternatives →
- 10
A container for dataclasses with multi-indexing and bulk operations. - joshlk/dataclassframe
2020 · github.com · its alternatives →
- 11
C++14: bringing in those expressions that you wish you had, Lazily evaluated, compossible generators, maps, filters, ranges and more... - GitHub - SaadAttieh/lazyCode: C++14: bringing in those expressions that you wish you had, Lazily evaluated, compossible generators, maps, filters, ranges and more
2018 · github.com · its alternatives →
- 12
Learn Go (Golang) by writing real code in this interactive course. Practice structs, interfaces, errors, concurrency, and idiomatic backend patterns.
2020 · qvault.io · its alternatives →
- 13
A guide to functional programming
2016 · amazon.com · its alternatives →
- 14
I started writing this book 10 years ago in JavaScript, got through a few chapters (asymptotic notation, basic techniques, start of sorting), and then abandoned it. Recently I picked it back up, converted everything to TypeScript, and used AI (Zenflow [1] + Claude Opus 4.6) to complete the remaining chapters. I provided the structure, direction, and initial chapters; the AI generated the bulk of the remaining content under a spec-driven workflow. The book covers roughly a first 1-2 year CS curriculum: sorting, dynamic programming, graph algorithms, trees, heaps, hash tables, and more. All…
Mar 2026 · amoilanen.github.io · its alternatives →
- 15
I believe the best way to learn a language is by doing an in-depth project. This is my first Zig project intended for learning the ropes on publishing a Zig package. It turns out to be quite solid and performant. It might be a bit over-engineered. This little library is packed with the following features: - Building dependency graph from dependency data. - Performing topological sort on the dependency graph. - Generating dependence-free subsets for parallel processing. - Cycle detection and cycle reporting.
2025 · github.com · its alternatives →
- 16
Properties of a Novel Binary Representation of Integers using Base-𝜙 - irradix/paper.md at main · DOSAYGO-STUDIO/irradix
2024 · github.com · its alternatives →
- 17AG
This is a vector index I built that supports insertion and k-nearest neighbors (k-NN) querying, optimized for GPUs. It operates entirely in CUDA and can process queries on half a billion vectors in under 200 milliseconds. The codebase is structured as a standalone library with an HTTP API for remote access. It’s intended for high-performance search tasks—think similarity search, AI model retrieval, or reinforcement learning replay buffers. The codebase is located at https://github.com/rodlaf/BinaryGPUIndex.
2025 · rlafuente.com · its alternatives →
- 18
Hypergraph is a data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices. - yamafaktory/hypergraph
2021 · github.com · its alternatives →
- 19
Fast SIMD sorting routines for int and float arrays - zvrba/SortingNetworks
2021 · github.com · its alternatives →
- 20
A simple GPU hash table implemented in CUDA using lock free techniques - nosferalatu/SimpleGPUHashTable
2020 · github.com · its alternatives →
- 21
Mmap radix sort file by a fixed length prefix of each line - afiodorov/radixmmap
2020 · github.com · its alternatives →
- 22
A very fast scalar implementation for Frame Of Reference integer compression. - cruppstahl/libfor
2015 · github.com · its alternatives →
- 23
A multi-threaded, TCP, key-value store inspired by Redis implemented in Haskell. - honza/redish
2013 · github.com · its alternatives →
- 24
Hi HN! I've built [CXXStateTree](https://github.com/ZigRazor/CXXStateTree), a modern C++ header-only library to create hierarchical state machines with clean, intuitive APIs. It supports: - Deeply nested states - Entry/exit handlers - State transitions with guards and actions - Asynchronous transitions with `co_await` (C++20 coroutines) - Optional runtime type identification for flexibility It's ideal for complex control logic, embedded systems, games, robotics, and anywhere you'd use a finite state machine. I’d love feedback, use cases, or contributions from the…
2025 · github.com · its alternatives →
Also compare
- A hash array-mapped trie implementation in C alternatives
- Ordered – A sorted collection library for Zig alternatives
- A portable hash map in C alternatives
- Glidesort, a new stable sort in Rust up to ~4x faster for random data alternatives
- A Simple GPU Hash Table alternatives
- A concurrent thread-safe hash map implemented in C++ alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →