Alternatives and similar repositories for fast_hilbert_curve

Users that are interested in fast_hilbert_curve are comparing it to the libraries listed below

• dryman / hash_bench
  Popular hash table implementation benchmarks
  ☆27Updated 8 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• haberman / dumpfp
  A small little tool for dumping a floating-point number in its native format
  ☆55Updated 10 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• kagiannis / FPC
  FPC - Fast Prefix Coder
  ☆30Updated 3 years ago
• deplinenoise / sse-expr
  Generate SSE expressions from prefix expressions
  ☆20Updated 14 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 4 months ago
• sneves / avx512-utils
  AVX-512 utilities
  ☆20Updated 10 years ago
• regehr / nibble-sort
  Many functions in C for sorting the nibbles in an 8-byte word
  ☆33Updated 10 years ago
• dpt / Aha
  A tweaked version of Aha! ("A Hacker's Assistant") the superoptimiser by Henry S. Warren
  ☆58Updated 3 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 6 months ago
• blynn / blt
  Crit-bit tree (trie) library
  ☆32Updated 11 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 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
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• richgel999 / sserangecoding
  Fast vectorized (SSE 4.1) range coder for 8-bit alphabets
  ☆25Updated 2 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• Bulat-Ziganshin / FARSH
  Fast and Reliable (but not Secure) Hash
  ☆54Updated 7 years ago
• burtonsamograd / anser
  A header only Boolean Propagator Network framework for the omni-directional computation of Integer mathematical functions and computation…
  ☆14Updated 7 years ago
• libtom / libtompoly
  ☆38Updated 2 years ago
• ishiura-compiler / CF3
  "CF3" is a C compiler test suite targeting arithmetic optimization.
  ☆37Updated 8 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆59Updated 6 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago