mthom / unmanaged-ctrie
Concurrent hash tries for C++ 14 with no memory management whatsoever.
☆10Updated 8 years ago
Alternatives and similar repositories for unmanaged-ctrie:
Users that are interested in unmanaged-ctrie are comparing it to the libraries listed below
- Garbage collected concurrent hash tries.☆19Updated 8 years ago
- Multiplying... backward?☆13Updated 4 years ago
- C++1y coroutine library.☆17Updated 6 years ago
- Concurrent mark-sweep garbage collector for accurate garbage collection of language runtimes in C++ 1x.☆35Updated 8 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆16Updated 6 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- Type-generic SIMD library for optimized generic code generation☆12Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- A textual language for binary data.☆37Updated 2 years ago
- Software transactional memory system developed at Wyatt Technology☆28Updated 5 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- A small test for multithreaded C++ stack unwinding on unixes☆16Updated 4 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆22Updated 2 years ago
- A library to support streaming data applications☆24Updated 3 years ago
- PackCC is a packrat parser generator for C.☆22Updated 5 years ago
- A collection of data structures in C++☆18Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- How fast can we shuffle values?☆37Updated 10 months ago
- Crit-bit tree (trie) library☆32Updated 10 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Emulation of resumable expressions using boost.coroutine☆12Updated 6 years ago
- ☆13Updated 6 years ago
- Counting the collisions with perl hash tables per function☆12Updated 5 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- A library for high-performance lightweight threads☆20Updated 13 years ago