TrieNode (net.amygdalum:stringsearchalgorithms 0.3.2 API)

Constructors
Constructor and Description
`TrieNode()`

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`addFallback(TrieNode<T> fallback)`
`void`	`addNext(char c, TrieNode<T> node)`
`TrieNode<T>`	`extend(char[] chars)`
`TrieNode<T>`	`extend(char[] chars, int i)`
`T`	`getAttached()`
`TrieNode<T>`	`getFallback()`
`String`	`getMatch()`
`CharObjectMap<TrieNode<T>>`	`getNexts()`
`TrieNode<T>`	`nextNode(char c)`
`TrieNode<T>`	`nextNode(char[] chars)`
`static char[]`	`revert(char[] chars)`
`void`	`setAttached(T attached)`
`void`	`setMatch(String match)`
`String`	`toString()`

public void addNext(char c,
                    TrieNode<T> node)

public CharObjectMap<TrieNode<T>> getNexts()

public void addFallback(TrieNode<T> fallback)

public static char[] revert(char[] chars)

public TrieNode<T> extend(char[] chars)

public TrieNode<T> extend(char[] chars,
                          int i)

public TrieNode<T> nextNode(char[] chars)

Class TrieNode<T>