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
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆43Updated this week
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆134Jan 15, 2025Updated last year
- A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)☆12Apr 24, 2020Updated 6 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.
- ☆17Feb 11, 2026Updated 3 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆167Jan 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
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆33Apr 9, 2026Updated last month
- Concurrent hash tries for C++ 14 with no memory management whatsoever.☆10Aug 30, 2016Updated 9 years ago
- 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
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆30Nov 4, 2024Updated last year
- Parallel Balanced Binary Tree Structures☆122Mar 15, 2025Updated last year
- Concurrent data structures in C++☆1,452May 16, 2026Updated last week
- A family of header-only, very fast and memory-friendly hashmap and btree containers.☆3,184Apr 8, 2026Updated last month
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Sep 22, 2014Updated 11 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☆436Mar 12, 2026Updated 2 months ago
- C++11 library for fast fuzzy searching☆15Jun 9, 2015Updated 10 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- 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☆125Jul 12, 2022Updated 3 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- Sample implementation of C++20 atomic_wait/notify☆63Sep 7, 2019Updated 6 years ago
- A high-performance, concurrent hash table☆1,739Apr 25, 2026Updated last month
- ☆53Sep 12, 2022Updated 3 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Implementation of the sacabench framework☆19May 15, 2021Updated 5 years ago
- ☆15May 23, 2024Updated 2 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 4 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆132Aug 3, 2023Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆36Jun 8, 2016Updated 9 years ago
- A parallel, pipelined query execution engine for multi-socket, multi-core systems with large main memories.☆17Feb 10, 2014Updated 12 years ago