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
  ☆58Updated last week
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆98Updated 4 months ago
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆50Updated 7 months ago
• RagnarGrootKoerkamp / PtrHash
  PtrHash minimal perfect hash function, based of PTHash
  ☆64Updated last month
• Daniel-Liu-c0deb0t / simple-saca
  Hardware go brrr bounded context suffix array construction algorithm
  ☆18Updated last year
• lakwet / voracious_sort
  Voracious radix sort
  ☆68Updated last year
• Daniel-Liu-c0deb0t / cute-nucleotides
  Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.
  ☆127Updated 4 years ago
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆31Updated last month
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆140Updated last year
• sdsl-rs / sdsl-rs
  A Rust interface for the Succinct Data Structure Library.
  ☆14Updated 3 years ago
• ajalab / fm-index
  FM-index for Rust
  ☆22Updated 2 months ago
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆58Updated last month
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆144Updated this week
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆119Updated 2 weeks ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆47Updated last month
• ashvardanian / fork_union
  Low(est?)-latency OpenMP-style minimalistic scoped thread-pool designed for 'Fork-Join' parallelism in Rust and C++, avoiding memory allo…
  ☆85Updated last week
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆107Updated 2 years ago
• TravisWheelerLab / sufr
  Parallel Construction of Suffix Arrays in Rust
  ☆24Updated 2 months ago
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆89Updated last month
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 10 months ago
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆63Updated 2 weeks ago
• dcjones / coitrees
  A very fast interval tree data structure
  ☆123Updated 5 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆36Updated 2 years ago
• JakubValtar / radsort
  Radix sort implementation for sorting by scalar keys (integers, floats, chars, bools)
  ☆22Updated 10 months ago
• vigna / webgraph-rs
  A Rust port of the WebGraph framework
  ☆54Updated last week
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆30Updated 3 months ago
• grantslatton / ball-tree
  A ball-tree implementation for K-NN
  ☆16Updated 9 months ago
• petabi / petal-decomposition
  Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)
  ☆21Updated 3 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• kno10 / rust-kmedoids
  k-Medoids clustering in Rust with the FasterPAM algorithm
  ☆24Updated 7 months ago