Bazist / HArray
Fastest Trie structure (Linux & Windows)
☆92Updated last year
Related projects ⓘ
Alternatives and complementary repositories for HArray
- Ultra fast compact embedded database for tabular and semistructured data.☆133Updated 2 years ago
- One of the fastest binary representation for JSON-like data.☆36Updated 2 years ago
- Specialized memory allocators☆102Updated this week
- Fast Positive Hash - just the fastest portable hash function.☆34Updated 3 years ago
- The world's first Web-scale memory allocator☆105Updated 6 years ago
- Memory-mapped storage library☆76Updated 8 years ago
- C++ library for collecting user-defined in-process runtime statistics with low overhead☆97Updated 5 years ago
- dariadb - is a numeric time-series database storage engine.☆22Updated 6 years ago
- Beautiful Capi is a tool which automates the creation of compiler-independent and binary compatible C++ libraries across different C++ co…☆33Updated 2 years ago
- The world's first wait-free Software Transactional Memory☆169Updated 4 years ago
- SObjectizer: it's all about in-process message dispatching!☆88Updated 4 years ago
- Selection and partial sorting algorithms☆132Updated 3 months ago
- One of the fastest hash functions☆345Updated 2 years ago
- Synchronous asynchrony using coroutines☆117Updated 7 years ago
- A C++ library for integer array compression☆27Updated 2 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆88Updated 3 years ago
- Inlining Automagical Metaprogramming Analytical Differentiation☆49Updated 8 years ago
- A dependency-based coroutine scheduler☆46Updated 8 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆50Updated 9 months ago
- High-performance multicore-scalable data structures and benchmarks☆138Updated 5 years ago
- Compile-time TRIE based string matcher (C++11)☆50Updated 5 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 5 years ago
- For details, see the blog post:☆31Updated 11 months ago
- Implementation of argon2 (i, d, id) algorithms with CPU dispatching☆81Updated 3 years ago
- Optimized for systems that read and write large blobs.☆12Updated 9 years ago
- Experimental library for currying in C++17☆78Updated last year
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 7 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- Fast and Reliable (but not Secure) Hash☆53Updated 6 years ago