Alternatives and similar repositories for cpp-tdigest

Users that are interested in cpp-tdigest are comparing it to the libraries listed below

• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 6 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆133Updated 6 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
• derrickburns / tdigest
  C++ version of Ted Dunning's merging t-digest
  ☆27Updated 4 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
  ☆54Updated last year
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• duckie / named_types
  A C++14/17 implementation of named tuples
  ☆71Updated 11 months ago
• dw / csvmonkey
  Header-only vectorized, lazy-decoding, zero-copy CSV file parser
  ☆99Updated last year
• LoopPerfect / valuable
  A C++ smart-pointer with value-semantics 💎
  ☆131Updated 5 years ago
• duckie / boson
  A C++14 framework for asynchronous I/O, cooperative multitasking and green threads scheduling
  ☆160Updated 7 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• google / hashtable-benchmarks
  ☆108Updated last year
• heal-research / vstat
  SIMD-enabled descriptive statistics (mean, variance, covariance, correlation)
  ☆18Updated 4 months ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆38Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• pdziepak / ranges-gpu
  Experimental ranges for CUDA
  ☆25Updated 6 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 5 months ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago
• sengelha / streaming-percentiles
  Cross-platform, multi-language implementation of multiple streaming percentile algorithms
  ☆64Updated 2 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• LoopPerfect / conduit
  High Performance Streams Based on Coroutine TS ⚡
  ☆149Updated 6 years ago
• NanXiao / ump
  A universal thread-safe memory pool.
  ☆26Updated 7 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 4 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago