Struct generalized_suffix_tree::GeneralizedSuffixTree

pub struct GeneralizedSuffixTree { /* fields omitted */ }

This is the generalized suffix tree, implemented using Ukkonen's Algorithm. One important modification to the algorithm is that this is no longer an online algorithm, i.e. it only accepts strings fully provided to the suffix tree, instead of being able to stream processing each string. It is not a fundamental limitation and can be supported.

Examples

use generalized_suffix_tree::GeneralizedSuffixTree;
let mut tree = GeneralizedSuffixTree::new();
tree.add_string(String::from("abcdabce"));
tree.add_string(String::from("cdefdefg"));
println!("{}", tree.is_suffix("bce"));

Methods

impl GeneralizedSuffixTree

pub fn new() -> GeneralizedSuffixTree

pub fn add_string(&mut self, s: String)

Add a new string to the generalized suffix tree.

pub fn longest_common_substring(&self) -> String

Find the longest common substring among all strings in the suffix.

pub fn is_suffix(&self, s: &str) -> bool

Checks whether a given string s is a suffix in the suffix tree.

pub fn is_substr(&self, s: &str) -> bool

Checks whether a given string s is a substring of any of the strings in the suffix tree.

pub fn pretty_print(&self)

Trait Implementations

impl Debug for GeneralizedSuffixTree

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.