suffix_trie 0.1.0

Suffix trie for searching
Documentation
  • Coverage
  • 50%
    3 out of 6 items documented1 out of 1 items with examples
  • Size
  • Source code size: 10.3 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 1.66 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 10s Average build duration of successful builds.
  • all releases: 10s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • EgorGorshen/suffix-tier
    1 0 0
  • crates.io
  • Dependencies
    • —
  • Versions
  • Owners
  • EgorGorshen

Suffix Trie Library

This Rust library provides a flexible and efficient implementation of a Suffix Trie data structure, ideal for applications involving string searches, autocomplete systems, and other text processing tasks. It supports adding words, searching by prefix, and collecting all suffixes or substrings that match a given prefix.

Features

  • Efficient string insertion and search
  • Support for collecting all suffixes matching a given prefix
  • Ideal for autocomplete systems, text processing, and pattern matching

Installation

Add this to your Cargo.toml:

[dependencies]
suffix_trie = "0.1.0"

Usage

Here's a quick example to get you started:

use suffix_trie::SuffixTrie;

let mut trie = SuffixTrie::new();
trie.add_suffix("hello".to_string());
trie.add_suffix("helium".to_string());

if let Some(suffixes) = trie.find_prefixes("he") {
    for suffix in suffixes {
        println!("{}", suffix);
    }
}

Running Tests

To run tests, use the following command:

cargo test

Contributing

Contributions are welcome! Please feel free to submit pull requests, create issues, or suggest improvements.

source links

TODO

  • None