Adds word and associated value. If word already exists, its value is replaced.

Converts trie to Aho-Corasick automaton.

Generator performs Aho-Corasick search string algorithm, yielding tuples containing two values: - position in string

Generator returning all keys and values stored in a trie.

Retrieves output value associated with word. If there is no word returns default value, and if default is not given rises Ke

Generator returning all keys (i.e. word) stored in trie

Wrapper on iter method, callback gets an iterator result

Checks if word is a prefix of any existing word in the trie.

Generator returning all values associated with words stored in a trie.

Checks if whole word is present in the trie.

Generator performs a modified Aho-Corasick search string algorithm, which maches only the longest word.

Clears trie.

Private function retrieving a final node of trie for given word Returns node or None, if the trie doesn't contain the word.

returns bytes or unicode internal buffer */

parse optional indexes used in few functions [start, [end]] */