Alternatives and similar repositories for wolfsort

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

• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• billziss-gh / imap
  Integer Map Data Structure
  ☆129Updated last year
• zwegner / faster-utf8-validator
  A very fast library for validating UTF-8 using AVX2/SSE4 instructions
  ☆219Updated 4 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 4 months ago
• scandum / rotate
  A collection of array rotation algorithms.
  ☆155Updated 2 years ago
• hashlookup / fleur
  Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.
  ☆117Updated 2 years ago
• codr7 / alang
  A minimal viable programming language on top of liblgpp
  ☆77Updated 4 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆120Updated 4 months ago
• apankrat / notes
  Assorted notes
  ☆84Updated last year
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆59Updated 5 months ago
• DO-SAY-GO / DISCoHAsH
  DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS
  ☆218Updated last year
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 4 years ago
• 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
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• mkirchner / hamt
  A hash array-mapped trie implementation in C
  ☆295Updated last year
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆97Updated 5 years ago
• expr-fi / fastlwc
  SIMD-enhanced word counter
  ☆247Updated 5 years ago
• igushev / IgushArray
  ☆333Updated 5 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• c0stya / brzozowski
  Brzozowski derivative python sketch
  ☆85Updated 2 months ago
• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆351Updated last year
• DO-SAY-GO / beamsplitter
  Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS
  ☆91Updated last month
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆97Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• backtrace-labs / slitter
  Slitter is a C- and Rust-callable slab allocator implemented primarily in Rust, with some C for performance or to avoid unstable Rust fea…
  ☆146Updated 3 years ago
• scandum / gridsort
  A stable adaptive partitioning comparison sort.
  ☆207Updated 10 months ago
• kyotov / kysync
  ☆80Updated 3 years ago
• Keith-Cancel / Bunki
  A simple C coroutine library.
  ☆227Updated last year
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆308Updated 4 years ago
• gueststar / nthm
  Non-preemptive Thread Hierarchy Manager
  ☆55Updated 7 months ago