Alternatives and similar repositories for qwt

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

• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆66Updated this week
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆100Updated 2 months ago
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆51Updated 11 months ago
• RagnarGrootKoerkamp / PtrHash
  PtrHash minimal perfect hash function
  ☆77Updated last month
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆144Updated last year
• lakwet / voracious_sort
  Voracious radix sort
  ☆69Updated last year
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆30Updated 4 months ago
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆57Updated 4 months ago
• Daniel-Liu-c0deb0t / cute-nucleotides
  Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.
  ☆128Updated 4 years ago
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆109Updated 2 years ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆150Updated last month
• sdsl-rs / sdsl-rs
  A Rust interface for the Succinct Data Structure Library.
  ☆13Updated 3 years ago
• grantslatton / ball-tree
  A ball-tree implementation for K-NN
  ☆17Updated last year
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆127Updated last week
• Daniel-Liu-c0deb0t / simple-saca
  Hardware go brrr bounded context suffix array construction algorithm
  ☆18Updated last year
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆46Updated last month
• ajalab / fm-index
  FM-index for Rust
  ☆23Updated 5 months ago
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆97Updated 2 months ago
• ashvardanian / ForkUnion
  Lower-latency OpenMP-style minimalistic scoped thread-pool designed for 'Fork-Join' parallelism in Rust and C++, avoiding memory allocati…
  ☆276Updated last week
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 2 years ago
• vigna / webgraph-rs
  A Rust port of the WebGraph framework
  ☆56Updated last week
• JakubValtar / radsort
  Radix sort implementation for sorting by scalar keys (integers, floats, chars, bools)
  ☆25Updated last year
• quickwit-oss / bitpacking
  SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
  ☆316Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• mrkline / piz-rs
  Parallelized zip archive reading
  ☆38Updated 10 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• dcjones / coitrees
  A very fast interval tree data structure
  ☆125Updated 8 months ago
• rust-math / intel-mkl-src
  Redistribute Intel MKL as a crate
  ☆89Updated last year
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• jeffrey-xiao / probabilistic-collections-rs
  ☆15Updated 2 years ago