bytemaster / fc_mallocLinks
Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.
☆185Updated 12 years ago
Alternatives and similar repositories for fc_malloc
Users that are interested in fc_malloc 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 2 months 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
- Port of the xxhash library to C++17.☆185Updated 8 months ago
- A prototype implementation of the executors proposal☆86Updated 6 years ago
- Single-header library facilities for C++2a Coroutines☆81Updated 3 years ago
- A drop-in replacement for std::list with 293% faster insertion, 57% faster erasure, 17% faster iteration and 77% faster sorting on averag…☆165Updated 3 weeks ago
- LightweighT Almost Lock-Less Oriented for C++ programs memory allocator☆170Updated 6 years ago
- ☆128Updated 2 years ago
- C++ version of Doug Lea's excellent malloc() implementation.☆153Updated 6 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆130Updated 2 years ago
- C++ framework for rapid server development☆76Updated last year
- Replaced by foonathan/lexy☆138Updated 5 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆80Updated 11 years ago
- Adapters for interfacing libuv with C++ resumable functions☆117Updated last year
- Effective Memory Reclamation☆63Updated 5 years ago
- A proposal for a executor programming model for ISO C++☆141Updated 5 years ago
- Sample implementation of C++20 atomic_wait/notify☆62Updated 6 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 9 years ago
- Portable C++ SIMD library☆171Updated 6 years ago
- Fast multi-threaded memory allocator☆79Updated 6 years ago
- C++ serializers benchmark with realistic data☆127Updated 3 years ago
- Compile-time-efficient proof-of-concept implementation for std::tuple☆94Updated last month
- Component-Model Framework in C++☆44Updated 10 years ago
- Lock-free concurrent work stealing deque in C++☆41Updated 7 years ago
- Implementation of std::any, including small object optimization, for C++11 compilers☆151Updated last year
- An implementation of Seqlock in C++11☆235Updated last year
- Eliminate all the tedious hassle when making state-of-the-art C++ 14 - 23 libraries!☆185Updated 3 weeks ago
- any lite - A C++17-like any, a type-safe container for single values of any type for C++98, C++11 and later in a single-file header-only …☆153Updated 2 months ago
- A disruptor thread-synchronisation data structure for C++11.☆149Updated 2 years ago
- STL-based caches for C++☆116Updated 2 years ago