backtrace-labs / bcd
Simple out-of-process invoker
☆18Updated 11 months ago
Alternatives and similar repositories for bcd
Users that are interested in bcd are comparing it to the libraries listed below
Sorting:
- Header-only C++ library for writing PCP PMDAs☆16Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 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
- Fast 64 bit evolved hash.☆32Updated 8 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- Crit-bit tree (trie) library☆32Updated 10 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Finite State Coder☆14Updated 10 years ago
- Userspace file-system using the TokuFT fractal tree library☆23Updated 3 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- A splaytree ADT written in C with a BSD license☆18Updated 4 years ago
- ☆12Updated last year
- Roaring bitmaps in C☆17Updated 9 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- The CIlk programming language from http://supertech.lcs.mit.edu/cilk/☆9Updated 9 years ago
- The k-LSM: A relaxed, lock-free, linearizable priority queue☆23Updated 8 years ago
- Lthread C++11 binding☆11Updated 10 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- ☆11Updated 7 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A software-based Ethernet switch design built around a memory-efficient, high-performance, and highly-concurrent hash table for compact a…☆35Updated 9 years ago
- Compact tries for fixed-width keys☆25Updated 6 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Static Radix Tree (Patricia trie) implementation in C☆49Updated 7 years ago