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.
☆106Updated 6 months ago
Related projects: ⓘ
- The Berkeley Container Library☆120Updated last year
- Fast Approximate Membership Filters (C++)☆258Updated 8 months ago
- EDSL for C++ to make just-in-time code generation easier☆79Updated last year
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆212Updated 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
- High-performance multicore-scalable data structures and benchmarks☆135Updated 5 years ago
- The world's first wait-free Software Transactional Memory☆168Updated 4 years ago
- Parallel Balanced Binary Tree Structures☆110Updated 7 months ago
- Comprehensive benchmarks of C++ maps☆296Updated last year
- Template Vector Library☆18Updated 3 years ago
- ☆43Updated 3 years ago
- Persistent memory allocator for data-centric analytics☆53Updated last week
- UME::SIMD A library for explicit simd vectorization.☆90Updated 6 years ago
- Concurrent Deferred Reference Counting☆145Updated 7 months ago
- ☆104Updated 7 months ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆243Updated 2 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆114Updated 4 months ago
- Library for lock-free locks☆72Updated last year
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆308Updated 4 months ago
- A modern interface for implementing bulk-synchronous parallel programs.☆93Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆116Updated 4 years ago
- AVX512F and AVX2 versions of quick sort☆102Updated 6 years ago
- A fast SIMD parser for CSV files☆143Updated 2 years ago
- ☆125Updated last year
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆395Updated 3 weeks ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆176Updated 6 years ago
- A fast work-stealing queue template in C++☆283Updated 7 months ago
- A fast and highly scalable GPU dynamic memory allocator☆103Updated 9 years ago
- An adaptive radix tree for efficient indexing in main memory.☆147Updated 5 months ago
- Experimental C++11 version of sparsehash☆283Updated last year