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.
☆110Updated 7 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 2 years ago
- 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++)☆281Updated 7 months ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆417Updated 7 months ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 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☆117Updated 5 months ago
- Library for lock-free locks☆82Updated 2 years ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆370Updated 3 months ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- EDSL for C++ to make just-in-time code generation easier☆86Updated 2 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 7 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆123Updated 7 months ago
- Comprehensive benchmarks of C++ maps☆311Updated 2 years ago
- Experimental C++11 version of sparsehash☆291Updated 2 years ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆346Updated last year
- ☆108Updated last year
- Template Vector Library☆18Updated 4 years ago
- 🚀 Fast C/C++ bit population count library☆348Updated last year
- C++ implementation of a memory efficient hash map and hash set☆360Updated 11 months ago
- Concurrent Deferred Reference Counting☆166Updated last year
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆437Updated last month
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆128Updated 5 months ago
- Effective Memory Reclamation☆58Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- A fast alternative to the modulo reduction☆311Updated 4 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- ☆128Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A fast work-stealing queue template in C++☆319Updated last year