Function librualg::string::aho_corasick [−][src]
pub fn aho_corasick(dict: &[&str], t: &str) -> BTreeMap<i32, Vec<usize>>
Algorithm Aho Corasick. Search for a set of substring from the dictionary in the given string.
use librualg::string::aho_corasick; use std::collections::BTreeMap; let dict = ["aba", "baba", "cc"]; let t = "ababababa"; let res = aho_corasick(&dict, t); let mut m = BTreeMap::new(); m.insert(0, vec![0, 2, 4, 6]); m.insert(1, vec![1, 3, 5]); assert_eq!(m, res);