Uses of Class
com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.NodeKeyPair
-
Packages that use ConcurrentRadixTree.NodeKeyPair Package Description com.googlecode.concurrenttrees.radix com.googlecode.concurrenttrees.solver -
-
Uses of ConcurrentRadixTree.NodeKeyPair in com.googlecode.concurrenttrees.radix
Methods in com.googlecode.concurrenttrees.radix that return types with arguments of type ConcurrentRadixTree.NodeKeyPair Modifier and Type Method Description protected java.lang.Iterable<ConcurrentRadixTree.NodeKeyPair>
ConcurrentRadixTree. lazyTraverseDescendants(java.lang.CharSequence startKey, Node startNode)
Traverses the tree using depth-first, preordered traversal, starting at the given node, using lazy evaluation such that the next node is only determined when next() is called on the iterator returned. -
Uses of ConcurrentRadixTree.NodeKeyPair in com.googlecode.concurrenttrees.solver
Methods in com.googlecode.concurrenttrees.solver that return types with arguments of type ConcurrentRadixTree.NodeKeyPair Modifier and Type Method Description protected java.lang.Iterable<ConcurrentRadixTree.NodeKeyPair>
LCSubstringSolver.ConcurrentSuffixTreeImpl. lazyTraverseDescendants(java.lang.CharSequence startKey, Node startNode)
-