art4711 / bmap_find
finding set bits in large bitmaps
☆15Updated 9 years ago
Alternatives and similar repositories for bmap_find:
Users that are interested in bmap_find are comparing it to the libraries listed below
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆10Updated 4 years ago
- A sparse and compressed bitmap library.☆11Updated 10 years ago
- ☆13Updated 6 years ago
- Vectorized intersections (research code)☆14Updated 8 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- bit & sketches data structures☆60Updated 6 years ago
- A simple immutable ordered key/value storage system.☆15Updated 8 years ago
- A splaytree ADT written in C with a BSD license☆17Updated 4 years ago
- A decentralized unique ID generator (int64)☆21Updated 8 years ago
- ☆31Updated 9 years ago
- Dictionary implemented through a skiplist☆15Updated 10 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- ☆25Updated 7 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 9 years ago
- Popular hash table implementation benchmarks☆27Updated 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
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- LLVM-jitted bitmaps☆27Updated 4 years ago
- Quick experiment to see how expensive safety is in C, for research☆12Updated 5 years ago
- A C++ library for integer array compression☆28Updated 2 years ago
- A generic single header garbage collector that mixes reference counting and a mark & sweep algorithm☆18Updated 7 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 10 months ago
- Native C++ Library☆49Updated 9 years ago
- A small, simple, easy to use bloom filter written in C.☆35Updated 13 years ago
- C version of the MetroHash function☆25Updated 9 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- RLU resizable hash-table☆16Updated 9 years ago