Uses of Interface
com.googlecode.concurrenttrees.common.KeyValuePair
Packages that use KeyValuePair
Package
Description
-
Uses of KeyValuePair in com.googlecode.concurrenttrees.radix
Classes in com.googlecode.concurrenttrees.radix that implement KeyValuePairMethods in com.googlecode.concurrenttrees.radix that return types with arguments of type KeyValuePairModifier and TypeMethodDescription(package private) <O> Iterable
<KeyValuePair<O>> ConcurrentRadixTree.getDescendantKeyValuePairs
(CharSequence startKey, Node startNode) Returns a lazy iterable which will returnKeyValuePair
objects each containing a key and a value, for which the given key is a prefix of the key in theKeyValuePair
.ConcurrentRadixTree.getKeyValuePairsForClosestKeys
(CharSequence candidate) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree which are the closest match for the given candidate key.RadixTree.getKeyValuePairsForClosestKeys
(CharSequence candidate) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree which are the closest match for the given candidate key.ConcurrentRadixTree.getKeyValuePairsForKeysStartingWith
(CharSequence prefix) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree, where the keys start with the given prefix.RadixTree.getKeyValuePairsForKeysStartingWith
(CharSequence prefix) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree, where the keys start with the given prefix. -
Uses of KeyValuePair in com.googlecode.concurrenttrees.radixinverted
Methods in com.googlecode.concurrenttrees.radixinverted that return KeyValuePairModifier and TypeMethodDescriptionConcurrentInvertedRadixTree.getKeyValuePairForLongestKeyPrefixing
(CharSequence document) Returns theKeyValuePair
for the longest key in the tree which is a prefix of the given document.InvertedRadixTree.getKeyValuePairForLongestKeyPrefixing
(CharSequence document) Returns theKeyValuePair
for the longest key in the tree which is a prefix of the given document.protected KeyValuePair
<O> ConcurrentInvertedRadixTree.ConcurrentInvertedRadixTreeImpl.scanForLongestKeyAtStartOfInput
(CharSequence input) Traverses the tree based on characters in the given input, and returns the longest key in the tree which is a prefix of the input, and its associated value.Methods in com.googlecode.concurrenttrees.radixinverted that return types with arguments of type KeyValuePairModifier and TypeMethodDescriptionConcurrentInvertedRadixTree.getKeyValuePairsForClosestKeys
(CharSequence candidate) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree which are the closest match for the given candidate key.ConcurrentInvertedRadixTree.getKeyValuePairsForKeysContainedIn
(CharSequence document) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys in the tree which are contained in the given document.InvertedRadixTree.getKeyValuePairsForKeysContainedIn
(CharSequence document) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys in the tree which are contained in the given document.ConcurrentInvertedRadixTree.getKeyValuePairsForKeysPrefixing
(CharSequence document) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys in the tree which prefix the given document.InvertedRadixTree.getKeyValuePairsForKeysPrefixing
(CharSequence document) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys in the tree which prefix the given document.ConcurrentInvertedRadixTree.getKeyValuePairsForKeysStartingWith
(CharSequence prefix) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree, where the keys start with the given prefix.protected Iterable
<KeyValuePair<O>> ConcurrentInvertedRadixTree.ConcurrentInvertedRadixTreeImpl.scanForKeysAtStartOfInput
(CharSequence input) Lazily traverses the tree based on characters in the given input, and returns from the tree the next node and its value where the key associated with the node matches the characters from the input. -
Uses of KeyValuePair in com.googlecode.concurrenttrees.radixreversed
Methods in com.googlecode.concurrenttrees.radixreversed that return types with arguments of type KeyValuePairModifier and TypeMethodDescriptionConcurrentReversedRadixTree.getKeyValuePairsForKeysEndingWith
(CharSequence suffix) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree, where the keys end with the given suffix.ReversedRadixTree.getKeyValuePairsForKeysEndingWith
(CharSequence suffix) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree, where the keys end with the given suffix. -
Uses of KeyValuePair in com.googlecode.concurrenttrees.suffix
Methods in com.googlecode.concurrenttrees.suffix that return types with arguments of type KeyValuePairModifier and TypeMethodDescriptionConcurrentSuffixTree.getKeyValuePairsForKeysContaining
(CharSequence fragment) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree, where the keys contain the given fragment.SuffixTree.getKeyValuePairsForKeysContaining
(CharSequence fragment) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree, where the keys contain the given fragment.ConcurrentSuffixTree.getKeyValuePairsForKeysEndingWith
(CharSequence suffix) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree, where the keys end with the given suffix.SuffixTree.getKeyValuePairsForKeysEndingWith
(CharSequence suffix) Returns a lazy iterable which returns the set ofKeyValuePair
s for keys and their associated values in the tree, where the keys end with the given suffix.