Index

A B C D E F G H I K L N O P R S T U V W 
All Classes and Interfaces|All Packages|Serialized Form

A

acquireWriteLock() - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
 
acquireWriteLock() - Method in class com.googlecode.concurrenttrees.solver.LCSubstringSolver.ConcurrentSuffixTreeImpl
 
acquireWriteLock() - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree.ConcurrentSuffixTreeImpl
 
add(CharSequence) - Method in class com.googlecode.concurrenttrees.solver.LCSubstringSolver
Adds a CharSequence document to the solver.
addSuffixesToRadixTree(String) - Method in class com.googlecode.concurrenttrees.solver.LCSubstringSolver
 
addSuffixesToRadixTree(String) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
 
atomicReferenceArray - Variable in class com.googlecode.concurrenttrees.radix.node.util.AtomicReferenceArrayListAdapter
 
AtomicReferenceArrayListAdapter<T> - Class in com.googlecode.concurrenttrees.radix.node.util
Wraps an AtomicReferenceArray to implement read-only methods of the List interface.
AtomicReferenceArrayListAdapter(AtomicReferenceArray<T>) - Constructor for class com.googlecode.concurrenttrees.radix.node.util.AtomicReferenceArrayListAdapter
 

B

binarySearchForEdge(AtomicReferenceArray<Node>, Character) - Static method in class com.googlecode.concurrenttrees.radix.node.util.NodeUtil
Returns the index of the node in the given AtomicReferenceArray whose edge starts with the given first character.
ByteArrayCharSequence - Class in com.googlecode.concurrenttrees.radix.node.concrete.bytearray
A CharSequence view onto a byte array of UTF-8-encoded characters, with the proviso that all of the characters were encoded as a single byte in UTF-8.
ByteArrayCharSequence(byte[], int, int) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence
 
ByteArrayCharSequence.IncompatibleCharacterException - Exception Class in com.googlecode.concurrenttrees.radix.node.concrete.bytearray
 
ByteArrayNodeDefault - Class in com.googlecode.concurrenttrees.radix.node.concrete.bytearray
Similar to CharArrayNodeDefault but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
ByteArrayNodeDefault(CharSequence, Object, List<Node>) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
 
byteArrayNodeFactory - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.SmartArrayBasedNodeFactory
 
ByteArrayNodeLeafNullValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.bytearray
Similar to CharArrayNodeLeafNullValue but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
ByteArrayNodeLeafNullValue(CharSequence) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafNullValue
 
ByteArrayNodeLeafVoidValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.bytearray
Similar to CharArrayNodeLeafVoidValue but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
ByteArrayNodeLeafVoidValue(CharSequence) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafVoidValue
 
ByteArrayNodeLeafWithValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.bytearray
Similar to CharArrayNodeLeafWithValue but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
ByteArrayNodeLeafWithValue(CharSequence, Object) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
 
ByteArrayNodeNonLeafNullValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.bytearray
Similar to CharArrayNodeNonLeafNullValue but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
ByteArrayNodeNonLeafNullValue(CharSequence, List<Node>) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
 
ByteArrayNodeNonLeafVoidValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.bytearray
Similar to CharArrayNodeNonLeafVoidValue but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
ByteArrayNodeNonLeafVoidValue(CharSequence, List<Node>) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
 
bytes - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence
 

C

character - Variable in class com.googlecode.concurrenttrees.radix.node.util.NodeCharacterKey
 
CharArrayNodeDefault - Class in com.googlecode.concurrenttrees.radix.node.concrete.chararray
A non-optimized implementation of the Node interface.
CharArrayNodeDefault(CharSequence, Object, List<Node>) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
 
charArrayNodeFactory - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.SmartArrayBasedNodeFactory
 
CharArrayNodeLeafNullValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.chararray
Stores only incoming edge as a char[].
CharArrayNodeLeafNullValue(CharSequence) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafNullValue
 
CharArrayNodeLeafVoidValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.chararray
Stores only incoming edge as a char[].
CharArrayNodeLeafVoidValue(CharSequence) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafVoidValue
 
CharArrayNodeLeafWithValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.chararray
Stores only incoming edge as a char[], and a reference to a value.
CharArrayNodeLeafWithValue(CharSequence, Object) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
 
CharArrayNodeNonLeafNullValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.chararray
Stores incoming edge as a char[] and outgoing edges as an AtomicReferenceArray.
CharArrayNodeNonLeafNullValue(CharSequence, List<Node>) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
 
CharArrayNodeNonLeafVoidValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.chararray
Stores incoming edge as a char[] and outgoing edges as an AtomicReferenceArray.
CharArrayNodeNonLeafVoidValue(CharSequence, List<Node>) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
 
charAt(int) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence
 
CharSequenceNodeDefault - Class in com.googlecode.concurrenttrees.radix.node.concrete.charsequence
A implementation of the Node interface which stores the incoming edge as a CharSequence (a view onto the original key) rather than copying the edge into a character array.
CharSequenceNodeDefault(CharSequence, Object, List<Node>) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
 
CharSequenceNodeLeafNullValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.charsequence
Stores only incoming edge as a CharSequence (a view onto the original key) rather than copying the edge into a character array.
CharSequenceNodeLeafNullValue(CharSequence) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafNullValue
 
CharSequenceNodeLeafVoidValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.charsequence
Stores only incoming edge as a CharSequence (a view onto the original key) rather than copying the edge into a character array.
CharSequenceNodeLeafVoidValue(CharSequence) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafVoidValue
 
CharSequenceNodeLeafWithValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.charsequence
Stores incoming edge as a CharSequence (a view onto the original key) rather than copying the edge into a character array.
CharSequenceNodeLeafWithValue(CharSequence, Object) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
 
CharSequenceNodeNonLeafNullValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.charsequence
Stores incoming edge as a CharSequence (a view onto the original key) rather than copying the edge into a character array, and stores outgoing edges as an AtomicReferenceArray.
CharSequenceNodeNonLeafNullValue(CharSequence, List<Node>) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
 
CharSequenceNodeNonLeafVoidValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.charsequence
Stores incoming edge as a CharSequence (a view onto the original key) rather than copying the edge into a character array, and stores outgoing edges as an AtomicReferenceArray.
CharSequenceNodeNonLeafVoidValue(CharSequence, List<Node>) - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
 
CharSequences - Class in com.googlecode.concurrenttrees.common
 
CharSequences() - Constructor for class com.googlecode.concurrenttrees.common.CharSequences
Private constructor, not used.
charsMatched - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
charsMatchedInNodeFound - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
classification - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
Classification() - Constructor for enum class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult.Classification
 
classify(CharSequence, Node, int, int) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
com.googlecode.concurrenttrees.common - package com.googlecode.concurrenttrees.common
 
com.googlecode.concurrenttrees.radix - package com.googlecode.concurrenttrees.radix
 
com.googlecode.concurrenttrees.radix.node - package com.googlecode.concurrenttrees.radix.node
 
com.googlecode.concurrenttrees.radix.node.concrete - package com.googlecode.concurrenttrees.radix.node.concrete
 
com.googlecode.concurrenttrees.radix.node.concrete.bytearray - package com.googlecode.concurrenttrees.radix.node.concrete.bytearray
 
com.googlecode.concurrenttrees.radix.node.concrete.chararray - package com.googlecode.concurrenttrees.radix.node.concrete.chararray
 
com.googlecode.concurrenttrees.radix.node.concrete.charsequence - package com.googlecode.concurrenttrees.radix.node.concrete.charsequence
 
com.googlecode.concurrenttrees.radix.node.concrete.voidvalue - package com.googlecode.concurrenttrees.radix.node.concrete.voidvalue
 
com.googlecode.concurrenttrees.radix.node.util - package com.googlecode.concurrenttrees.radix.node.util
 
