Alternatives and similar repositories for c-minheap-indirect

Users that are interested in c-minheap-indirect are comparing it to the libraries listed below

• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• armon / c-minheap-array
  Implements a Min-Heap / Priority Queue in C using a simple array.
  ☆57Updated 4 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 10 years ago
• aji / libco
  userspace threads and coroutines for C
  ☆18Updated 9 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆69Updated 9 years ago
• jakogut / tinybloom
  A small, simple, easy to use bloom filter written in C.
  ☆35Updated 14 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• jmckaskill / c-capnproto
  C library/compiler for the Cap'n Proto serialization/RPC protocol
  ☆69Updated 2 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆77Updated 3 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆47Updated 8 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆74Updated 8 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• Amaury / AngstromDB
  Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.
  ☆14Updated 11 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆163Updated 10 years ago
• willemt / splay-tree
  A splaytree ADT written in C with a BSD license
  ☆18Updated 5 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 6 years ago
• nevali / liburi
  A URI (and IRI) parser with a straightforward API, based upon uriparser
  ☆27Updated 7 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆37Updated 6 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
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆88Updated 3 years ago
• mbrossard / has
  Dynamic-language-like data structure for C
  ☆15Updated 9 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• dankamongmen / libtorque
  A threaded, continuations-based I/O event library for manycore NUMA machines
  ☆73Updated 4 years ago