algorithm-ninja / cpp-btreeLinks
Git mirror of the official (mercurial) repository of cpp-btree
☆80Updated 11 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:
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆185Updated 3 months ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆131Updated 2 years ago
- A special smart pointer to exchange data between threads☆37Updated 6 years ago
- STL-based caches for C++☆116Updated 2 years ago
- STL like container of radix tree (a.k.a. PATRICIA trie) in C++☆141Updated 3 years ago
- Boost.Coroutine2☆136Updated last month
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.☆185Updated 12 years ago
- Boost.org multi_index module☆55Updated 2 weeks ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆45Updated 10 years ago
- Enjoy template metaprogramming☆115Updated 9 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated last month
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 9 years ago
- fast prime sieve and hash algorithm☆39Updated 5 months ago
- Adapters for interfacing libuv with C++ resumable functions☆117Updated last year
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- The world's first Web-scale memory allocator☆109Updated 7 years ago
- C++ double-to-string conversion benchmark☆260Updated 3 years ago
- C++ Library of Atomic and Lockless Data Structures☆38Updated 5 years ago
- L4 (Lock-Free on Read) Hashtable is a C++ library that implements hash table with arbitray byte stream keys/values.☆208Updated 3 years ago
- Our open source benchmarks and code samples☆193Updated 3 months ago
- C++ framework for rapid server development☆77Updated 2 years ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆86Updated 10 years ago
- Boost.Atomic☆67Updated last month
- Boost.Coroutine☆85Updated last month
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- Boost.org pool module☆57Updated last month
- Portable C++ SIMD library☆171Updated 6 years ago
- Boost.Sort☆56Updated this week