This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating the current table once it gets too full.
☆116Dec 30, 2024Updated last year
Alternatives and similar repositories for growt
Users that are interested in growt are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆23Sep 16, 2022Updated 3 years ago
- This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ la…☆15Jan 16, 2024Updated 2 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆44Jun 7, 2026Updated last week
- ☆17Feb 11, 2026Updated 4 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆168Jan 15, 2025Updated last year
- Effective Memory Reclamation☆63Feb 6, 2020Updated 6 years ago
- FOundation of stXXl and thriLL☆14Jan 24, 2024Updated 2 years ago
- Multi-platform topology-aware memory management library☆12Apr 23, 2020Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56May 12, 2017Updated 9 years ago
- Concurrent hash tries for C++ 14 with no memory management whatsoever.☆10Aug 30, 2016Updated 9 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆33Updated this week
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆169Oct 4, 2021Updated 4 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆30Nov 4, 2024Updated last year
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Parallel Balanced Binary Tree Structures☆122Mar 15, 2025Updated last year
- Concurrent data structures in C++☆1,452May 16, 2026Updated 3 weeks ago
- A family of header-only, very fast and memory-friendly hashmap and btree containers.☆3,188Updated this week
- CPAM: Compressed Parallel Augmented Maps☆27Aug 18, 2025Updated 9 months ago
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆11Dec 19, 2022Updated 3 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Mar 10, 2022Updated 4 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆37Jan 15, 2025Updated last year
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆437Mar 12, 2026Updated 3 months ago
- C++11 library for fast fuzzy searching☆15Jun 9, 2015Updated 11 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- REplicated STORagE☆13Mar 23, 2023Updated 3 years ago
- ☆16Feb 19, 2017Updated 9 years ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- Lock-free allocator as described by Maged M. Michael, 2004☆49Sep 13, 2013Updated 12 years ago
- qp tries and crit-bit tries☆124Jul 12, 2022Updated 3 years ago
- Generate pgfplots or gnuplots from embedded SQL statements☆30May 10, 2025Updated last year
- Sample implementation of C++20 atomic_wait/notify☆63Sep 7, 2019Updated 6 years ago
- A high-performance, concurrent hash table☆1,740Apr 25, 2026Updated last month
- ☆54Sep 12, 2022Updated 3 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Dynamic succinct/compressed data structures☆118Dec 17, 2025Updated 5 months ago
- Implementation of the sacabench framework☆19May 15, 2021Updated 5 years ago
- Concurrent Deferred Reference Counting☆173Feb 18, 2024Updated 2 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 5 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆36Jun 8, 2016Updated 10 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Mar 13, 2025Updated last year
- A C++ library providing various concurrent data structures and reclamation schemes.☆645Aug 7, 2025Updated 10 months ago