Uses of Class
com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl.PrefixTrieNode

Packages that use PrefixTrieImpl.PrefixTrieNode

Package	Description
com.abstractkamen.datastructures.impl.trees.search

Uses of PrefixTrieImpl.PrefixTrieNode in com.abstractkamen.datastructures.impl.trees.search

Methods in com.abstractkamen.datastructures.impl.trees.search that return PrefixTrieImpl.PrefixTrieNode

Modifier and Type	Method	Description
protected PrefixTrieImpl.PrefixTrieNode	PrefixTrieImpl.getRoot()	Get the root of this tree.
protected PrefixTrieImpl.PrefixTrieNode	PrefixTrieImpl.insert(String word, PrefixTrieImpl.PrefixTrieNode root, int i, BiFunction<Integer,PrefixTrieImpl.PrefixTrieNode,PrefixTrieImpl.PrefixTrieNode> factory)	Inserts a word character by character where first a character is lookup in the root and if it's missing a new node is created and appended to the root after which the algorithm is repeated recursively until we reach the end of the word.

Methods in com.abstractkamen.datastructures.impl.trees.search with parameters of type PrefixTrieImpl.PrefixTrieNode

Modifier and Type	Method	Description
protected boolean	PrefixTrieImpl.delete(PrefixTrieImpl.PrefixTrieNode n, String word, int i)	Internal protected delete for this tree implementation.
protected PrefixTrieImpl.PrefixTrieNode	PrefixTrieImpl.insert(String word, PrefixTrieImpl.PrefixTrieNode root, int i, BiFunction<Integer,PrefixTrieImpl.PrefixTrieNode,PrefixTrieImpl.PrefixTrieNode> factory)	Inserts a word character by character where first a character is lookup in the root and if it's missing a new node is created and appended to the root after which the algorithm is repeated recursively until we reach the end of the word.
protected boolean	PrefixTrieImpl.search(PrefixTrieImpl.PrefixTrieNode n, String needle, int i, Collection<String> result, int resultLimit, Predicate<PrefixTrieImpl.PrefixTrieNode> resultTest, StringBuilder currentChars)	Searching method for this trie.
protected boolean	PrefixTrieImpl.shouldDecrementWordOnDelete(PrefixTrieImpl.PrefixTrieNode n)	PrefixTrieImpl.completeWords decrementing condition.
protected boolean	ReversePrefixTrie.shouldDecrementWordOnDelete(PrefixTrieImpl.PrefixTrieNode n)
protected void	PrefixTrieImpl.visitWordNode(PrefixTrieImpl.PrefixTrieNode node, StringBuilder visitor, StringBuilder currentChars)	Visit a node which we know is a word.
protected void	ReversePrefixTrie.visitWordNode(PrefixTrieImpl.PrefixTrieNode node, StringBuilder visitor, StringBuilder currentChars)

Method parameters in com.abstractkamen.datastructures.impl.trees.search with type arguments of type PrefixTrieImpl.PrefixTrieNode

Modifier and Type	Method	Description
protected PrefixTrieImpl.PrefixTrieNode	PrefixTrieImpl.insert(String word, PrefixTrieImpl.PrefixTrieNode root, int i, BiFunction<Integer,PrefixTrieImpl.PrefixTrieNode,PrefixTrieImpl.PrefixTrieNode> factory)	Inserts a word character by character where first a character is lookup in the root and if it's missing a new node is created and appended to the root after which the algorithm is repeated recursively until we reach the end of the word.
protected PrefixTrieImpl.PrefixTrieNode	PrefixTrieImpl.insert(String word, PrefixTrieImpl.PrefixTrieNode root, int i, BiFunction<Integer,PrefixTrieImpl.PrefixTrieNode,PrefixTrieImpl.PrefixTrieNode> factory)	Inserts a word character by character where first a character is lookup in the root and if it's missing a new node is created and appended to the root after which the algorithm is repeated recursively until we reach the end of the word.
protected boolean	PrefixTrieImpl.search(PrefixTrieImpl.PrefixTrieNode n, String needle, int i, Collection<String> result, int resultLimit, Predicate<PrefixTrieImpl.PrefixTrieNode> resultTest, StringBuilder currentChars)	Searching method for this trie.