mavam / compbenchLinks
Benchmark and visualization of various compression algorithms
☆23Updated 9 years ago
Alternatives and similar repositories for compbench
Users that are interested in compbench are comparing it to the libraries listed below
Sorting:
- A C++ library for integer array compression☆29Updated 3 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- For details, see the blog post:☆34Updated last year
- Linear vs binary search benchmark☆41Updated 5 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
- Shader-Like Mathematical Expression JIT Engine for C++ Language☆59Updated 6 years ago
- A C++11 std::vector-compliant implementation with a customizable size type and growing algorithm☆69Updated 10 years ago
- Vectorized version of the PCG random number generator☆84Updated 9 months ago
- Bloom filter alternative (C++)☆18Updated 7 years ago
- Compile-time printf-like string formatting☆77Updated 7 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆35Updated 9 years ago
- Marlin: high throughput entropy compressor☆30Updated 2 years ago
- Fast and Reliable (but not Secure) Hash☆54Updated 7 years ago
- Overridable universal operator overloading for C++14☆20Updated 11 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- Implementation of hash_append proposal☆67Updated 8 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 12 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 6 years ago
- ☆13Updated 9 years ago
- Not Another Range Library☆39Updated 11 years ago
- Optimized for systems that read and write large blobs.☆12Updated 10 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- make_heap and sort_heap for a poplar heap with O(1) extra memory☆41Updated last year
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆65Updated last month
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Live Asynchronous Visualized Architecture☆98Updated 6 years ago
- ☆31Updated 9 years ago
- A header-only, modern C++, library for terminal colours and cursor manipulation☆17Updated 7 years ago