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
  ☆59Updated last week
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆99Updated this week
• RagnarGrootKoerkamp / PtrHash
  PtrHash minimal perfect hash function
  ☆66Updated 2 weeks ago
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆50Updated 8 months ago
• Daniel-Liu-c0deb0t / cute-nucleotides
  Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.
  ☆129Updated 4 years ago
• lakwet / voracious_sort
  Voracious radix sort
  ☆68Updated last year
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆58Updated last month
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆140Updated last year
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆31Updated last month
• Daniel-Liu-c0deb0t / simple-saca
  Hardware go brrr bounded context suffix array construction algorithm
  ☆18Updated last year
• sdsl-rs / sdsl-rs
  A Rust interface for the Succinct Data Structure Library.
  ☆14Updated 3 years ago
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆108Updated 2 years ago
• ajalab / fm-index
  FM-index for Rust
  ☆22Updated 3 months ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆144Updated this week
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆47Updated 2 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆37Updated 2 years ago
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆125Updated last month
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆89Updated this week
• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆102Updated 3 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• dcjones / coitrees
  A very fast interval tree data structure
  ☆123Updated 6 months ago
• mrkline / piz-rs
  Parallelized zip archive reading
  ☆37Updated 7 months ago
• quickwit-oss / bitpacking
  SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
  ☆310Updated last year
• kno10 / rust-kmedoids
  k-Medoids clustering in Rust with the FasterPAM algorithm
  ☆26Updated this week
• grantslatton / ball-tree
  A ball-tree implementation for K-NN
  ☆17Updated 10 months ago
• vigna / webgraph-rs
  A Rust port of the WebGraph framework
  ☆55Updated last week
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆63Updated last month
• TravisWheelerLab / sufr
  Parallel Construction of Suffix Arrays in Rust
  ☆25Updated 3 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆31Updated 3 months ago