gpichot / cpp-tdigest

Related projects: ⓘ

• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• andralex / MedianOfNinthers
  ☆49Updated 4 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆47Updated 3 years ago
• lemire / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆48Updated 7 months ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 6 months ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 5 years ago
• pmntang / SIMD-Visualiser
  ☆20Updated this week
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆49Updated 6 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 9 months ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 5 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆28Updated 5 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆24Updated 4 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆26Updated 4 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 4 years ago
• espindola / cthulhu
  ☆11Updated 11 months ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 3 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated 5 months ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• NanXiao / ump
  A universal thread-safe memory pool.
  ☆26Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆50Updated 7 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆67Updated 7 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• efficient / fast-succinct-trie
  ☆24Updated 7 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆38Updated 4 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 11 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆75Updated 5 years ago