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
☆54Updated 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☆27Updated 5 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
- benchmarking positional population count☆15Updated last year
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated last month
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆87Updated 3 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- SIMD (SSE) string functions☆102Updated 8 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- 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
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆75Updated 11 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- Persistent red-black tree in C++☆29Updated 7 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆14Updated 9 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆35Updated 9 years ago
- Effective Memory Reclamation☆58Updated 5 years ago
- C++ framework for rapid server development☆77Updated last year
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- fast prime sieve and hash algorithm☆38Updated 2 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Non-blocking message passing (a C++14 MPI wrapper)☆18Updated 10 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago