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
  ☆51Updated 2 months ago
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆50Updated 2 months ago
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆82Updated last year
• RagnarGrootKoerkamp / PtrHash
  PTRHash minimal perfect hash function, based of PTHash
  ☆41Updated last month
• lakwet / voracious_sort
  Voracious radix sort
  ☆65Updated last year
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆56Updated last year
• Daniel-Liu-c0deb0t / simple-saca
  Hardware go brrr bounded context suffix array construction algorithm
  ☆18Updated last year
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆133Updated 3 months ago
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆139Updated 6 months ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆47Updated 3 weeks ago
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆69Updated 2 weeks ago
• sdsl-rs / sdsl-rs
  A Rust interface for the Succinct Data Structure Library.
  ☆14Updated 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.
  ☆27Updated 2 months ago
• Daniel-Liu-c0deb0t / cute-nucleotides
  Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.
  ☆116Updated 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…
  ☆106Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆79Updated last month
• fulmicoton / fastdivide
  ☆23Updated 2 months ago
• TravisWheelerLab / sufr
  Parallel Construction of Suffix Arrays in Rust
  ☆22Updated this week
• fasterthanlime / stringsearch
  Collection of techniques for (binary) string searching
  ☆22Updated 5 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• vigna / webgraph-rs
  A Rust port of the WebGraph framework
  ☆35Updated this week
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆23Updated 4 months ago
• velvia / compressed-vec
  SIMD Floating point and integer compressed vector library
  ☆79Updated last year
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆58Updated 9 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated last year