com.googlecode.concurrenttrees.radixinverted - package com.googlecode.concurrenttrees.radixinverted
 
com.googlecode.concurrenttrees.radixreversed - package com.googlecode.concurrenttrees.radixreversed
 
com.googlecode.concurrenttrees.solver - package com.googlecode.concurrenttrees.solver
 
com.googlecode.concurrenttrees.suffix - package com.googlecode.concurrenttrees.suffix
 
compare(NodeCharacterProvider, NodeCharacterProvider) - Method in class com.googlecode.concurrenttrees.radix.node.util.NodeCharacterComparator
 
computeNext() - Method in class com.googlecode.concurrenttrees.common.LazyIterator
 
concatenate(CharSequence, CharSequence) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
 
ConcurrentInvertedRadixTree<O> - Class in com.googlecode.concurrenttrees.radixinverted
An implementation of InvertedRadixTree which supports lock-free concurrent reads, and allows items to be added to and to be removed from the tree atomically by background thread(s), without blocking reads.
ConcurrentInvertedRadixTree(NodeFactory) - Constructor for class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
Creates a new ConcurrentInvertedRadixTree which will use the given NodeFactory to create nodes.
ConcurrentInvertedRadixTree.ConcurrentInvertedRadixTreeImpl<O> - Class in com.googlecode.concurrenttrees.radixinverted
 
ConcurrentInvertedRadixTreeImpl(NodeFactory) - Constructor for class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree.ConcurrentInvertedRadixTreeImpl
 
ConcurrentRadixTree<O> - Class in com.googlecode.concurrenttrees.radix
An implementation of RadixTree which supports lock-free concurrent reads, and allows items to be added to and to be removed from the tree atomically by background thread(s), without blocking reads.
ConcurrentRadixTree(NodeFactory) - Constructor for class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
Creates a new ConcurrentRadixTree which will use the given NodeFactory to create nodes.
ConcurrentRadixTree.KeyValuePairImpl<O> - Class in com.googlecode.concurrenttrees.radix
Implementation of the KeyValuePair interface.
ConcurrentRadixTree.NodeKeyPair - Class in com.googlecode.concurrenttrees.radix
Encapsulates a node and its associated key.
ConcurrentRadixTree.SearchResult - Class in com.googlecode.concurrenttrees.radix
Encapsulates results of searching the tree for a node for which a given key is a prefix.
ConcurrentRadixTree.SearchResult.Classification - Enum Class in com.googlecode.concurrenttrees.radix
 
ConcurrentReversedRadixTree<O> - Class in com.googlecode.concurrenttrees.radixreversed
An implementation of ReversedRadixTree which supports lock-free concurrent reads, and allows items to be added to and to be removed from the tree atomically by background thread(s), without blocking reads.
ConcurrentReversedRadixTree(NodeFactory) - Constructor for class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
Creates a new ConcurrentReversedRadixTree which will use the given NodeFactory to create nodes.
ConcurrentReversedRadixTree.ConcurrentReverseRadixTreeImpl<O> - Class in com.googlecode.concurrenttrees.radixreversed
 
ConcurrentReverseRadixTreeImpl(NodeFactory) - Constructor for class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree.ConcurrentReverseRadixTreeImpl
 
ConcurrentSuffixTree<O> - Class in com.googlecode.concurrenttrees.suffix
An implementation of SuffixTree which supports lock-free concurrent reads, and allows items to be added to and to be removed from the tree atomically by background thread(s), without blocking reads.
ConcurrentSuffixTree(NodeFactory) - Constructor for class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
Creates a new ConcurrentSuffixTree which will use the given NodeFactory to create nodes.
ConcurrentSuffixTree.ConcurrentSuffixTreeImpl<V> - Class in com.googlecode.concurrenttrees.suffix
 
ConcurrentSuffixTreeImpl(NodeFactory) - Constructor for class com.googlecode.concurrenttrees.solver.LCSubstringSolver.ConcurrentSuffixTreeImpl
 
