fast-pack / LittleIntPackerLinks
C library to pack and unpack short arrays of integers as fast as possible
☆89Updated 2 years ago
Alternatives and similar repositories for LittleIntPacker
Users that are interested in LittleIntPacker are comparing it to the libraries listed below
Sorting:
- Fast decoder for VByte-compressed integers☆122Updated last year
- High-performance dictionary coding☆104Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆118Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A simple C library for compressing lists of integers using binary packing☆498Updated last year
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Fast integer compression in C using the StreamVByte codec☆400Updated 3 months ago
- A simple bitset library in C☆134Updated 3 months ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆61Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- 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
- A fast SIMD parser for CSV files☆151Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 4 years ago
- ☆36Updated 4 years ago
- A benchmark for sorting algorithms☆60Updated 4 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Bloom-filter based minimal perfect hash function library☆262Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 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
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆134Updated 5 years ago
- generate perfect hashes (alpha)☆77Updated 3 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- A C++ library for integer array compression☆29Updated 3 years ago