Alternatives and similar repositories for fcsd

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

• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆98Updated 3 months ago
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆40Updated last year
• kampersanda / tongrams-rs
  Rust library providing fast language model queries in compressed space
  ☆24Updated 2 years ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆58Updated last week
• ajalab / fm-index
  FM-index for Rust
  ☆22Updated last month
• daac-tools / trie-match
  Fast match expression optimized for string comparison
  ☆38Updated last year
• laysakura / trie-rs
  Memory efficient trie (prefix tree) library based on LOUDS
  ☆124Updated 3 months ago
• k-yomo / ostrich
  WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy
  ☆14Updated 2 years ago
• sile / raftbare
  Minimal but feature-complete, I/O-free implementation of Raft distributed consensus algorithm for Rust.
  ☆23Updated 6 months ago
• lerouxrgd / ngt-rs
  Rust wrappers for NGT approximate nearest neighbor search
  ☆38Updated last year
• TaKO8Ki / regexm
  A Rust macro for writing regex pattern matching.
  ☆49Updated 4 years ago
• jonhoo / rust-zipf
  Rust implementation of a fast, bounded, Zipf-distributed random number generator
  ☆34Updated 4 months ago
• rossanoventurini / qwt
  A Rust implementation of the Quad Wavelet Tree
  ☆42Updated last month
• zommiommy / mem_dbg-rs
  A trait + derive to recursively compute / print the memory usage of a data structure.
  ☆33Updated 4 months ago
• termoshtt / katexit
  Insert KaTeX autorender script into rustdoc
  ☆20Updated last month
• fujita / greeter
  ☆64Updated 4 years ago
• osyoyu / tantivy-tokenizer-tiny-segmenter
  A Japanese tokenizer for Tantivy, based on TinySegmenter.
  ☆14Updated 4 years ago
• daac-tools / daachorse
  🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
  ☆220Updated 2 weeks ago
• sekineh / wavelet-matrix-rs
  Wavelet Matrix implementation written in Rust
  ☆14Updated 2 years ago
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆139Updated last year
• daac-tools / crawdad
  🦞 Rust library of natural language dictionaries using character-wise double-array tries.
  ☆31Updated 5 months ago
• qnighy / omniswap
  a crate to swap values between possibly-overlapping references
  ☆23Updated 2 years ago
• laysakura / fid-rs
  High performance FID (Fully Indexable Dictionary) library
  ☆25Updated 11 months ago
• rust-math / sfmt
  Rust implementation of SIMD-oriented Fast Mersenne Twister (SFMT) using stable SIMD
  ☆33Updated 3 years ago
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆119Updated 2 weeks ago
• otake84 / dlhn
  DLHN implementation for Rust
  ☆169Updated last year
• fulmicoton / kuromoji-rs
  Japanese tokenizer for rust
  ☆35Updated 5 years ago
• dalance / cargo-trend
  Cargo subcommand to generate trend graph of dependent crates
  ☆31Updated this 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
• taiki-e / iter-enum
  #[derive(Iterator, DoubleEndedIterator, ExactSizeIterator, FusedIterator, Extend)] for enums.
  ☆14Updated 3 months ago