ConcurrentSuffixTreeImpl(NodeFactory) - Constructor for class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree.ConcurrentSuffixTreeImpl
 
count(Iterable<?>) - Static method in class com.googlecode.concurrenttrees.common.Iterables
Counts the number of elements returned by the given Iterable.
createNode(CharSequence, Object, List<Node>, boolean) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.DefaultByteArrayNodeFactory
 
createNode(CharSequence, Object, List<Node>, boolean) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.DefaultCharArrayNodeFactory
 
createNode(CharSequence, Object, List<Node>, boolean) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.DefaultCharSequenceNodeFactory
 
createNode(CharSequence, Object, List<Node>, boolean) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.SmartArrayBasedNodeFactory
 
createNode(CharSequence, Object, List<Node>, boolean) - Method in interface com.googlecode.concurrenttrees.radix.node.NodeFactory
Returns a new Node object which encapsulates the arguments supplied, optionally returning implementations of the Node interface which are memory-optimized for storing only the supplied combination of variables, potentially further optimized based on variable values.
createSetForOriginalKeys() - Method in class com.googlecode.concurrenttrees.solver.LCSubstringSolver
 
createSetForOriginalKeys() - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
Creates a new Set in which original keys from which a suffix was generated can be stored.

D

DefaultByteArrayNodeFactory - Class in com.googlecode.concurrenttrees.radix.node.concrete
A NodeFactory which creates Node objects which store incoming edge characters as a byte array inside the node.
DefaultByteArrayNodeFactory() - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.DefaultByteArrayNodeFactory
 
DefaultCharArrayNodeFactory - Class in com.googlecode.concurrenttrees.radix.node.concrete
A NodeFactory which creates various implementations of Node objects all of which store incoming edge characters as a character array inside the node.
DefaultCharArrayNodeFactory() - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.DefaultCharArrayNodeFactory
 
DefaultCharSequenceNodeFactory - Class in com.googlecode.concurrenttrees.radix.node.concrete
A NodeFactory which creates various implementations of Node objects all of which store incoming edge characters as a CharSequence (a view onto the original key) rather than copying the edge into a character array.
DefaultCharSequenceNodeFactory() - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.DefaultCharSequenceNodeFactory
 
DONE - Enum constant in enum class com.googlecode.concurrenttrees.common.LazyIterator.State
 

E

end - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence
 
endOfData() - Method in class com.googlecode.concurrenttrees.common.LazyIterator
 
ensureNoDuplicateEdges(List<Node>) - Static method in class com.googlecode.concurrenttrees.radix.node.util.NodeUtil
Throws an exception if any nodes in the given list represent edges having the same first character.
equals(Object) - Method in interface com.googlecode.concurrenttrees.common.KeyValuePair
Compares this KeyValuePair object with another for equality.
equals(Object) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.KeyValuePairImpl
Compares this KeyValuePair object with another for equality.
equals(Object) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.voidvalue.VoidValue
 
EXACT_MATCH - Enum constant in enum class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult.Classification
 

F

FAILED - Enum constant in enum class com.googlecode.concurrenttrees.common.LazyIterator.State
 
fromCharArray(char[]) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
Returns a CharSequence which wraps the given char[].

G

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
 
getDescendantKeys(CharSequence, Node) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
Returns a lazy iterable which will return CharSequence keys for which the given key is a prefix.
getDescendantKeyValuePairs(CharSequence, Node) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
Returns a lazy iterable which will return KeyValuePair objects each containing a key and a value, for which the given key is a prefix of the key in the KeyValuePair.
getDescendantValues(CharSequence, Node) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
Returns a lazy iterable which will return values which are associated with keys in the tree for which the given key is a prefix.
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.
getKeyValuePairForLongestKeyPrefixing(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
Returns the KeyValuePair for the longest key in the tree which is a prefix of the given document.
getKeyValuePairForLongestKeyPrefixing(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
Returns the KeyValuePair for the longest key in the tree which is a prefix of the given document.
getKeyValuePairsForClosestKeys(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
Returns a lazy iterable which returns the set of KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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 KeyValuePairs 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.ConcurrentSuffixTreeImpl
The main algorithm to find the longest common substring.
getLongestCommonSubstring() - Method in class com.googlecode.concurrenttrees.solver.LCSubstringSolver
Finds the longest common substring in the documents added to the solver so far.
getLongestKeyPrefixing(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
Returns the longest key in the tree which is a prefix of the given document.
getLongestKeyPrefixing(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
Returns the longest key in the tree which is a prefix of the given document.
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.
getValueForLongestKeyPrefixing(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
Returns the value associated with the longest key in the tree which is a prefix of the given document.
getValueForLongestKeyPrefixing(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
Returns the value associated with the longest key in the tree which is a prefix of the given document.
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.

H

hashCode() - Method in interface com.googlecode.concurrenttrees.common.KeyValuePair
Returns a hash code for this object.
hashCode() - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.KeyValuePairImpl
Returns a hash code for this object.
hashCode() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.voidvalue.VoidValue
 
hasNext() - Method in class com.googlecode.concurrenttrees.common.LazyIterator
 

I

incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafNullValue
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafVoidValue
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafNullValue
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafVoidValue
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
 
incomingEdgeCharArray - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
 
incomingEdgeCharSequence - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
 
incomingEdgeCharSequence - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafNullValue
 
incomingEdgeCharSequence - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafVoidValue
 
incomingEdgeCharSequence - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
 
incomingEdgeCharSequence - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
 
incomingEdgeCharSequence - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
 
IncompatibleCharacterException(String) - Constructor for exception class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence.IncompatibleCharacterException
 
INCOMPLETE_MATCH_TO_END_OF_EDGE - Enum constant in enum class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult.Classification
 
INCOMPLETE_MATCH_TO_MIDDLE_OF_EDGE - Enum constant in enum class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult.Classification
 
INVALID - Enum constant in enum class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult.Classification
 
InvertedRadixTree<O> - Interface in com.googlecode.concurrenttrees.radixinverted
API of an inverted radix tree, that is a radix tree which is set up to scan external documents for keys previously added to the tree, rather than for data contained in the tree itself.
Iterables - Class in com.googlecode.concurrenttrees.common
Provides methods to convert Iterables to Lists and Sets.
Iterables() - Constructor for class com.googlecode.concurrenttrees.common.Iterables
Private constructor, not used.

K

key - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.KeyValuePairImpl
 
key - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.NodeKeyPair
 
key - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
KEY_ENDS_MID_EDGE - Enum constant in enum class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult.Classification
 
KeyValuePair<O> - Interface in com.googlecode.concurrenttrees.common
Encapsulates a key and a value.
KeyValuePairImpl(String, Object) - Constructor for class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.KeyValuePairImpl
Constructor.

L

LazyIterator<T> - Class in com.googlecode.concurrenttrees.common
An unmodifiable iterator which computes the next element to return only when it is requested.
LazyIterator() - Constructor for class com.googlecode.concurrenttrees.common.LazyIterator
 
LazyIterator.State - Enum Class in com.googlecode.concurrenttrees.common
 
lazyTraverseDescendants(CharSequence, Node) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
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.
lazyTraverseDescendants(CharSequence, Node) - Method in class com.googlecode.concurrenttrees.solver.LCSubstringSolver.ConcurrentSuffixTreeImpl
 
LCSubstringSolver - Class in com.googlecode.concurrenttrees.solver
Finds the longest common substring in a collection of documents.
LCSubstringSolver(NodeFactory) - Constructor for class com.googlecode.concurrenttrees.solver.LCSubstringSolver
Creates a new LCSubstringSolver which will use the given NodeFactory to create nodes.
LCSubstringSolver.ConcurrentSuffixTreeImpl<V> - Class in com.googlecode.concurrenttrees.solver
 
length() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence
 

N

next - Variable in class com.googlecode.concurrenttrees.common.LazyIterator
 
next() - Method in class com.googlecode.concurrenttrees.common.LazyIterator
 
node - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.NodeKeyPair
 
Node - Interface in com.googlecode.concurrenttrees.radix.node
Specifies the methods that nodes must implement.
NodeCharacterComparator - Class in com.googlecode.concurrenttrees.radix.node.util
Specifies binary search compatibility, and sorting compatibility, of nodes based on Node.getIncomingEdgeFirstCharacter().
NodeCharacterComparator() - Constructor for class com.googlecode.concurrenttrees.radix.node.util.NodeCharacterComparator
 
NodeCharacterKey - Class in com.googlecode.concurrenttrees.radix.node.util
A lightweight object which simply wraps a Character and implements NodeCharacterProvider, which can be used as a key to locate a node having the same edge first character in a list of nodes using binary search.
NodeCharacterKey(Character) - Constructor for class com.googlecode.concurrenttrees.radix.node.util.NodeCharacterKey
 
NodeCharacterProvider - Interface in com.googlecode.concurrenttrees.radix.node.util
A super-interface of both Node and NodeCharacterKey which, by sharing this common interface, enables binary search of nodes via Collections.binarySearch(java.util.List, Object, java.util.Comparator).
nodeFactory - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
 
NodeFactory - Interface in com.googlecode.concurrenttrees.radix.node
An interface for a factory which creates new Node objects on demand, to encapsulate specified variables.
nodeFound - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
NodeKeyPair(Node, CharSequence) - Constructor for class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.NodeKeyPair
 
NodeUtil - Class in com.googlecode.concurrenttrees.radix.node.util
Static utility methods useful when implementing Nodes.
NodeUtil() - Constructor for class com.googlecode.concurrenttrees.radix.node.util.NodeUtil
Private constructor, not used.
NOT_READY - Enum constant in enum class com.googlecode.concurrenttrees.common.LazyIterator.State
 
nullSafeIterator(Iterable<T>) - Static method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
Utility method to return an iterator for the given iterable, or an empty iterator if the iterable is null.

O

originalDocuments - Variable in class com.googlecode.concurrenttrees.solver.LCSubstringSolver
 
outgoingEdges - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
 
outgoingEdges - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
 
outgoingEdges - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
 
outgoingEdges - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
 
outgoingEdges - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
 
outgoingEdges - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
 
outgoingEdges - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
 
outgoingEdges - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
 
outgoingEdges - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
 
outgoingEdgesAsList - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
 
outgoingEdgesAsList - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
 
outgoingEdgesAsList - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
 
outgoingEdgesAsList - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
 
outgoingEdgesAsList - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
 
outgoingEdgesAsList - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
 
outgoingEdgesAsList - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
 
outgoingEdgesAsList - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
 
outgoingEdgesAsList - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
 

P

parentNode - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
parentNodesParent - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
prettyPrint(Node, Appendable, String, boolean, boolean) - Static method in class com.googlecode.concurrenttrees.common.PrettyPrinter
 
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.
PrettyPrinter() - Constructor for class com.googlecode.concurrenttrees.common.PrettyPrinter
Private constructor, not used.
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.
putInternal(CharSequence, Object, boolean) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
Atomically adds the given value to the tree, creating a node for the value as necessary.

R

radixTree - Variable in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
 
radixTree - Variable in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
 
radixTree - Variable in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
 
RadixTree<O> - Interface in com.googlecode.concurrenttrees.radix
API of a radix tree, that is a tree which allows values to be looked up based on prefixes of the keys with which they were associated, as well as based on exact matches for keys.
READY - Enum constant in enum class com.googlecode.concurrenttrees.common.LazyIterator.State
 
releaseWriteLock() - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
 
releaseWriteLock() - Method in class com.googlecode.concurrenttrees.solver.LCSubstringSolver.ConcurrentSuffixTreeImpl
 
releaseWriteLock() - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree.ConcurrentSuffixTreeImpl
 
remove() - Method in class com.googlecode.concurrenttrees.common.LazyIterator
 
remove(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
Removes the value associated with the given key (exact match).
remove(CharSequence) - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
Removes the value associated with the given key (exact match).
remove(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
Removes the value associated with the given key (exact match).
remove(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
Removes the value associated with the given key (exact match).
remove(CharSequence) - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
Removes the value associated with the given key (exact match).
remove(CharSequence) - Method in interface com.googlecode.concurrenttrees.radixreversed.ReversedRadixTree
Removes the value associated with the given key (exact match).
remove(CharSequence) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
Removes the value associated with the given key (exact match).
remove(CharSequence) - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
Removes the value associated with the given key (exact match).
removeSuffixesFromRadixTree(String) - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
 
reverse(CharSequence) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
 
ReversedRadixTree<O> - Interface in com.googlecode.concurrenttrees.radixreversed
API of a reversed radix tree, that is a tree which allows values to be looked up based on suffixes of the keys with which they were associated, as well as based on exact matches for keys.
root - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
 

S

scanForKeysAtStartOfInput(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree.ConcurrentInvertedRadixTreeImpl
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.
scanForLongestKeyAtStartOfInput(CharSequence) - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree.ConcurrentInvertedRadixTreeImpl
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.
SearchResult(CharSequence, Node, int, int, Node, Node) - Constructor for class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
searchTree(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
Traverses the tree and finds the node which matches the longest prefix of the given key.
SINGLETON - Static variable in class com.googlecode.concurrenttrees.radix.node.concrete.voidvalue.VoidValue
 
size() - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
Counts the number of keys/values stored in the tree.
size() - Method in class com.googlecode.concurrenttrees.radix.node.util.AtomicReferenceArrayListAdapter
 
size() - Method in interface com.googlecode.concurrenttrees.radix.RadixTree
Counts the number of keys/values stored in the tree.
size() - Method in class com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree
Counts the number of keys/values stored in the tree.
size() - Method in interface com.googlecode.concurrenttrees.radixinverted.InvertedRadixTree
Counts the number of keys/values stored in the tree.
size() - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree
Counts the number of keys/values stored in the tree.
size() - Method in interface com.googlecode.concurrenttrees.radixreversed.ReversedRadixTree
Counts the number of keys/values stored in the tree.
size() - Method in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
Counts the number of keys/values stored in the tree.
size() - Method in interface com.googlecode.concurrenttrees.suffix.SuffixTree
Counts the number of keys/values stored in the tree.
SmartArrayBasedNodeFactory - Class in com.googlecode.concurrenttrees.radix.node.concrete
A NodeFactory which internally uses DefaultByteArrayNodeFactory to create nodes by default (which can reduce memory overhead), but falls back to DefaultCharArrayNodeFactory if characters are detected which cannot be represented as a single byte.
SmartArrayBasedNodeFactory() - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.SmartArrayBasedNodeFactory
 
start - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence
 
state - Variable in class com.googlecode.concurrenttrees.common.LazyIterator
 
State() - Constructor for enum class com.googlecode.concurrenttrees.common.LazyIterator.State
 
subSequence(int, int) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence
 
subtractPrefix(CharSequence, CharSequence) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
 
subTreeReferencesAllOriginalDocuments(CharSequence, Node) - Method in class com.googlecode.concurrenttrees.solver.LCSubstringSolver.ConcurrentSuffixTreeImpl
Returns true if the given node and its descendants collectively reference all original documents added to the solver.
suffixTree - Variable in class com.googlecode.concurrenttrees.solver.LCSubstringSolver
 
SuffixTree<O> - Interface in com.googlecode.concurrenttrees.suffix
API of a generalized suffix tree, that is a tree which allows values to be looked up based on any suffix of the keys with which they were associated, as well as based on exact matches for keys.

T

toCharArray(CharSequence) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
Copies the given CharSequence into a new char[].
toList(Iterable<T>) - Static method in class com.googlecode.concurrenttrees.common.Iterables
Copies elements from the given Iterable into a new List.
toSet(Iterable<T>) - Static method in class com.googlecode.concurrenttrees.common.Iterables
Copies elements from the given Iterable into a new Set.
toSingleByteUtf8Encoding(CharSequence) - Static method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence
Encodes a given CharSequence into a byte[] in UTF-8 encoding, with the requirement that it must be possible to represent all characters as a single byte in UTF-8.
toString() - Method in interface com.googlecode.concurrenttrees.common.KeyValuePair
Returns a string representation as (key, value).
toString() - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.KeyValuePairImpl
Returns a string representation as (key, value).
toString() - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayCharSequence
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafNullValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafVoidValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafNullValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafVoidValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafNullValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafVoidValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
 
toString() - Method in class com.googlecode.concurrenttrees.radix.node.concrete.voidvalue.VoidValue
 
toString(CharSequence) - Static method in class com.googlecode.concurrenttrees.common.CharSequences
 
toString(Iterable<?>) - Static method in class com.googlecode.concurrenttrees.common.Iterables
Returns a string representation of elements returned by the given Iterable.
transformKeyForResult(CharSequence) - Method in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
A hook method which may be overridden by subclasses, to transform a key just before it is returned to the application, for example by the ConcurrentRadixTree.getKeysStartingWith(CharSequence) or the ConcurrentRadixTree.getKeyValuePairsForKeysStartingWith(CharSequence) methods.
transformKeyForResult(CharSequence) - Method in class com.googlecode.concurrenttrees.radixreversed.ConcurrentReversedRadixTree.ConcurrentReverseRadixTreeImpl
 
tryToComputeNext() - Method in class com.googlecode.concurrenttrees.common.LazyIterator
 

U

updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafNullValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafVoidValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafNullValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeNonLeafVoidValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafNullValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafVoidValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafNullValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeNonLeafVoidValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafNullValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafVoidValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafNullValue
 
updateOutgoingEdge(Node) - Method in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeNonLeafVoidValue
 
updateOutgoingEdge(Node) - Method in interface com.googlecode.concurrenttrees.radix.node.Node
Updates the child node reference for a given edge (identified by its first character) to point to a different child node.

V

value - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.KeyValuePairImpl
 
value - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeDefault
 
value - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.bytearray.ByteArrayNodeLeafWithValue
 
value - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeDefault
 
value - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.chararray.CharArrayNodeLeafWithValue
 
value - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeDefault
 
value - Variable in class com.googlecode.concurrenttrees.radix.node.concrete.charsequence.CharSequenceNodeLeafWithValue
 
valueMap - Variable in class com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree
 
valueOf(String) - Static method in enum class com.googlecode.concurrenttrees.common.LazyIterator.State
Returns the enum constant of this class with the specified name.
valueOf(String) - Static method in enum class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult.Classification
Returns the enum constant of this class with the specified name.
values() - Static method in enum class com.googlecode.concurrenttrees.common.LazyIterator.State
Returns an array containing the constants of this enum class, in the order they are declared.
values() - Static method in enum class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree.SearchResult.Classification
Returns an array containing the constants of this enum class, in the order they are declared.
VoidValue - Class in com.googlecode.concurrenttrees.radix.node.concrete.voidvalue
A dummy object which if supplied as a value for an entry in a tree, will not actually be stored in the tree by DefaultCharArrayNodeFactory or DefaultCharSequenceNodeFactory to save memory.
VoidValue() - Constructor for class com.googlecode.concurrenttrees.radix.node.concrete.voidvalue.VoidValue
 

W

writeLock - Variable in class com.googlecode.concurrenttrees.radix.ConcurrentRadixTree
 
A B C D E F G H I K L N O P R S T U V W 
All Classes and Interfaces|All Packages|Serialized Form