tommyettinger / waterhash

Related projects ⓘ

Alternatives and complementary repositories for waterhash

• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 4 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 11 months ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 3 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 2 years ago
• vreverdy / bit-algorithms
  An exploratory implementation of bit overloads of the C++ standard algorithms
  ☆18Updated 3 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆63Updated 3 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆41Updated last year
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆12Updated 8 months ago
• ConorStokes / LZSSE
  LZ77/LZSS designed for SSE based decompression
  ☆135Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 4 years ago
• martinmoene / byte-lite
  byte lite - A C++17-like byte type for C++98, C++11 and later in a single-file header-only library
  ☆53Updated 5 months ago
• komrad36 / FastArrayOps
  Extremely fast x86 / AVX2 assembly implementations of common operations for linear arrays: checking whether array contains element, findi…
  ☆37Updated 3 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 4 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
• Kronuz / constexpr-phf
  Computes a constexpr (minimal) perfect hash function
  ☆35Updated 5 years ago
• sawickiap / str_view
  Null-termination-aware string-view class for C++
  ☆24Updated last year
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• mattreecebentley / plf_rand
  A replacement for rand()/srand() that's ~700% faster and typically has better statistical distribution. An adaptationof Melissa O'Neill's…
  ☆14Updated 7 months ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆82Updated last year
• martinmoene / type-lite
  type - Strong types for C++98, C++11 and later in a single-file header-only library
  ☆36Updated 5 months ago
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆43Updated 3 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆29Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year