art4711 / bmap_findLinks
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
Sorting:
- bit & sketches data structures☆60Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- Roaring bitmaps in C☆17Updated 9 years ago
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Many functions in C for sorting the nibbles in an 8-byte word☆33Updated 10 years ago
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 10 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- A small DFA for under 16 states☆52Updated 7 years ago
- Ragel/Lemon based json-parser☆17Updated 7 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- ☆27Updated 8 years ago
- Iterator library.☆79Updated 5 years ago
- A word-aligned integer compression algorithm.☆13Updated last year
- Generally applicable Terra utilities.☆15Updated 10 years ago
- A splaytree ADT written in C with a BSD license☆18Updated 5 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆138Updated 8 months ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 6 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- ☆31Updated 9 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Trlmdb is a replicating database using time stamps.☆14Updated 9 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year