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 5 months ago
• erthink / libfptu
  One of the fastest binary representation for JSON-like data.
  ☆37Updated 5 months ago
• tarantool / small
  Specialized memory allocators
  ☆105Updated 3 weeks ago
• danlark1 / miniselect
  Selection and partial sorting algorithms
  ☆137Updated 4 months ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 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 3 years ago
• yandex / handystats
  C++ library for collecting user-defined in-process runtime statistics with low overhead
  ☆98Updated 6 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 8 years ago
• yandex / mms
  Memory-mapped storage library
  ☆76Updated 9 years ago
• vteromero / VTEnc
  VTEnc C library
  ☆37Updated 2 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆52Updated 6 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• PetrPPetrov / beautiful-capi
  Beautiful Capi is a tool which automates the creation of compiler-independent and binary compatible C++ libraries across different C++ co…
  ☆35Updated 2 years ago
• erthink / t1ha
  One of the fastest hash functions.
  ☆352Updated 5 months ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• mulle-concurrent / mulle-concurrent
  📶 A lock- and wait-free hashtable (and an array too)
  ☆109Updated 3 months ago
• komrad36 / SortingNetworks
  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
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 8 years ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆108Updated 7 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
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆139Updated 3 years ago
• fast-pack / LittleIntPacker
  C library to pack and unpack short arrays of integers as fast as possible
  ☆90Updated 2 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆134Updated 6 years ago
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆105Updated 4 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆280Updated last year