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
  ☆67Updated 3 weeks ago
• RagnarGrootKoerkamp / PtrHash
  PtrHash minimal perfect hash function
  ☆87Updated 4 months ago
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆101Updated 5 months ago
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆53Updated 2 weeks ago
• lakwet / voracious_sort
  Voracious radix sort
  ☆71Updated last month
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆146Updated last year
• ajalab / fm-index
  FM-index for Rust
  ☆26Updated 8 months ago
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆58Updated 7 months ago
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆31Updated 6 months ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆46Updated 2 weeks ago
• sdsl-rs / sdsl-rs
  A Rust interface for the Succinct Data Structure Library.
  ☆14Updated 3 years ago
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆127Updated 3 weeks ago
• Daniel-Liu-c0deb0t / simple-saca
  Hardware go brrr bounded context suffix array construction algorithm
  ☆19Updated 2 years ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆151Updated 3 months 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
• Daniel-Liu-c0deb0t / cute-nucleotides
  Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.
  ☆129Updated 5 years ago
• kno10 / rust-kmedoids
  k-Medoids clustering in Rust with the FasterPAM algorithm
  ☆27Updated 3 months ago
• grantslatton / ball-tree
  A ball-tree implementation for K-NN
  ☆17Updated last year
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆102Updated 2 months ago
• quickwit-oss / bitpacking
  SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
  ☆321Updated this week
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• ashvardanian / ForkUnion
  Lower-latency OpenMP-style minimalistic scoped thread-pool designed for 'Fork-Join' parallelism in Rust and C++, avoiding memory allocati…
  ☆302Updated 2 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• mrkline / piz-rs
  Parallelized zip archive reading
  ☆38Updated last year
• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆104Updated 8 months ago
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆69Updated 6 months 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.
  ☆34Updated 9 months ago
• lukaesch / diskann-rs
  DiskANNrs
  ☆30Updated last month
• dcjones / coitrees
  A very fast interval tree data structure
  ☆127Updated 11 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 3 years ago