fast-pack / LittleIntPackerLinks
C library to pack and unpack short arrays of integers as fast as possible
☆92Updated 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☆127Updated 2 months ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 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
- Fast integer compression in C using the StreamVByte codec☆413Updated 11 months ago
- A hash table implementation using Robin Hood Linear Probing☆52Updated 11 years ago
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 4 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
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- A simple C library for compressing lists of integers using binary packing☆515Updated 2 years ago
- High-performance dictionary coding☆109Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆136Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- TurboRLE-Fastest Run Length Encoding☆289Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆63Updated 6 years ago
- qp tries and crit-bit tries☆124Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Updated 3 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆52Updated 4 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A simple bitset library in C☆144Updated 3 weeks ago
- A fast alternative to the modulo reduction☆317Updated 4 years ago
- User space threading (aka coroutines) library for C resembling GoLang and goroutines☆166Updated 7 years ago
- ☆113Updated 2 years ago
- Fastest Histogram Construction☆75Updated 4 years ago
- For details, see the blog post:☆35Updated 2 years ago
- ☆27Updated 8 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 6 years ago