fast-pack / FrameOfReferenceLinks
C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
☆53Updated last year
Alternatives and similar repositories for FrameOfReference
Users that are interested in FrameOfReference are comparing it to the libraries listed below
Sorting:
- A C++ library for integer array compression☆29Updated 3 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- For details, see the blog post:☆32Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 4 months ago
- benchmarking positional population count☆14Updated last year
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 4 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- High-performance dictionary coding☆104Updated 8 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆88Updated 3 years ago
- ☆21Updated 7 months ago
- ☆16Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Fast decoder for VByte-compressed integers☆122Updated last year
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆42Updated 10 years ago
- fast prime sieve and hash algorithm☆38Updated this week
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Memory-mapped storage library☆76Updated 9 years ago