nitnelave / lru_cacheLinks
A C++ implementation of a LRU cache
☆42Updated 5 years ago
Alternatives and similar repositories for lru_cache
Users that are interested in lru_cache are comparing it to the libraries listed below
Sorting:
- Task graph-based asynchronous programming system using C++ coroutine☆93Updated last year
- Lock-Free implementation of std::atomic<std::shared_ptr> & several Lock-Free data structures based on it☆67Updated last year
- A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per se…☆72Updated last year
- Boost.org unordered module☆79Updated last week
- a small lightweight std::execution work-alike☆65Updated 6 months ago
- C++ serializers benchmark with realistic data☆125Updated 2 years ago
- A fast work-stealing queue template in C++☆321Updated last year
- Polymorphic memory resource for real-time applications.☆73Updated 2 years ago
- Light, fast, threadpool for C++20☆104Updated 2 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆129Updated 2 years ago
- Comprehensive benchmarks of C++ maps☆314Updated 2 years ago
- Lockfree, atomic, multi producer, multi consumer, C++, in process and inter-process queue☆202Updated last year
- Sample implementation of C++20 atomic_wait/notify☆59Updated 6 years ago
- DR3 enables users to write vectorised code using generic lambdas and filters. Switch instruction set just by changing enclosing namespace…☆35Updated 2 weeks ago
- Lightweight recording and sampling of performance counters for specific code segments directly from your C++ application.☆144Updated 2 weeks ago
- async is a tiny C++ header-only high-performance library for async calls handled by a thread-pool, which is built on top of an unbounded …☆31Updated 4 years ago
- General-purpose C++ graph library☆228Updated last month
- plf::hive is a fork of plf::colony to match the current C++ standards proposal.☆133Updated this week
- Lock-free concurrent work stealing deque in C++☆40Updated 7 years ago
- Tiny Test System☆27Updated 2 weeks ago
- ☆145Updated 2 months ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆34Updated 7 years ago
- The seq library is a collection of original C++17 STL-like containers and related tools☆99Updated 2 weeks ago
- ☆59Updated last year
- A fastest, exception-safety and pure C++17 thread pool.☆131Updated 6 years ago
- A simple replacement for std::unordered_map☆50Updated last year
- Greg's Template Library of useful classes.☆221Updated last month
- Single-header library facilities for C++2a Coroutines☆81Updated 3 years ago
- Ultra fast C++11 allocator for STL containers.☆273Updated 3 years ago
- Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17☆151Updated 4 years ago