Alternatives and similar repositories for skip_list:

Users that are interested in skip_list are comparing it to the libraries listed below

• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 10 years ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆147Updated 5 years ago
• Qarterd / Honeycomb
  Component-Model Framework in C++
  ☆44Updated 9 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 3 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• boostorg / lockfree
  Boost.Lockfree
  ☆132Updated 3 weeks ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆213Updated 2 years ago
• ytakano / radix_tree
  STL like container of radix tree (a.k.a. PATRICIA trie) in C++
  ☆142Updated 2 years ago
• twlostow / libcontext
  A stripped-down, portable version of boost::context
  ☆51Updated 2 years ago
• kedebug / yodb
  A lightweight and fast key-value storage engine based on the buffer tree.
  ☆53Updated 11 years ago
• boostorg / coroutine
  Boost.Coroutine
  ☆83Updated 3 weeks ago
• cyfdecyf / spinlock
  Different implementations of spinlock.
  ☆105Updated 10 years ago
• rigtorp / HashMap
  An open addressing linear probing hash table, tuned for delete heavy workloads
  ☆205Updated last year
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆178Updated 7 months ago
• MengRao / str
  A SIMD optimized fixed-length string class along with an adaptive hash table for fast searching
  ☆129Updated 3 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆191Updated last month
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• mstump / queues
  A public domain lock free queues implemented in C++11
  ☆181Updated 11 years ago
• johannesthoma / mmap_allocator
  A STL allocator that mmaps files
  ☆247Updated 4 years ago
• samanbarghi / MPSCQ
  An intrusive lock-free multiple-producer, single-consumer queue in C++
  ☆51Updated 8 years ago
• boostorg / coroutine2
  Boost.Coroutine2
  ☆133Updated 3 weeks ago
• akashihi / stlcache
  STL-based caches for C++
  ☆116Updated last year
• Tessil / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆37Updated 4 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆58Updated 6 years ago
• rigtorp / TokenBucket
  Lock-free implementation of the token bucket algorithm in C++
  ☆57Updated 2 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• tstarling / thread-safe-lru
  A C++ template class providing a thread-safe LRU cache
  ☆76Updated 3 years ago
• MengRao / WFMPMC
  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
• microsoft / L4
  L4 (Lock-Free on Read) Hashtable is a C++ library that implements hash table with arbitray byte stream keys/values.
  ☆203Updated 2 years ago