Alternatives and similar repositories for rotate

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

• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆358Updated 2 years ago
• billziss-gh / imap
  Integer Map Data Structure
  ☆133Updated 2 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆79Updated 4 years ago
• skarupke / branchless_binary_search
  A fast binary search that tries to be branchless
  ☆106Updated last year
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated 3 weeks ago
• nadavrot / compressor
  An educational implementation of a modern compressor in Rust
  ☆48Updated 2 years ago
• zwegner / faster-utf8-validator
  A very fast library for validating UTF-8 using AVX2/SSE4 instructions
  ☆219Updated 5 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆76Updated 3 years ago
• scandum / crumsort
  A branchless unstable quicksort / mergesort that is highly adaptive.
  ☆334Updated last year
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆128Updated 3 years ago
• scandum / wolfsort
  Wolfsort is a stable adaptive hybrid radix / merge sort.
  ☆197Updated last year
• mlochbaum / rhsort
  Robin Hood Sort, for uniform data
  ☆75Updated 2 years ago
• expr-fi / fastlwc
  SIMD-enhanced word counter
  ☆253Updated 6 years ago
• jart / morton
  ☆296Updated last year
• google / cwisstable
  Single-header C11 port of https://abseil.io SwissTable
  ☆170Updated 3 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆39Updated 2 years ago
• Voultapher / sort-research-rs
  Test and benchmark suite for sort implementations.
  ☆516Updated last month
• 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…
  ☆148Updated 4 years ago
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆157Updated last year
• apankrat / notes
  Assorted notes
  ☆84Updated 2 years ago
• danielcota / biski64
  A very fast and robust 64-bit PRNG with a minimum 2^64 period.
  ☆151Updated 7 months ago
• skeeto / hash-prospector
  Automated integer hash function discovery
  ☆750Updated last year
• nadavrot / memset_benchmark
  This repository contains high-performance implementations of memset and memcpy in assembly.
  ☆341Updated 4 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 5 years ago
• Keith-Cancel / Bunki
  A simple C coroutine library.
  ☆229Updated 2 years ago
• mkirchner / hamt
  A hash array-mapped trie implementation in C
  ☆323Updated last year
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆98Updated 4 years ago
• oschonrock / binfuse
  c++ library for binary fuse filters, including a sharded filter
  ☆95Updated last year
• hexops / fastfilter
  fastfilter: Binary fuse & xor filters for Zig (faster and smaller than bloom filters)
  ☆289Updated 11 months ago