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"
  ☆203Updated 5 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
• zwegner / faster-utf8-validator
  A very fast library for validating UTF-8 using AVX2/SSE4 instructions
  ☆219Updated 4 years ago
• apankrat / notes
  Assorted notes
  ☆83Updated last year
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆58Updated 2 months ago
• scandum / gridsort
  A stable adaptive partitioning comparison sort.
  ☆206Updated 8 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• billziss-gh / imap
  Integer Map Data Structure
  ☆130Updated last year
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆118Updated 2 months ago
• codr7 / alang
  A minimal viable programming language on top of liblgpp
  ☆77Updated 4 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
• scandum / rotate
  A collection of array rotation algorithms.
  ☆154Updated 2 years ago
• expr-fi / fastlwc
  SIMD-enhanced word counter
  ☆245Updated 5 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 4 years ago
• igushev / IgushArray
  ☆333Updated 5 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• dosyago / DISCoHAsH
  DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS
  ☆219Updated last year
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 2 months ago
• gueststar / nthm
  Non-preemptive Thread Hierarchy Manager
  ☆55Updated 5 months ago
• attilatorda / Shift-To-Middle_Array
  An innovative data structure for implementing lists and deques
  ☆113Updated last week
• frabert / ClangQL
  Query C++ codebases using SQLite
  ☆187Updated 3 years ago
• kyotov / kysync
  ☆80Updated 3 years ago
• codr7 / libcodr7
  fundamental tools in the spirit of C
  ☆60Updated 5 years ago
• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆346Updated last year
• scandum / binary_search
  A collection of improved binary search algorithms.
  ☆665Updated last year
• Keith-Cancel / Bunki
  A simple C coroutine library.
  ☆226Updated last year
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆309Updated 4 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• dosyago / beamsplitter
  Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS
  ☆91Updated last month