Alternatives and similar repositories for HArray

Users that are interested in HArray are comparing it to the libraries listed below

• erthink / libfpta
  Ultra fast compact embedded database for tabular and semistructured data.
  ☆135Updated 10 months ago
• erthink / libfptu
  One of the fastest binary representation for JSON-like data.
  ☆37Updated 10 months ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆87Updated 4 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 9 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• tarantool / small
  Specialized memory allocators
  ☆106Updated 4 months ago
• yandex / handystats
  C++ library for collecting user-defined in-process runtime statistics with low overhead
  ☆98Updated 6 years ago
• danlark1 / miniselect
  Selection and partial sorting algorithms
  ☆137Updated 8 months ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆174Updated 5 years ago
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆109Updated 2 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated 2 years ago
• WojciechMula / simd-string
  SIMD (SSE) string functions
  ☆103Updated 8 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆120Updated 8 years ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆109Updated 7 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆53Updated 6 years ago
• fast-pack / FrameOfReference
  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
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆166Updated 2 weeks ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated last month
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆65Updated last month
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆314Updated 4 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• Remi-Coulom / joedb
  Joedb, the Journal-Only Embedded Database
  ☆103Updated 3 weeks ago
• yandex / mms
  Memory-mapped storage library
  ☆76Updated 9 years ago
• yandex / argon2
  Implementation of argon2 (i, d, id) algorithms with CPU dispatching
  ☆82Updated 4 years ago