- generatePrefixes(CharSequence) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
-
- generateSuffixes(CharSequence) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
-
- get(int) - Method in class com.googlecode.concurrenttrees.radix.node.util.AtomicReferenceArrayListAdapter
-
- getClosestKeys(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which are the closest match for the given
candidate key.
- getClosestKeys(CharSequence) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which are the closest match for the given
candidate key.
- getClosestKeys(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which are the closest match for the given
candidate key.
- getCommonPrefix(CharSequence, CharSequence) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafNullValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafVoidValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafNullValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafVoidValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafNullValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafVoidValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
-
- getIncomingEdge() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
-
- getIncomingEdge() - Method in interface com.googlecode.concurrenttrees.radix.node.Node
-
Returns all characters of the "edge" encoded in this node, belonging to the connection from a parent node to this
node.
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafNullValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafVoidValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafNullValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafVoidValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafNullValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafVoidValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
-
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
-
- getIncomingEdgeFirstCharacter() - Method in interface com.googlecode.concurrenttrees.radix.node.Node
-
Returns the first character of the "edge" encoded in this node, belonging to the connection from a parent node to
this node.
- getIncomingEdgeFirstCharacter() - Method in class com.googlecode.concurrenttrees.radix.node.util.NodeCharacterKey
-
- getIncomingEdgeFirstCharacter() - Method in interface com.googlecode.concurrenttrees.radix.node.util.NodeCharacterProvider
-
- getKey() - Method in interface com.googlecode.concurrenttrees.common.KeyValuePair
-
Returns the key with which the value is associated
- getKey() - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.KeyValuePairImpl
-
Returns the key with which the value is associated
- getKeysContainedIn(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which are contained in the given document.
- getKeysContainedIn(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which are contained in the given document.
- getKeysContaining(CharSequence) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
Returns a lazy iterable which returns the set of keys in the tree which contain the given fragment.
- getKeysContaining(CharSequence) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
-
Returns a lazy iterable which returns the set of keys in the tree which contain the given fragment.
- getKeysEndingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which end with the given suffix.
- getKeysEndingWith(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixreversed.ReversedRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which end with the given suffix.
- getKeysEndingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
Returns a lazy iterable which returns the set of keys in the tree which end with the given suffix.
- getKeysEndingWith(CharSequence) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
-
Returns a lazy iterable which returns the set of keys in the tree which end with the given suffix.
- getKeysPrefixing(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which prefix the given document.
- getKeysPrefixing(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which prefix the given document.
- getKeysStartingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which start with the given prefix.
- getKeysStartingWith(CharSequence) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which start with the given prefix.
- getKeysStartingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of keys in the tree which start with the given prefix.
- getKeyValuePairsForClosestKeys(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values in
the tree which are the closest match for the given candidate key.
- getKeyValuePairsForClosestKeys(CharSequence) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values in
the tree which are the closest match for the given candidate key.
- getKeyValuePairsForClosestKeys(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values in
the tree which are the closest match for the given candidate key.
- getKeyValuePairsForKeysContainedIn(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys in the tree which are contained
in the given document.
- getKeyValuePairsForKeysContainedIn(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys in the tree which are contained
in the given document.
- getKeyValuePairsForKeysContaining(CharSequence) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values in
the tree, where the keys contain the given fragment.
- getKeyValuePairsForKeysContaining(CharSequence) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values in
the tree, where the keys contain the given fragment.
- getKeyValuePairsForKeysEndingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values
in the tree, where the keys end with the given suffix.
- getKeyValuePairsForKeysEndingWith(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixreversed.ReversedRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values
in the tree, where the keys end with the given suffix.
- getKeyValuePairsForKeysEndingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values in
the tree, where the keys end with the given suffix.
- getKeyValuePairsForKeysEndingWith(CharSequence) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values in
the tree, where the keys end with the given suffix.
- getKeyValuePairsForKeysPrefixing(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys in the tree which prefix
the given document.
- getKeyValuePairsForKeysPrefixing(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys in the tree which prefix
the given document.
- getKeyValuePairsForKeysStartingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values
in the tree, where the keys start with the given prefix.
- getKeyValuePairsForKeysStartingWith(CharSequence) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values
in the tree, where the keys start with the given prefix.
- getKeyValuePairsForKeysStartingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of
KeyValuePair
s for keys and their associated values
in the tree, where the keys start with the given prefix.
- getLongestCommonSubstring() - Method in class com.googlecode.concurrenttrees.solver.LCSubstringSolver
-
Finds the longest common substring in the documents added to the solver so far.
- getNode() - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
- getNode() - Method in interface com.googlecode.concurrenttrees.radix.node.util.PrettyPrintable
-
- getNode() - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
- getNode() - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
-
- getNode() - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafNullValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafVoidValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafNullValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafVoidValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafNullValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafVoidValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
-
- getOutgoingEdge(Character) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
-
- getOutgoingEdge(Character) - Method in interface com.googlecode.concurrenttrees.radix.node.Node
-
Returns the child of this node whose edge starts with the given first character.
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafNullValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafVoidValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafNullValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafVoidValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafNullValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafVoidValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
-
- getOutgoingEdges() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
-
- getOutgoingEdges() - Method in interface com.googlecode.concurrenttrees.radix.node.Node
-
Returns a read-only list of the child nodes to which this node has outgoing edges, i.e.
- getPrefix(CharSequence, int) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
-
- getSuffix(CharSequence, int) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
-
- getValue() - Method in interface com.googlecode.concurrenttrees.common.KeyValuePair
-
Returns the value associated with the key
- getValue() - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.KeyValuePairImpl
-
Returns the value associated with the key
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafNullValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafVoidValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafNullValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafVoidValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafNullValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafVoidValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
-
- getValue() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
-
- getValue() - Method in interface com.googlecode.concurrenttrees.radix.node.Node
-
Returns a value object which has been associated with a key and which is stored in this node, or returns
null
if no value is stored in this node.
- getValueForExactKey(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
Returns the value associated with the given key (exact match), or returns null if no such value
is associated with the key.
- getValueForExactKey(CharSequence) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
-
Returns the value associated with the given key (exact match), or returns null if no such value
is associated with the key.
- getValueForExactKey(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns the value associated with the given key (exact match), or returns null if no such value
is associated with the key.
- getValueForExactKey(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
-
Returns the value associated with the given key (exact match), or returns null if no such value
is associated with the key.
- getValueForExactKey(CharSequence) - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
-
Returns the value associated with the given key (exact match), or returns null if no such value
is associated with the key.
- getValueForExactKey(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixreversed.ReversedRadixTree
-
Returns the value associated with the given key (exact match), or returns null if no such value
is associated with the key.
- getValueForExactKey(CharSequence) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
Returns the value associated with the given key (exact match), or returns null if no such value
is associated with the key.
- getValueForExactKey(CharSequence) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
-
Returns the value associated with the given key (exact match), or returns null if no such value
is associated with the key.
- getValuesForClosestKeys(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which are the closest
match for the given candidate key.
- getValuesForClosestKeys(CharSequence) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which are the closest
match for the given candidate key.
- getValuesForClosestKeys(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which are the closest
match for the given candidate key.
- getValuesForKeysContainedIn(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which are contained
in the given document.
- getValuesForKeysContainedIn(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which are contained
in the given document.
- getValuesForKeysContaining(CharSequence) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which contain the given
fragment.
- getValuesForKeysContaining(CharSequence) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which contain the given
fragment.
- getValuesForKeysEndingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which end with the
given suffix.
- getValuesForKeysEndingWith(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixreversed.ReversedRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which end with the
given suffix.
- getValuesForKeysEndingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which end with the
given suffix.
- getValuesForKeysEndingWith(CharSequence) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which end with the
given suffix.
- getValuesForKeysPrefixing(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which prefix
the given document.
- getValuesForKeysPrefixing(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which prefix
the given document.
- getValuesForKeysStartingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which start with the
given prefix.
- getValuesForKeysStartingWith(CharSequence) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which start with the
given prefix.
- getValuesForKeysStartingWith(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Returns a lazy iterable which returns the set of values associated with keys in the tree which start with the
given prefix.
- prettyPrint(PrettyPrintable) - Static method in class com.googlecode.concurrenttrees.common.PrettyPrinter
-
Generates a semi-graphical string representation of a given tree.
- prettyPrint(PrettyPrintable, Appendable) - Static method in class com.googlecode.concurrenttrees.common.PrettyPrinter
-
Generates a semi-graphical string representation of a given tree, writing it to a given
Appendable
.
- PrettyPrintable - Interface in com.googlecode.concurrenttrees.radix.node.util
-
An internal interface implemented by trees, which allows internal details of trees to be accessed by
PrettyPrinter
.
- PrettyPrinter - Class in com.googlecode.concurrenttrees.common
-
Utility methods to generate semi-graphical string representations of trees.
- put(CharSequence, O) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
Associates the given value with the given key; replacing any previous value associated with the key.
- put(CharSequence, O) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
-
Associates the given value with the given key; replacing any previous value associated with the key.
- put(CharSequence, O) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
Associates the given value with the given key; replacing any previous value associated with the key.
- put(CharSequence, O) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
-
Associates the given value with the given key; replacing any previous value associated with the key.
- put(CharSequence, O) - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
-
Associates the given value with the given key; replacing any previous value associated with the key.
- put(CharSequence, O) - Method in interface com.googlecode.concurrenttrees.radixreversed.ReversedRadixTree
-
Associates the given value with the given key; replacing any previous value associated with the key.
- put(CharSequence, O) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
Associates the given value with the given key; replacing any previous value associated with the key.
- put(CharSequence, O) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
-
Associates the given value with the given key; replacing any previous value associated with the key.
- putIfAbsent(CharSequence, O) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
-
If a value is not already associated with the given key in the tree, associates the given value with the
key; otherwise if an existing value is already associated, returns the existing value and does not overwrite it.
- putIfAbsent(CharSequence, O) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
-
If a value is not already associated with the given key in the tree, associates the given value with the
key; otherwise if an existing value is already associated, returns the existing value and does not overwrite it.
- putIfAbsent(CharSequence, O) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
-
If a value is not already associated with the given key in the tree, associates the given value with the
key; otherwise if an existing value is already associated, returns the existing value and does not overwrite it.
- putIfAbsent(CharSequence, O) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
-
If a value is not already associated with the given key in the tree, associates the given value with the
key; otherwise if an existing value is already associated, returns the existing value and does not overwrite it.
- putIfAbsent(CharSequence, O) - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
-
If a value is not already associated with the given key in the tree, associates the given value with the
key; otherwise if an existing value is already associated, returns the existing value and does not overwrite it.
- putIfAbsent(CharSequence, O) - Method in interface com.googlecode.concurrenttrees.radixreversed.ReversedRadixTree
-
If a value is not already associated with the given key in the tree, associates the given value with the
key; otherwise if an existing value is already associated, returns the existing value and does not overwrite it.
- putIfAbsent(CharSequence, O) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
-
If a value is not already associated with the given key in the tree, associates the given value with the
key; otherwise if an existing value is already associated, returns the existing value and does not overwrite it.
- putIfAbsent(CharSequence, O) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
-
If a value is not already associated with the given key in the tree, associates the given value with the
key; otherwise if an existing value is already associated, returns the existing value and does not overwrite it.