ademakov / OrochLinks
A C++ library for integer array compression
☆29Updated 3 years ago
Alternatives and similar repositories for Oroch
Users that are interested in Oroch are comparing it to the libraries listed below
Sorting:
- 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
- For details, see the blog post:☆34Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Bloom filter alternative (C++)☆18Updated 7 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Vectorized version of the PCG random number generator☆84Updated 8 months ago
- Non-blocking message passing (a C++14 MPI wrapper)☆18Updated 11 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- C++ interface to CPU affinity management☆30Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- C++ Library of Atomic and Lockless Data Structures☆38Updated 5 years ago
- Marlin: high throughput entropy compressor☆30Updated 2 years ago
- fast prime sieve and hash algorithm☆38Updated 2 months ago
- Header only C++14 micro benchmark☆14Updated 9 years ago
- Allocation benchmarks☆30Updated 9 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- ☆18Updated 8 years ago
- Memory alignment wrappers, useful for avoiding false sharing☆41Updated 9 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆65Updated this week
- SIMD (SSE) string functions☆103Updated 8 years ago
- Memory-mapped storage library☆76Updated 9 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- TLSF: two-level segregated fit O(1) allocator☆80Updated 3 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆45Updated 10 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- benchmarking positional population count☆15Updated 3 weeks ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 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
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago