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.
☆118Updated last year
Alternatives and similar repositories for growt
Users that are interested in growt are comparing it to the libraries listed below
Sorting:
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆23Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- The Berkeley Container Library☆126Updated last month
- The world's first wait-free Software Transactional Memory☆175Updated 5 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆446Updated last year
- Library for lock-free locks☆84Updated 2 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Parallel Balanced Binary Tree Structures☆122Updated 10 months ago
- Concurrent Deferred Reference Counting☆174Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- Comprehensive benchmarks of C++ maps☆316Updated 2 years ago
- EDSL for C++ to make just-in-time code generation easier☆88Updated 2 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆166Updated last year
- Persistent memory allocator for data-centric analytics☆60Updated 3 months ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆354Updated last year
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆132Updated last year
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆422Updated 2 months ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆138Updated last month
- 🚀 Fast C/C++ bit population count library☆360Updated last year
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆443Updated 7 months ago
- Heap Layers: An Extensible Memory Allocation Infrastructure☆411Updated last month
- ☆113Updated 2 years ago
- UME::SIMD A library for explicit simd vectorization.☆91Updated 8 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- ☆128Updated 3 years ago
- A fast SIMD parser for CSV files☆159Updated 3 years ago
- C++ implementation of a memory efficient hash map and hash set☆366Updated 3 months ago
- A fast alternative to the modulo reduction☆317Updated 4 years ago