giacomodrago / fcmm
Fast Concurrent Memoization Map (fcmm) is an almost lock-free concurrent hashmap written in C++11 to be used for memoization in concurrent environments.
☆51Updated 6 years ago
Related projects: ⓘ
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆35Updated 2 weeks ago
- Component-Model Framework in C++☆44Updated 8 years ago
- A C++ header-only support for serialization of generic objects to be used when the type is known a-priori.☆52Updated 11 years ago
- A single file C++11 header-only memory mapped file library.☆60Updated 10 months ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 10 years ago
- C++ Library of Atomic and Lockless Data Structures☆38Updated 4 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆51Updated 8 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
- For details, see the blog post:☆31Updated 9 months ago
- STL-based caches for C++☆113Updated last year
- C++ framework for rapid server development☆76Updated 7 months ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆176Updated 9 months ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆29Updated 6 years ago
- A C++ library for integer array compression☆27Updated 2 years ago
- Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based☆9Updated 6 years ago
- benchmark for various C++ function implementations; focus on invocation time☆92Updated 5 years ago
- a header only C++ LRU Cache template class (now with optional synchronization) that allows you to define key, value and optionally the Ma…☆40Updated 8 years ago
- C++11 template meta-programming library.☆48Updated 9 years ago
- Boost.org multi_index module☆46Updated last month
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆37Updated 7 years ago
- Trie is a lightweight and simple autocompletion data structure written in C++11.☆43Updated 9 years ago
- C++ coroutine based networking library (WIP)☆37Updated 5 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 7 years ago
- A proposal for a futures programming model for ISO C++☆22Updated 6 years ago
- JSON Serializer using compile time reflection☆20Updated last year
- An encoder/decoder collection for a sequence of integers☆31Updated 11 years ago
- Implementation of std::future from the C++ Concurrency TS☆28Updated last year
- A prototype implementation of the executors proposal☆84Updated 5 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆14Updated 9 years ago