Alternatives and similar repositories for random-double

Users that are interested in random-double are comparing it to the libraries listed below

• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆26Updated 7 years ago
• abau / cppsat
  Propositional Encodings in C++11
  ☆18Updated 6 years ago
• mfragkoulis / PiCO_QL
  SQL query interface to C++ collections and C data structures. Also configurable as a loadable Linux kernel module and an extension to Val…
  ☆15Updated 7 years ago
• marblestation / benchmark-leapfrog
  ☆19Updated 3 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• siedentop / rapidfuzz
  Experimentation around 'emil-e/rapidcheck' by combining it with libFuzzer
  ☆27Updated 7 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆137Updated 5 months ago
• jedisct1 / metrohash-c
  C version of the MetroHash function
  ☆27Updated 10 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆26Updated 10 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated 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
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 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(…
  ☆50Updated last year
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• JerrySievert / judyarray
  Automatically exported from code.google.com/p/judyarray
  ☆17Updated 10 years ago
• zerovm / zrt
  ZeroVM Run-Time environment
  ☆65Updated 10 years ago
• vkrasnov / vpmadd
  Multiplication using AVX512 and AVX512IFMA instructions
  ☆23Updated 9 years ago
• biometrics / likely
  A compiler intermediate representation for image recognition and heterogeneous computing.
  ☆78Updated 9 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆74Updated 8 years ago
• kripken / cashew
  asm.js parser in C++
  ☆18Updated 9 years ago
• qpfiffer / Simple-Sparsehash
  A simple re-implementation of Google's sparsehash as a learning excercise.
  ☆40Updated last year
• choobin / simple9
  A word-aligned integer compression algorithm.
  ☆13Updated last year
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• felix-lang / judy
  A C library for creating and accessing dynamic arrays with near O(log-base-256) scalability into the peta-element range
  ☆32Updated 14 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago