wichtounet / btrees
C++ implementation of concurrent Binary Search Trees
☆72Updated 9 years ago
Related projects: ⓘ
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 10 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆74Updated 10 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆212Updated last year
- A fully concurrent lock-free cuckoo hash table implementation☆55Updated 7 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆67Updated 10 years ago
- Fast Concurrent Memoization Map (fcmm) is an almost lock-free concurrent hashmap written in C++11 to be used for memoization in concurren…☆51Updated 6 years ago
- Cross-platform atomic operations and lock algorithm library☆94Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆50Updated 7 years ago
- Trie is a lightweight and simple autocompletion data structure written in C++11.☆43Updated 9 years ago
- Enjoy template metaprogramming☆112Updated 7 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆42Updated 9 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆73Updated 3 years ago
- [deprecated] Data structures and sample applications using Mintomic☆94Updated 8 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆73Updated 5 years ago
- A benchmark of some prominent C/C++ hash table implementations☆103Updated 5 years ago
- Component-Model Framework in C++☆44Updated 8 years ago
- High-performance multicore-scalable data structures and benchmarks☆135Updated 5 years ago
- W-TinyLFU cache C++11 header only implementation☆55Updated 5 years ago
- EDSL for C++ to make just-in-time code generation easier☆79Updated last year
- C++ Green threads and coroutines library☆37Updated 10 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆120Updated last year
- Automatically exported from code.google.com/p/google-concurrency-library☆35Updated 8 years ago
- Benchmark of common hash functions☆34Updated 5 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆48Updated 7 months ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆29Updated 6 years ago
- Proposed B-tree library for Boost.org☆71Updated 10 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆176Updated 6 years ago
- QSBR and EBR library☆114Updated 4 years ago