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.
☆113Updated 9 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 3 years ago
- Parallel Balanced Binary Tree Structures☆120Updated 7 months ago
- Library for lock-free locks☆83Updated 2 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆433Updated 9 months ago
- Fast Approximate Membership Filters (C++)☆286Updated last month
- Comprehensive benchmarks of C++ maps☆315Updated 2 years ago
- EDSL for C++ to make just-in-time code generation easier☆85Updated 2 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆387Updated last month
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆129Updated 7 months ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆438Updated 3 months ago
- Experimental C++11 version of sparsehash☆292Updated 3 years ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆349Updated last year
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆127Updated 9 months ago
- UME::SIMD A library for explicit simd vectorization.☆91Updated 7 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- C++ implementation of a memory efficient hash map and hash set☆363Updated last month
- Concurrent Deferred Reference Counting☆168Updated last year
- ☆110Updated last year
- Template Vector Library☆18Updated 4 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- 🚀 Fast C/C++ bit population count library☆351Updated last year
- C++ micro benchmark library☆97Updated 8 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 6 years ago
- Modern library for bulk-synchronous parallel programs.☆94Updated 2 years ago
- Persistent memory allocator for data-centric analytics☆56Updated last week
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago