Alternatives and similar repositories for binary_cube:

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

• scandum / gridsort
  A stable adaptive partitioning comparison sort.
  ☆207Updated 8 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• scandum / wolfsort
  Wolfsort is a stable adaptive hybrid radix / merge sort.
  ☆196Updated 8 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• scandum / rotate
  A collection of array rotation algorithms.
  ☆153Updated 2 years ago
• Morwenn / poplar-heap
  make_heap and sort_heap for a poplar heap with O(1) extra memory
  ☆40Updated 9 months ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆53Updated 5 years ago
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆25Updated 2 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆109Updated 5 years ago
• apankrat / notes
  Assorted notes
  ☆84Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆45Updated 4 years ago
• s9w / terminal_moo
  ☆22Updated 4 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆118Updated 3 months ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 4 years ago
• patrykstefanski / libfev
  A library for events and fibers
  ☆36Updated 4 years ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆151Updated 2 years ago
• alcover / stricks
  Managed C strings library
  ☆96Updated 3 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• hu55a1n1 / dod
  Tools to facilitate data-oriented design in C99.
  ☆41Updated 4 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆30Updated last year
• Keith-Cancel / k-hash
  A simple single header 64 and 32 bit hash function using only add, sub, ror, and xor.
  ☆78Updated 3 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆83Updated last year
• scandum / twinsort
  An adaptive mergesort
  ☆12Updated 4 years ago
• google / hashtable-benchmarks
  ☆105Updated last year
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆16Updated 6 years ago