Class ConcurrentRadixTree.SearchResult
java.lang.Object
com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
- Enclosing class:
ConcurrentRadixTree<O>
Encapsulates results of searching the tree for a node for which a given key is a prefix. Encapsulates the node
found, its parent node, its parent's parent node, and the number of characters matched in the current node and
in total.
Also classifies the search result so that algorithms in methods which use this SearchResult, when adding nodes
and removing nodes from the tree, can select appropriate strategies based on the classification.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescription(package private) static enum
-
Field Summary
FieldsModifier and TypeFieldDescription(package private) final int
(package private) final int
(package private) final ConcurrentRadixTree.SearchResult.Classification
(package private) final CharSequence
(package private) final Node
(package private) final Node
(package private) final Node
-
Constructor Summary
ConstructorsConstructorDescriptionSearchResult
(CharSequence key, Node nodeFound, int charsMatched, int charsMatchedInNodeFound, Node parentNode, Node parentNodesParent) -
Method Summary
Modifier and TypeMethodDescriptionclassify
(CharSequence key, Node nodeFound, int charsMatched, int charsMatchedInNodeFound) toString()
-
Field Details
-
key
-
nodeFound
-
charsMatched
final int charsMatched -
charsMatchedInNodeFound
final int charsMatchedInNodeFound -
parentNode
-
parentNodesParent
-
classification
-
-
Constructor Details
-
SearchResult
SearchResult(CharSequence key, Node nodeFound, int charsMatched, int charsMatchedInNodeFound, Node parentNode, Node parentNodesParent)
-
-
Method Details
-
classify
protected ConcurrentRadixTree.SearchResult.Classification classify(CharSequence key, Node nodeFound, int charsMatched, int charsMatchedInNodeFound) -
toString
-