| add(const string &str, int str_index, int node_index, int id) | Trie< char_size+1, margin > | inline |
| add(const string &str, int id) | Trie< char_size+1, margin > | inline |
| add(const string &str) | Trie< char_size+1, margin > | inline |
| build(bool heavy=true) | AhoCorasick< char_size, margin > | inline |
| correct | AhoCorasick< char_size, margin > | |
| count() const | Trie< char_size+1, margin > | inline |
| count(const string &s) | Trie< char_size+1, margin > | inline |
| erase(const string &s) | Trie< char_size+1, margin > | inline |
| FAIL | AhoCorasick< char_size, margin > | |
| insert(const string &s) | Trie< char_size+1, margin > | inline |
| match(const string &str, int now=0) | AhoCorasick< char_size, margin > | inline |
| move(const char &c, int now=0) | AhoCorasick< char_size, margin > | inline |
| move(const string &str, int now=0) | AhoCorasick< char_size, margin > | inline |
| Node typedef | Trie< char_size+1, margin > | |
| nodes | Trie< char_size+1, margin > | |
| query(const string &str, const function< void(int)> &f, int str_index, int node_index) | Trie< char_size+1, margin > | inline |
| query(const string &str, const function< void(int)> &f) | Trie< char_size+1, margin > | inline |
| root | Trie< char_size+1, margin > | |
| size() const | Trie< char_size+1, margin > | inline |
| Trie() | Trie< char_size+1, margin > | inline |
| Trie(int len) | Trie< char_size+1, margin > | inline |
| update_child(int node, int child, int id) | Trie< char_size+1, margin > | inline |
| update_direct(int node, int id) | Trie< char_size+1, margin > | inline |
1.13.2