|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
CharSequence document to the solver.
AtomicReferenceArray to implement read-only methods of the List interface.AtomicReferenceArray whose edge starts with the given
first character.
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.CharArrayNodeDefault but represents
each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.CharArrayNodeLeafNullValue but represents
each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.CharArrayNodeLeafVoidValue but represents
each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.CharArrayNodeLeafWithValue but represents
each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.CharArrayNodeNonLeafNullValue but represents
each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.CharArrayNodeNonLeafVoidValue but represents
each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.Node interface.char[].char[].char[], and a reference to a value.char[] and outgoing edges as an AtomicReferenceArray.char[] and outgoing edges as an AtomicReferenceArray.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.CharSequence (a view onto the original key) rather than copying the
edge into a character array.CharSequence (a view onto the original key) rather than copying the
edge into a character array.CharSequence (a view onto the original key) rather than copying the
edge into a character array.CharSequence (a view onto the original key) rather than copying the edge
into a character array, and stores outgoing edges as an AtomicReferenceArray.CharSequence (a view onto the original key) rather than copying the edge
into a character array, and stores outgoing edges as an AtomicReferenceArray.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 which will use the given NodeFactory to create nodes.
ConcurrentInvertedRadixTree which will use the given NodeFactory to create nodes.
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 which will use the given NodeFactory to create nodes.
ConcurrentRadixTree which will use the given NodeFactory to create nodes.
KeyValuePair interface.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 which will use the given NodeFactory to create nodes.
ConcurrentReversedRadixTree which will use the given NodeFactory to create nodes.
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 which will use the given NodeFactory to create nodes.
ConcurrentSuffixTree which will use the given NodeFactory to create nodes.
Iterable.
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.
Set in which original keys from which a suffix was generated can be stored.
NodeFactory which creates Node objects which store incoming edge characters as a byte array inside
the node.NodeFactory which creates various implementations of Node objects all of which store incoming
edge characters as a character array inside the node.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.KeyValuePair object with another for equality.
KeyValuePair object with another for equality.
CharSequence which wraps the given char[].
KeyValuePairs for keys and their associated values in
the tree which are the closest match for the given candidate key.
KeyValuePairs for keys and their associated values in
the tree which are the closest match for the given candidate key.
KeyValuePairs for keys and their associated values in
the tree which are the closest match for the given candidate key.
KeyValuePairs for keys in the tree which are contained
in the given document.
KeyValuePairs for keys in the tree which are contained
in the given document.
KeyValuePairs for keys and their associated values in
the tree, where the keys contain the given fragment.
KeyValuePairs for keys and their associated values in
the tree, where the keys contain the given fragment.
KeyValuePairs for keys and their associated values
in the tree, where the keys end with the given suffix.
KeyValuePairs for keys and their associated values
in the tree, where the keys end with the given suffix.
KeyValuePairs for keys and their associated values in
the tree, where the keys end with the given suffix.
KeyValuePairs for keys and their associated values in
the tree, where the keys end with the given suffix.
KeyValuePairs for keys in the tree which prefix
the given document.
KeyValuePairs for keys in the tree which prefix
the given document.
KeyValuePairs for keys and their associated values
in the tree, where the keys start with the given prefix.
KeyValuePairs for keys and their associated values
in the tree, where the keys start with the given prefix.
KeyValuePairs for keys and their associated values
in the tree, where the keys start with the given prefix.
null if no value is stored in this node.
Iterables to Lists and Sets.LCSubstringSolver which will use the given NodeFactory to create nodes.
LCSubstringSolver which will use the given NodeFactory to create nodes.
Node.getIncomingEdgeFirstCharacter().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.Node and NodeCharacterKey
which, by sharing this common interface, enables binary search of nodes via
Collections.binarySearch(java.util.List, Object, java.util.Comparator).Node objects on demand, to encapsulate specified variables.Nodes.Appendable.
PrettyPrinter.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.CharSequence into a new char[].
Iterable into a new List.
Iterable into a new Set.
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.
Iterable.
(key, value).
(key, value).
ConcurrentRadixTree.getKeysStartingWith(CharSequence) or the
ConcurrentRadixTree.getKeyValuePairsForKeysStartingWith(CharSequence) methods.
DefaultCharArrayNodeFactory or
DefaultCharSequenceNodeFactory to save memory.
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||