Alternatives and similar repositories for em_misc:

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

• johnj / llds
  Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel
  ☆120Updated last year
• brentp / fastbit-python
  pythonic access to fastbit
  ☆26Updated 6 years ago
• zeevt / csnappy
  Google snappy in C for Linux Kernel
  ☆39Updated 2 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• siganakis / tny
  Tiny data structures that pack a punch!
  ☆101Updated 12 years ago
• jedisct1 / Pincaster
  A fast persistent nosql database with a HTTP/JSON interface, not only for geographical data.
  ☆170Updated last month
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• toffaletti / libguri
  A very fast URI parser in C.
  ☆26Updated 6 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• blynn / blt
  Crit-bit tree (trie) library
  ☆32Updated 10 years ago
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆21Updated 11 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆105Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆121Updated 8 months ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 8 years ago
• skaphan / stmmap
  STM (Software Transactional Memory) implementation in C, based on memory-mapping.
  ☆59Updated 15 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• toffaletti / libten
  C++11 library for network services on modern x86_64 Linux
  ☆87Updated 9 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• gritzko / swift
  the multiparty transport protocol (aka "TCP with swarming" or "BitTorrent at the transport layer")
  ☆60Updated 13 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
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆26Updated 10 years ago
• gstrauss / mcdb
  mcdb - fast, reliable, simple code to create and read constant databases
  ☆110Updated 2 years ago
• jedisct1 / metrohash-c
  C version of the MetroHash function
  ☆25Updated 9 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 9 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆41Updated 8 years ago
• lvv / scc
  Simple-C++
  ☆63Updated 8 years ago