Alternatives and similar repositories for c-minheap-indirect

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

• willemt / heap
  Heap priority queue written in C, licensed under a BSD license
  ☆32Updated 10 years ago
• PeterScott / netstring-c
  Netstring parsing in C
  ☆35Updated 4 years ago
• jamwt / rolla
  Rolla - Tiny, fast, crash-safe embedded k/v storage engine
  ☆53Updated 2 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• armon / c-minheap-array
  Implements a Min-Heap / Priority Queue in C using a simple array.
  ☆56Updated 4 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• willemt / linked-list-queue
  A simple queue using a linked list written in C under the BSD license.
  ☆18Updated 7 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• skeeto / stack-clash-coroutine
  Stack clash coroutine demonstration
  ☆12Updated 7 years ago
• luceracloud / libfasttime
  Fast time calls from user space.
  ☆11Updated 9 years ago
• davidad / asm_concurrency
  A demo of concurrency primitives in x64 assembly
  ☆17Updated 3 years ago
• aji / libco
  userspace threads and coroutines for C
  ☆18Updated 9 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• arrbee / diff-match-patch-c
  C language port of google-diff-match-patch library
  ☆41Updated 9 years ago
• vmg / mph
  Perfect Hash Functions
  ☆18Updated 10 years ago
• blynn / blt
  Crit-bit tree (trie) library
  ☆32Updated 11 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆36Updated 6 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• willemt / duraqueue
  Durable dead simple queue that allows zero copy semantics. Durable under failure!
  ☆18Updated 9 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆46Updated 3 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆10Updated 4 years ago
• willemt / splay-tree
  A splaytree ADT written in C with a BSD license
  ☆18Updated 4 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 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
• jedisct1 / metrohash-c
  C version of the MetroHash function
  ☆26Updated 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
• silentbicycle / loom
  a lock-less thread pool for C99
  ☆44Updated 10 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago