TooBiased / growtLinks
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.
☆109Updated 5 months ago
Alternatives and similar repositories for growt
Users that are interested in growt are comparing it to the libraries listed below
Sorting:
- The Berkeley Container Library☆124Updated 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
- EDSL for C++ to make just-in-time code generation easier☆86Updated 2 years ago
- Template Vector Library☆18Updated 3 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated 2 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆278Updated 5 months ago
- Comprehensive benchmarks of C++ maps☆309Updated 2 years ago
- Persistent memory allocator for data-centric analytics☆54Updated this week
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆410Updated 4 months ago
- Parallel Balanced Binary Tree Structures☆116Updated 2 months ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Experimental C++11 version of sparsehash☆290Updated 2 years ago
- UME::SIMD A library for explicit simd vectorization.☆90Updated 7 years ago
- High-performance multicore-scalable data structures and benchmarks☆140Updated 5 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆66Updated 4 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆124Updated 2 months ago
- Library for lock-free locks☆78Updated last year
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆31Updated 6 years ago
- ☆106Updated last year
- A fast SIMD parser for CSV files☆151Updated 2 years ago
- An open addressing linear probing hash table, tuned for delete heavy workloads☆204Updated last year
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- A modern interface for implementing bulk-synchronous parallel programs.☆94Updated 2 years ago
- Concurrent Deferred Reference Counting☆163Updated last year
- An open-source framework for concurrent data-structures and benchmarks. 🛠️ Latest Dev Branch: v3.4.0-dev 🚀 https://github.com/nkallima/…☆67Updated last month
- ☆70Updated 4 years ago
- A simple implementation of the packed memory array☆19Updated 11 years ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago