Bazist / HArrayLinks
Fastest Trie structure (Linux & Windows)
☆93Updated 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 7 months ago
- One of the fastest binary representation for JSON-like data.☆37Updated 7 months ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Specialized memory allocators☆105Updated 2 months ago
- VTEnc C library☆37Updated 2 years 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
- The world's first Web-scale memory allocator☆109Updated 7 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- One of the fastest hash functions.☆359Updated 7 months ago
- Selection and partial sorting algorithms☆137Updated 6 months ago
- Memory-mapped storage library☆76Updated 9 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆50Updated 4 years ago
- Hashing functions and PRNGs based on them☆163Updated 8 months ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆135Updated 6 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- A C++14 framework for asynchronous I/O, cooperative multitasking and green threads scheduling☆160Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- A dependency-based coroutine scheduler☆45Updated 9 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- A fast alternative to the modulo reduction☆313Updated 4 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆91Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- C++ library for collecting user-defined in-process runtime statistics with low overhead☆98Updated 6 years ago
- 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:☆33Updated last year
- 📶 A lock- and wait-free hashtable (and an array too)☆109Updated 5 months ago
- SIMD (SSE) string functions☆102Updated 8 years ago
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago