backtrace-labs / bcdLinks
Simple out-of-process invoker
☆18Updated 5 months ago
Alternatives and similar repositories for bcd
Users that are interested in bcd are comparing it to the libraries listed below
Sorting:
- qp tries and crit-bit tries☆122Updated 3 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- Lock-free multithreaded memory allocation☆110Updated 8 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- A software-based Ethernet switch design built around a memory-efficient, high-performance, and highly-concurrent hash table for compact a…☆37Updated 10 years ago
- Roaring bitmaps in C☆17Updated 9 years ago
- Static Radix Tree (Patricia trie) implementation in C☆48Updated 8 years ago
- A threaded, continuations-based I/O event library for manycore NUMA machines☆74Updated 4 years ago
- finding set bits in large bitmaps☆15Updated 10 years ago
- RWMutex for sharing of multicore machines.☆18Updated 6 years ago
- Filesystem qualification tool☆60Updated last week
- Fastest RPC in the west☆21Updated 6 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- Wannabe Main Memory Database and More☆54Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- A small DFA for under 16 states☆53Updated 7 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- ☆27Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆120Updated 8 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆52Updated 4 years ago
- bit & sketches data structures☆60Updated 7 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago