petegoodliffe / skip_listLinks
STL-style C++ skip_list container
☆87Updated 3 years ago
Alternatives and similar repositories for skip_list
Users that are interested in skip_list are comparing it to the libraries listed below
Sorting:
- C++ integer-to-string conversion benchmark☆341Updated 7 months ago
- STL like container of radix tree (a.k.a. PATRICIA trie) in C++☆142Updated 2 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- A STL allocator that mmaps files☆252Updated 4 years ago
- Component-Model Framework in C++☆44Updated 9 years ago
- Experimental C++11 version of sparsehash☆292Updated 2 years ago
- STL-based caches for C++☆115Updated 2 years ago
- Bloom filters for C++11☆363Updated 3 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆183Updated last year
- A public domain lock free queues implemented in C++11☆180Updated 11 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- A concurrent thread-safe hash map implemented in C++☆146Updated 2 years ago
- An open addressing linear probing hash table, tuned for delete heavy workloads☆210Updated 2 years ago
- C++ MapReduce Library for efficient multi-threading on single-machine☆337Updated 4 years ago
- Various open addressing hashmap algorithms in C++☆256Updated 3 years ago
- Boost.Coroutine2☆135Updated 3 weeks ago
- A feature complete LRU cache implementation in C++☆257Updated 5 years ago
- L4 (Lock-Free on Read) Hashtable is a C++ library that implements hash table with arbitray byte stream keys/values.☆207Updated 2 years ago
- Boost.Lockfree☆143Updated last month
- Simple and reliable LRU cache for c++ based on hashmap and linkedlist☆387Updated 5 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- A C++ template class providing a thread-safe LRU cache☆77Updated 3 years ago
- A header only C++11 LRU Cache template class that allows you to define key, value and optionally the Map type. uses a double linked list …☆296Updated last year
- A bounded wait-free(almost) zero-copy MPMC queue written in C++11, which can also reside in SHM for IPC☆119Updated 6 years ago
- A C++ await/yield emulation library for stackless coroutine☆340Updated last year
- Our open source benchmarks and code samples☆193Updated 2 months ago
- C++ implementation of a memory efficient hash map and hash set☆362Updated 2 weeks ago
- Generic lock-free Skiplist container pure C implementation, STL-style set, map☆149Updated 5 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 9 years ago
- Different implementations of spinlock.☆105Updated 10 years ago