Uses of Class
org.passay.dictionary.TernaryNode
Packages that use TernaryNode
-
Uses of TernaryNode in org.passay.dictionary
Fields in org.passay.dictionary declared as TernaryNodeModifier and TypeFieldDescriptionprivate TernaryNodeTernaryNode.eqkidequal child of this node.private TernaryNodeTernaryNode.hikidhigh child of this node.private TernaryNodeTernaryNode.lokidlow child of this node.private TernaryNodeTernaryTree.rootroot node of the ternary tree.Methods in org.passay.dictionary that return TernaryNodeModifier and TypeMethodDescriptionTernaryNode.getEqkid()Returns the eqkid node in relation to this node.TernaryNode.getHikid()Returns the hikid node in relation to this node.TernaryNode.getLokid()Returns the lokid node in relation to this node.private TernaryNodeTernaryTree.insertNode(TernaryNode node, CharSequence word, int index) Recursively inserts a word into the ternary tree one node at a time beginning at the supplied node.Methods in org.passay.dictionary with parameters of type TernaryNodeModifier and TypeMethodDescriptionTernaryTree.getNodeStats(TernaryNode node, int depth, Map<Integer, Integer> histogram) Returns a histogram of how many words end at each depth.private TernaryNodeTernaryTree.insertNode(TernaryNode node, CharSequence word, int index) Recursively inserts a word into the ternary tree one node at a time beginning at the supplied node.private List<CharSequence>TernaryTree.nearSearchNode(TernaryNode node, int distance, List<CharSequence> matches, CharSequence match, CharSequence word, int index) Recursively searches for a near match word in the ternary tree one node at a time beginning at the supplied node.private List<CharSequence>TernaryTree.partialSearchNode(TernaryNode node, List<CharSequence> matches, CharSequence match, CharSequence word, int index) Recursively searches for a partial word in the ternary tree one node at a time beginning at the supplied node.private voidTernaryTree.printNode(TernaryNode node, String s, int depth, boolean fullPath, StringBuilder buffer) Recursively traverses every node in the ternary tree rooted at the supplied node.private booleanTernaryTree.searchNode(TernaryNode node, int[] word, int index) Recursively searches for a word in the ternary tree one node at a time beginning at the supplied node.voidTernaryNode.setEqkid(TernaryNode node) Sets the eqkid node in relation to this node.voidTernaryNode.setHikid(TernaryNode node) Sets the hikid node in relation to this node.voidTernaryNode.setLokid(TernaryNode node) Sets the lokid node in relation to this node.private List<CharSequence>TernaryTree.traverseNode(TernaryNode node, String s, List<CharSequence> words) Recursively traverses every node in the ternary tree one node at a time beginning at the supplied node.