Alternatives and similar repositories for ext-sort-rs:

Users that are interested in ext-sort-rs are comparing it to the libraries listed below

• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆92Updated last year
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆106Updated last year
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆79Updated 3 weeks ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆47Updated last week
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆67Updated last week
• dpc / pariter
  Parallel iterator processing library for Rust
  ☆101Updated last year
• vigna / epserde-rs
  An ε-copy serialization/deserialization framework for Rust
  ☆135Updated 5 months ago
• mcuelenaere / porigon
  Lightweight FST-based autocompleter library written in Rust, targeting WebAssembly and data stored in-memory
  ☆32Updated last year
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆57Updated 9 months ago
• sarah-quinones / pulp
  ☆215Updated this week
• sstadick / gzp
  Multi-threaded Compression
  ☆154Updated 9 months ago
• zommiommy / mem_dbg-rs
  A trait + derive to recursively compute / print the memory usage of a data structure.
  ☆25Updated last week
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆51Updated last month
• Crazytieguy / gat-lending-iterator
  ☆21Updated 4 months ago
• jean-pierreBoth / annembed
  data embedding based on approximate nearest neighbour
  ☆32Updated last week
• A1-Triard / dyn-fmt
  Provides dynamic string format.
  ☆24Updated 4 months ago
• rust-lang / odht
  An on-disk hash table implementation
  ☆113Updated 3 years ago
• nickbabcock / highway-rs
  Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function
  ☆160Updated last week
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆138Updated 6 months ago
• frjnn / bhtsne
  Parallel Barnes-Hut t-SNE implementation written in Rust.
  ☆73Updated 3 months ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆89Updated 10 months ago
• polazarus / hipstr
  Yet another string type for Rust
  ☆79Updated last week
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆133Updated 9 months ago
• iai-callgrind / iai-callgrind
  High-precision and consistent benchmarking framework/harness for Rust
  ☆109Updated this week
• LaihoE / SIMD-itertools
  Faster implementations of standard library operations like find, filter, position etc.
  ☆172Updated 5 months ago
• tomtomwombat / fastbloom
  The fastest Bloom filter in Rust. No accuracy compromises. Compatible with any hasher.
  ☆196Updated last month
• Robbepop / string-interner
  A data structure to efficiently intern, cache and restore strings.
  ☆181Updated 2 months ago
• alecmocatta / cap
  An allocator that can track and limit memory usage.
  ☆205Updated last year
• main-- / rust-intervaltree
  ☆19Updated 11 months ago
• bazhenov / tango
  Rust microbenchmarking harness based on paired-testing methodology
  ☆83Updated 2 weeks ago