Bazist / HArrayLinks
Fastest Trie structure (Linux & Windows)
☆92Updated 2 years ago
Alternatives and similar repositories for HArray
Users that are interested in HArray are comparing it to the libraries listed below
Sorting:
- Ultra fast compact embedded database for tabular and semistructured data.☆135Updated 6 months ago
- One of the fastest binary representation for JSON-like data.☆37Updated 6 months ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆87Updated 3 years ago
- Specialized memory allocators☆105Updated last month
- Memory-mapped storage library☆76Updated 9 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- C++14 cache friendly B-heap priority queue☆106Updated 4 years ago
- C++ library for collecting user-defined in-process runtime statistics with low overhead☆98Updated 6 years ago
- Compile-time TRIE based string matcher (C++11)☆52Updated 6 years ago
- One of the fastest hash functions.☆359Updated 6 months ago
- Beautiful Capi is a tool which automates the creation of compiler-independent and binary compatible C++ libraries across different C++ co…☆36Updated 3 years ago
- Selection and partial sorting algorithms☆137Updated 4 months ago
- The world's first Web-scale memory allocator☆108Updated 7 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- VTEnc C library☆37Updated 2 years ago
- 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:☆32Updated last year
- Implementation of argon2 (i, d, id) algorithms with CPU dispatching☆83Updated 4 years ago
- 📶 A lock- and wait-free hashtable (and an array too)☆109Updated 4 months ago
- Hashing functions and PRNGs based on them☆162Updated 7 months ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆61Updated 2 years ago
- A dependency-based coroutine scheduler☆45Updated 8 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆135Updated 6 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆48Updated 4 years ago
- A C++14 framework for asynchronous I/O, cooperative multitasking and green threads scheduling☆160Updated 7 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Embedded storage benchmarking tool☆139Updated 3 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- A fast alternative to the modulo reduction☆311Updated 4 years ago