TooBiased / growt
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.
☆107Updated 8 months ago
Related projects ⓘ
Alternatives and complementary repositories for growt
- EDSL for C++ to make just-in-time code generation easier☆82Updated last year
- The Berkeley Container Library☆120Updated last year
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆263Updated 10 months ago
- The world's first wait-free Software Transactional Memory☆169Updated 4 years ago
- Parallel Balanced Binary Tree Structures☆111Updated 2 weeks ago
- Comprehensive benchmarks of C++ maps☆300Updated last year
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated last year
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆246Updated 2 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆116Updated 5 years ago
- High-performance multicore-scalable data structures and benchmarks☆138Updated 5 years ago
- UME::SIMD A library for explicit simd vectorization.☆90Updated 6 years ago
- Persistent memory allocator for data-centric analytics☆53Updated last week
- A modern interface for implementing bulk-synchronous parallel programs.☆93Updated last year
- ☆104Updated 9 months ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆29Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago
- ☆17Updated 7 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆400Updated 2 months ago
- Template Vector Library☆18Updated 3 years ago
- A fast SIMD parser for CSV files☆146Updated 2 years ago
- C++ micro benchmark library☆88Updated 7 years ago
- An open addressing linear probing hash table, tuned for delete heavy workloads☆200Updated last year
- A fast and highly scalable GPU dynamic memory allocator☆103Updated 9 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 6 years ago
- Concurrent Deferred Reference Counting☆149Updated 9 months ago
- C++ implementation of a memory efficient hash map and hash set☆335Updated last month
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆114Updated 6 months ago
- ☆20Updated 3 years ago
- A STL allocator that mmaps files☆242Updated 3 years ago