mthom / unmanaged-ctrieLinks
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
Sorting:
- Garbage collected concurrent hash tries.☆19Updated 8 years ago
- Multiplying... backward?☆13Updated 4 years ago
- A small test for multithreaded C++ stack unwinding on unixes☆16Updated 5 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- A vectorized single header hash function.☆19Updated 6 months ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 5 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- ☆41Updated 2 years ago
- String to Float Benchmark☆19Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Software transactional memory system developed at Wyatt Technology☆29Updated 5 years ago
- A rethinking of the C time library☆11Updated 3 months ago
- A collection of data structures in C++☆18Updated 2 years ago
- C++1y coroutine library.☆17Updated 7 years ago
- A Wait-Free Universal Construct for Large Objects☆97Updated 5 years ago
- A header-only C++ library for writing compiler/interpreter frontends.☆14Updated 3 weeks ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Binary search implementation that avoids branch instructions☆10Updated 5 years ago
- Shader-Like Mathematical Expression JIT Engine for C++ Language☆58Updated 5 years ago
- Concurrent mark-sweep garbage collector for accurate garbage collection of language runtimes in C++ 1x.☆35Updated 8 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 6 years ago
- Some variations on Lemire's Fast Random Integer Generation in an Interval☆15Updated 5 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- Counting the collisions with perl hash tables per function☆12Updated 5 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆31Updated last year
- unrolled skip list library for C☆21Updated 6 years ago
- Branchless-Lomuto in Pattern-Defeating Quicksort☆48Updated 10 months ago