Alternatives and similar repositories for teddy

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

• quickwit-oss / bitpacking
  SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
  ☆310Updated last year
• flier / rust-fasthash
  A suite of non-cryptographic hash functions for Rust.
  ☆139Updated 3 years ago
• BurntSushi / rust-stats
  Basic statistical functions on streams for Rust.
  ☆86Updated 2 years ago
• RoaringBitmap / croaring-rs
  Rust FFI wrapper for CRoaring
  ☆158Updated last month
• flier / rust-t1ha
  Rust implementation for T1HA (Fast Positive Hash)
  ☆90Updated last year
• llogiq / bytecount
  Counting occurrences of a given byte or UTF-8 characters in a slice of memory – fast
  ☆230Updated 2 months ago
• rust-bakery / parser_benchmarks
  Benchmarks for the nom, the Rust parser combinators library
  ☆128Updated last year
• michaelsproul / rust_radix_trie
  Fast generic radix trie implemented in Rust
  ☆202Updated 2 years ago
• sujayakar / rsdict
  ☆48Updated last month
• frankmcsherry / columnar
  High-throughput columnar serialization in Rust
  ☆181Updated 2 weeks ago
• prataprc / xorfilter
  Rust library implementing xor-filters
  ☆140Updated 2 years ago
• sdleffler / qp-trie-rs
  An idiomatic and fast QP-trie implementation in pure Rust.
  ☆101Updated last year
• kinghajj / deque
  A (mostly) lock-free concurrent work-stealing deque in Rust.
  ☆239Updated 2 years ago
• wagnerf42 / rayon-adaptive
  adaptive algorithms for rayon
  ☆39Updated 5 years ago
• cuviper / probe-rs
  probe: Static probes for Rust
  ☆96Updated 2 years ago
• BurntSushi / nakala
  A low level embedded information retrieval system.
  ☆45Updated 4 years ago
• Amanieu / hashbrown
  Rust port of Google's SwissTable hash map
  ☆56Updated 3 months ago
• erickt / rust-serialization-benchmarks
  ☆92Updated 4 years ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆91Updated last year
• MnO2 / cedarwood
  Efficiently-updatable double-array trie in Rust (ported from cedar)
  ☆104Updated 2 years ago
• cloudflare / sliceslice-rs
  A fast implementation of single-pattern substring search using SIMD acceleration.
  ☆97Updated 10 months ago
• facebookarchive / rust-partial-io
  Rust library that provides helpers for testing resilience of IO operations
  ☆144Updated 3 years ago
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆141Updated last year
• crossbeam-rs / crossbeam-epoch
  Epoch-based garbage collection
  ☆81Updated 6 years ago
• velvia / compressed-vec
  SIMD Floating point and integer compressed vector library
  ☆80Updated last year
• BurntSushi / ucd-generate
  A command line tool to generate Unicode tables as source code.
  ☆109Updated 10 months ago
• crepererum-oss / pdatastructs.rs
  Simple probabilistic data structures
  ☆147Updated this week
• rust-lang / odht
  An on-disk hash table implementation
  ☆124Updated 3 years ago
• BurntSushi / suffix
  Fast suffix arrays for Rust (with Unicode support).
  ☆274Updated last year
• eugene-bulkin / rust-bk-tree
  A BK-tree implementation in Rust.
  ☆40Updated last year