degski / uniform_int_distribution_fast

Related projects ⓘ

Alternatives and complementary repositories for uniform_int_distribution_fast

• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 3 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆37Updated 7 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 10 months ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆21Updated 7 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 4 years ago
• jnorthrup / patl
  Roman Klyujkov's Practical Algorithm Template library
  ☆23Updated 2 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆41Updated 4 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 8 months ago
• tower120 / trackable_ptr
  Smart pointer for any movable objects. When trackable object moved/destroyed, trackers updated with new object's pointer.
  ☆25Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆63Updated 3 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆90Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• ronmrdechai / Pie
  Provide an idiomatic C++ interface to CPython's C API.
  ☆27Updated 7 years ago
• aguinet / pector
  A C++11 std::vector-compliant implementation with a customizable size type and growing algorithm
  ☆67Updated 9 years ago
• kobalicek / mpsl
  Shader-Like Mathematical Expression JIT Engine for C++ Language
  ☆58Updated 5 years ago
• vreverdy / bit-algorithms
  An exploratory implementation of bit overloads of the C++ standard algorithms
  ☆18Updated 3 years ago
• HDembinski / stateful_pointer
  Use unused bits in your pointer
  ☆46Updated 7 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆60Updated 9 months ago
• essennell / narl
  Not Another Range Library
  ☆39Updated 10 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 2 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆103Updated 5 years ago
• orlp / devector
  Resizable contiguous sequence container with fast appends on either end.
  ☆37Updated 7 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆12Updated 7 months ago