Alternatives and similar repositories for splay-tree

Users that are interested in splay-tree are comparing it to the libraries listed below

• cruppstahl / sparsemap
  A sparse and compressed bitmap library.
  ☆13Updated 10 years ago
• mbrossard / has
  Dynamic-language-like data structure for C
  ☆15Updated 9 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 6 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• chriso / bitset
  A compressed bitset with supporting data structures and algorithms
  ☆19Updated 11 years ago
• ned14 / uthash
  A GIT clone of uthash.sourceforge.net, a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any stru…
  ☆36Updated 11 years ago
• plasma-umass / memory-landscape
  The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).
  ☆20Updated 4 years ago
• xroche / coucal
  Cuckoo Hashtable C Library
  ☆33Updated 5 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• willemt / linked-list-queue
  A simple queue using a linked list written in C under the BSD license.
  ☆18Updated 8 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• malbrain / rwlock
  Phase Fair and Standard Reader Writer Locks
  ☆17Updated 5 years ago
• jakogut / tinybloom
  A small, simple, easy to use bloom filter written in C.
  ☆35Updated 14 years ago
• graphitemaster / libintrusive
  Intrusive data structures for C
  ☆60Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆50Updated 8 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆51Updated 3 years ago
• cesbit / libcleri
  Libcleri is a powerful tool to build languages. From a built language, libcleri can automatically create parse trees, which are data str…
  ☆39Updated last year
• maciejczyzewski / hashbase
  A fast, efficient on-disk/in-memory database with many different kind of data structures.
  ☆27Updated 10 years ago
• cemeyer / structhole
  A feature-incomplete peekahole (pahole) clone that doesn't rely on libdwarves (and doesn't choke on Clang output)
  ☆22Updated 7 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• troydhanson / shr
  ☆32Updated 2 years ago
• rmind / ttimer
  Tick-based timer (hierarchical timing wheel algorithm)
  ☆44Updated 5 years ago
• jmckaskill / c-capnproto
  C library/compiler for the Cap'n Proto serialization/RPC protocol
  ☆69Updated 2 years ago
• eapache / wof_alloc
  Fast C/C++ memory allocator with free-all operation
  ☆55Updated 10 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆77Updated 3 years ago