algorithm-ninja / cpp-btreeLinks
Git mirror of the official (mercurial) repository of cpp-btree
☆73Updated 10 years ago
Alternatives and similar repositories for cpp-btree
Users that are interested in cpp-btree are comparing it to the libraries listed below
Sorting:
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated 2 years ago
- A benchmark of some prominent C/C++ hash table implementations☆37Updated 4 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- Boost.Lockfree☆133Updated last week
- C++ framework for rapid server development☆77Updated last year
- STL-based caches for C++☆116Updated 2 years ago
- Boost.Sort☆53Updated last month
- Component-Model Framework in C++☆44Updated 9 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 3 months ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆42Updated 10 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆31Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Boost.Coroutine2☆134Updated last month
- QSBR and EBR library☆119Updated 5 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- Our open source benchmarks and code samples☆192Updated this week
- fast prime sieve and hash algorithm☆38Updated 2 weeks ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆128Updated last year
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆178Updated 8 months ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆81Updated 9 years ago
- Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."☆19Updated 14 years ago
- Effective Memory Reclamation☆55Updated 5 years ago
- A simple replacement for std::unordered_map☆49Updated 10 months ago
- Boost.org multi_index module☆51Updated last month
- Boost.Coroutine☆84Updated last month
- A disruptor thread-synchronisation data structure for C++11.☆127Updated 2 years ago
- Enjoy template metaprogramming☆113Updated 8 years ago
- Boost.Atomic☆62Updated last week
- W-TinyLFU cache C++11 header only implementation☆58Updated 6 years ago