Uses of Class
pt.tumba.spell.TernarySearchTrie.TSTNode

Uses of TernarySearchTrie.TSTNode in pt.tumba.spell

Fields in pt.tumba.spell declared as TernarySearchTrie.TSTNode

protected TernarySearchTrie.TSTNode[]	TernarySearchTrie.TSTNode.relatives The relative nodes.
private TernarySearchTrie.TSTNode	TernarySearchTrie.rootNode The base node in the trie.

Methods in pt.tumba.spell that return TernarySearchTrie.TSTNode

private TernarySearchTrie.TSTNode	TernarySearchTrie.deleteNodeRecursion(TernarySearchTrie.TSTNode currentNode) Recursivelly visits each node to be deleted.
TernarySearchTrie.TSTNode	TernarySearchTrie.getNode(java.lang.String key) Returns the node indexed by key, or null if that node doesn't exist.
protected TernarySearchTrie.TSTNode	TernarySearchTrie.getNode(java.lang.String key2, TernarySearchTrie.TSTNode startNode) Returns the node indexed by key, or null if that node doesn't exist.
protected TernarySearchTrie.TSTNode	TernarySearchTrie.getOrCreateNode(java.lang.String key) Returns the node indexed by key, creating that node if it doesn't exist, and creating any required intermediate nodes if they don't exist.

Methods in pt.tumba.spell with parameters of type TernarySearchTrie.TSTNode

private void	TernarySearchTrie.deleteNode(TernarySearchTrie.TSTNode nodeToDelete) Deletes the node passed in as an argument.
private TernarySearchTrie.TSTNode	TernarySearchTrie.deleteNodeRecursion(TernarySearchTrie.TSTNode currentNode) Recursivelly visits each node to be deleted.
protected java.lang.String	TernarySearchTrie.getKey(TernarySearchTrie.TSTNode node) Returns the key that indexes the node argument.
protected TernarySearchTrie.TSTNode	TernarySearchTrie.getNode(java.lang.String key2, TernarySearchTrie.TSTNode startNode) Returns the node indexed by key, or null if that node doesn't exist.
private java.util.List	TernarySearchTrie.matchAlmostRecursion(TernarySearchTrie.TSTNode currentNode, int charIndex, int d, java.lang.String matchAlmostKey, int matchAlmostNumReturnValues, java.util.List matchAlmostResult2, boolean upTo) Recursivelly vists the nodes in order to find the ones that almost match a given key.
protected int	TernarySearchTrie.numDataNodes(TernarySearchTrie.TSTNode startingNode) Returns the number of nodes in the subtrie below and including the starting node.
protected int	TernarySearchTrie.numNodes(TernarySearchTrie.TSTNode startingNode) Returns the total number of nodes in the subtrie below and including the starting Node.
private int	TernarySearchTrie.recursiveNodeCalculator(TernarySearchTrie.TSTNode currentNode, boolean checkData, int numNodes2) Recursivelly visists each node to calculate the number of nodes.
protected java.util.List	TernarySearchTrie.sortKeys(TernarySearchTrie.TSTNode startNode, int numReturnValues) Returns keys sorted in alphabetical order.
private java.util.List	TernarySearchTrie.sortKeysRecursion(TernarySearchTrie.TSTNode currentNode, int sortKeysNumReturnValues, java.util.List sortKeysResult2) Returns keys sorted in alphabetical order.

Constructors in pt.tumba.spell with parameters of type TernarySearchTrie.TSTNode

TernarySearchTrie.TSTNode(char splitchar, TernarySearchTrie.TSTNode parent)
Constructor method.