Uses of Interface
com.googlecode.concurrenttrees.radix.node.Node
Packages that use Node
Package
Description
-
Uses of Node in com.googlecode.concurrenttrees.common
Methods in com.googlecode.concurrenttrees.common with parameters of type NodeModifier and TypeMethodDescription(package private) static void
PrettyPrinter.prettyPrint
(Node node, Appendable sb, String prefix, boolean isTail, boolean isRoot) -
Uses of Node in com.googlecode.concurrenttrees.radix
Fields in com.googlecode.concurrenttrees.radix declared as NodeModifier and TypeFieldDescriptionfinal Node
ConcurrentRadixTree.NodeKeyPair.node
(package private) final Node
ConcurrentRadixTree.SearchResult.nodeFound
(package private) final Node
ConcurrentRadixTree.SearchResult.parentNode
(package private) final Node
ConcurrentRadixTree.SearchResult.parentNodesParent
protected Node
ConcurrentRadixTree.root
Methods in com.googlecode.concurrenttrees.radix that return NodeMethods in com.googlecode.concurrenttrees.radix with parameters of type NodeModifier and TypeMethodDescriptionConcurrentRadixTree.SearchResult.classify
(CharSequence key, Node nodeFound, int charsMatched, int charsMatchedInNodeFound) (package private) Iterable
<CharSequence> ConcurrentRadixTree.getDescendantKeys
(CharSequence startKey, Node startNode) Returns a lazy iterable which will returnCharSequence
keys for which the given key is a prefix.(package private) <O> Iterable
<KeyValuePair<O>> ConcurrentRadixTree.getDescendantKeyValuePairs
(CharSequence startKey, Node startNode) Returns a lazy iterable which will returnKeyValuePair
objects each containing a key and a value, for which the given key is a prefix of the key in theKeyValuePair
.(package private) <O> Iterable
<O> ConcurrentRadixTree.getDescendantValues
(CharSequence startKey, Node startNode) Returns a lazy iterable which will return values which are associated with keys in the tree for which the given key is a prefix.protected Iterable
<ConcurrentRadixTree.NodeKeyPair> ConcurrentRadixTree.lazyTraverseDescendants
(CharSequence startKey, Node startNode) 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.Constructors in com.googlecode.concurrenttrees.radix with parameters of type NodeModifierConstructorDescriptionNodeKeyPair
(Node node, CharSequence key) (package private)
SearchResult
(CharSequence key, Node nodeFound, int charsMatched, int charsMatchedInNodeFound, Node parentNode, Node parentNodesParent) -
Uses of Node in com.googlecode.concurrenttrees.radix.node
Methods in com.googlecode.concurrenttrees.radix.node that return NodeModifier and TypeMethodDescriptionNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) Node.getOutgoingEdge
(Character edgeFirstCharacter) Returns the child of this node whose edge starts with the given first character.Methods in com.googlecode.concurrenttrees.radix.node that return types with arguments of type NodeModifier and TypeMethodDescriptionNode.getOutgoingEdges()
Returns a read-only list of the child nodes to which this node has outgoing edges, i.e.Methods in com.googlecode.concurrenttrees.radix.node with parameters of type NodeModifier and TypeMethodDescriptionvoid
Node.updateOutgoingEdge
(Node childNode) Updates the child node reference for a given edge (identified by its first character) to point to a different child node.Method parameters in com.googlecode.concurrenttrees.radix.node with type arguments of type NodeModifier and TypeMethodDescriptionNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) -
Uses of Node in com.googlecode.concurrenttrees.radix.node.concrete
Methods in com.googlecode.concurrenttrees.radix.node.concrete that return NodeModifier and TypeMethodDescriptionDefaultByteArrayNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) DefaultCharArrayNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) DefaultCharSequenceNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) SmartArrayBasedNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) Method parameters in com.googlecode.concurrenttrees.radix.node.concrete with type arguments of type NodeModifier and TypeMethodDescriptionDefaultByteArrayNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) DefaultCharArrayNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) DefaultCharSequenceNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) SmartArrayBasedNodeFactory.createNode
(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot) -
Uses of Node in com.googlecode.concurrenttrees.radix.node.concrete.bytearray
Classes in com.googlecode.concurrenttrees.radix.node.concrete.bytearray that implement NodeModifier and TypeClassDescriptionclass
Similar toCharArrayNodeDefault
but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.class
Similar toCharArrayNodeLeafNullValue
but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.class
Similar toCharArrayNodeLeafVoidValue
but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.class
Similar toCharArrayNodeLeafWithValue
but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.class
Similar toCharArrayNodeNonLeafNullValue
but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.class
Similar toCharArrayNodeNonLeafVoidValue
but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.Fields in com.googlecode.concurrenttrees.radix.node.concrete.bytearray with type parameters of type NodeModifier and TypeFieldDescriptionprivate final AtomicReferenceArray
<Node> ByteArrayNodeDefault.outgoingEdges
private final AtomicReferenceArray
<Node> ByteArrayNodeNonLeafNullValue.outgoingEdges
private final AtomicReferenceArray
<Node> ByteArrayNodeNonLeafVoidValue.outgoingEdges
ByteArrayNodeDefault.outgoingEdgesAsList
ByteArrayNodeNonLeafNullValue.outgoingEdgesAsList
ByteArrayNodeNonLeafVoidValue.outgoingEdgesAsList
Methods in com.googlecode.concurrenttrees.radix.node.concrete.bytearray that return NodeModifier and TypeMethodDescriptionByteArrayNodeDefault.getOutgoingEdge
(Character edgeFirstCharacter) ByteArrayNodeLeafNullValue.getOutgoingEdge
(Character edgeFirstCharacter) ByteArrayNodeLeafVoidValue.getOutgoingEdge
(Character edgeFirstCharacter) ByteArrayNodeLeafWithValue.getOutgoingEdge
(Character edgeFirstCharacter) ByteArrayNodeNonLeafNullValue.getOutgoingEdge
(Character edgeFirstCharacter) ByteArrayNodeNonLeafVoidValue.getOutgoingEdge
(Character edgeFirstCharacter) Methods in com.googlecode.concurrenttrees.radix.node.concrete.bytearray that return types with arguments of type NodeModifier and TypeMethodDescriptionByteArrayNodeDefault.getOutgoingEdges()
ByteArrayNodeLeafNullValue.getOutgoingEdges()
ByteArrayNodeLeafVoidValue.getOutgoingEdges()
ByteArrayNodeLeafWithValue.getOutgoingEdges()
ByteArrayNodeNonLeafNullValue.getOutgoingEdges()
ByteArrayNodeNonLeafVoidValue.getOutgoingEdges()
Methods in com.googlecode.concurrenttrees.radix.node.concrete.bytearray with parameters of type NodeModifier and TypeMethodDescriptionvoid
ByteArrayNodeDefault.updateOutgoingEdge
(Node childNode) void
ByteArrayNodeLeafNullValue.updateOutgoingEdge
(Node childNode) void
ByteArrayNodeLeafVoidValue.updateOutgoingEdge
(Node childNode) void
ByteArrayNodeLeafWithValue.updateOutgoingEdge
(Node childNode) void
ByteArrayNodeNonLeafNullValue.updateOutgoingEdge
(Node childNode) void
ByteArrayNodeNonLeafVoidValue.updateOutgoingEdge
(Node childNode) Constructor parameters in com.googlecode.concurrenttrees.radix.node.concrete.bytearray with type arguments of type NodeModifierConstructorDescriptionByteArrayNodeDefault
(CharSequence edgeCharSequence, Object value, List<Node> outgoingEdges) ByteArrayNodeNonLeafNullValue
(CharSequence edgeCharSequence, List<Node> outgoingEdges) ByteArrayNodeNonLeafVoidValue
(CharSequence edgeCharSequence, List<Node> outgoingEdges) -
Uses of Node in com.googlecode.concurrenttrees.radix.node.concrete.chararray
Classes in com.googlecode.concurrenttrees.radix.node.concrete.chararray that implement NodeModifier and TypeClassDescriptionclass
A non-optimized implementation of theNode
interface.class
Stores only incoming edge as achar[]
.class
Stores only incoming edge as achar[]
.class
Stores only incoming edge as achar[]
, and a reference to a value.class
Stores incoming edge as achar[]
and outgoing edges as anAtomicReferenceArray
.class
Stores incoming edge as achar[]
and outgoing edges as anAtomicReferenceArray
.Fields in com.googlecode.concurrenttrees.radix.node.concrete.chararray with type parameters of type NodeModifier and TypeFieldDescriptionprivate final AtomicReferenceArray
<Node> CharArrayNodeDefault.outgoingEdges
private final AtomicReferenceArray
<Node> CharArrayNodeNonLeafNullValue.outgoingEdges
private final AtomicReferenceArray
<Node> CharArrayNodeNonLeafVoidValue.outgoingEdges
CharArrayNodeDefault.outgoingEdgesAsList
CharArrayNodeNonLeafNullValue.outgoingEdgesAsList
CharArrayNodeNonLeafVoidValue.outgoingEdgesAsList
Methods in com.googlecode.concurrenttrees.radix.node.concrete.chararray that return NodeModifier and TypeMethodDescriptionCharArrayNodeDefault.getOutgoingEdge
(Character edgeFirstCharacter) CharArrayNodeLeafNullValue.getOutgoingEdge
(Character edgeFirstCharacter) CharArrayNodeLeafVoidValue.getOutgoingEdge
(Character edgeFirstCharacter) CharArrayNodeLeafWithValue.getOutgoingEdge
(Character edgeFirstCharacter) CharArrayNodeNonLeafNullValue.getOutgoingEdge
(Character edgeFirstCharacter) CharArrayNodeNonLeafVoidValue.getOutgoingEdge
(Character edgeFirstCharacter) Methods in com.googlecode.concurrenttrees.radix.node.concrete.chararray that return types with arguments of type NodeModifier and TypeMethodDescriptionCharArrayNodeDefault.getOutgoingEdges()
CharArrayNodeLeafNullValue.getOutgoingEdges()
CharArrayNodeLeafVoidValue.getOutgoingEdges()
CharArrayNodeLeafWithValue.getOutgoingEdges()
CharArrayNodeNonLeafNullValue.getOutgoingEdges()
CharArrayNodeNonLeafVoidValue.getOutgoingEdges()
Methods in com.googlecode.concurrenttrees.radix.node.concrete.chararray with parameters of type NodeModifier and TypeMethodDescriptionvoid
CharArrayNodeDefault.updateOutgoingEdge
(Node childNode) void
CharArrayNodeLeafNullValue.updateOutgoingEdge
(Node childNode) void
CharArrayNodeLeafVoidValue.updateOutgoingEdge
(Node childNode) void
CharArrayNodeLeafWithValue.updateOutgoingEdge
(Node childNode) void
CharArrayNodeNonLeafNullValue.updateOutgoingEdge
(Node childNode) void
CharArrayNodeNonLeafVoidValue.updateOutgoingEdge
(Node childNode) Constructor parameters in com.googlecode.concurrenttrees.radix.node.concrete.chararray with type arguments of type NodeModifierConstructorDescriptionCharArrayNodeDefault
(CharSequence edgeCharSequence, Object value, List<Node> outgoingEdges) CharArrayNodeNonLeafNullValue
(CharSequence edgeCharSequence, List<Node> outgoingEdges) CharArrayNodeNonLeafVoidValue
(CharSequence edgeCharSequence, List<Node> outgoingEdges) -
Uses of Node in com.googlecode.concurrenttrees.radix.node.concrete.charsequence
Classes in com.googlecode.concurrenttrees.radix.node.concrete.charsequence that implement NodeModifier and TypeClassDescriptionclass
A implementation of theNode
interface which stores the incoming edge as aCharSequence
(a view onto the original key) rather than copying the edge into a character array.class
Stores only incoming edge as aCharSequence
(a view onto the original key) rather than copying the edge into a character array.class
Stores only incoming edge as aCharSequence
(a view onto the original key) rather than copying the edge into a character array.class
Stores incoming edge as aCharSequence
(a view onto the original key) rather than copying the edge into a character array.class
Stores incoming edge as aCharSequence
(a view onto the original key) rather than copying the edge into a character array, and stores outgoing edges as anAtomicReferenceArray
.class
Stores incoming edge as aCharSequence
(a view onto the original key) rather than copying the edge into a character array, and stores outgoing edges as anAtomicReferenceArray
.Fields in com.googlecode.concurrenttrees.radix.node.concrete.charsequence with type parameters of type NodeModifier and TypeFieldDescriptionprivate final AtomicReferenceArray
<Node> CharSequenceNodeDefault.outgoingEdges
private final AtomicReferenceArray
<Node> CharSequenceNodeNonLeafNullValue.outgoingEdges
private final AtomicReferenceArray
<Node> CharSequenceNodeNonLeafVoidValue.outgoingEdges
CharSequenceNodeDefault.outgoingEdgesAsList
CharSequenceNodeNonLeafNullValue.outgoingEdgesAsList
CharSequenceNodeNonLeafVoidValue.outgoingEdgesAsList
Methods in com.googlecode.concurrenttrees.radix.node.concrete.charsequence that return NodeModifier and TypeMethodDescriptionCharSequenceNodeDefault.getOutgoingEdge
(Character edgeFirstCharacter) CharSequenceNodeLeafNullValue.getOutgoingEdge
(Character edgeFirstCharacter) CharSequenceNodeLeafVoidValue.getOutgoingEdge
(Character edgeFirstCharacter) CharSequenceNodeLeafWithValue.getOutgoingEdge
(Character edgeFirstCharacter) CharSequenceNodeNonLeafNullValue.getOutgoingEdge
(Character edgeFirstCharacter) CharSequenceNodeNonLeafVoidValue.getOutgoingEdge
(Character edgeFirstCharacter) Methods in com.googlecode.concurrenttrees.radix.node.concrete.charsequence that return types with arguments of type NodeModifier and TypeMethodDescriptionCharSequenceNodeDefault.getOutgoingEdges()
CharSequenceNodeLeafNullValue.getOutgoingEdges()
CharSequenceNodeLeafVoidValue.getOutgoingEdges()
CharSequenceNodeLeafWithValue.getOutgoingEdges()
CharSequenceNodeNonLeafNullValue.getOutgoingEdges()
CharSequenceNodeNonLeafVoidValue.getOutgoingEdges()
Methods in com.googlecode.concurrenttrees.radix.node.concrete.charsequence with parameters of type NodeModifier and TypeMethodDescriptionvoid
CharSequenceNodeDefault.updateOutgoingEdge
(Node childNode) void
CharSequenceNodeLeafNullValue.updateOutgoingEdge
(Node childNode) void
CharSequenceNodeLeafVoidValue.updateOutgoingEdge
(Node childNode) void
CharSequenceNodeLeafWithValue.updateOutgoingEdge
(Node childNode) void
CharSequenceNodeNonLeafNullValue.updateOutgoingEdge
(Node childNode) void
CharSequenceNodeNonLeafVoidValue.updateOutgoingEdge
(Node childNode) Constructor parameters in com.googlecode.concurrenttrees.radix.node.concrete.charsequence with type arguments of type NodeModifierConstructorDescriptionCharSequenceNodeDefault
(CharSequence edgeCharSequence, Object value, List<Node> outgoingEdges) CharSequenceNodeNonLeafNullValue
(CharSequence edgeCharSequence, List<Node> outgoingEdges) CharSequenceNodeNonLeafVoidValue
(CharSequence edgeCharSequence, List<Node> outgoingEdges) -
Uses of Node in com.googlecode.concurrenttrees.radix.node.util
Methods in com.googlecode.concurrenttrees.radix.node.util that return NodeMethod parameters in com.googlecode.concurrenttrees.radix.node.util with type arguments of type NodeModifier and TypeMethodDescriptionstatic int
NodeUtil.binarySearchForEdge
(AtomicReferenceArray<Node> childNodes, Character edgeFirstCharacter) Returns the index of the node in the givenAtomicReferenceArray
whose edge starts with the given first character.static void
NodeUtil.ensureNoDuplicateEdges
(List<Node> nodes) Throws an exception if any nodes in the given list represent edges having the same first character. -
Uses of Node in com.googlecode.concurrenttrees.radixinverted
Methods in com.googlecode.concurrenttrees.radixinverted that return Node -
Uses of Node in com.googlecode.concurrenttrees.radixreversed
Methods in com.googlecode.concurrenttrees.radixreversed that return Node -
Uses of Node in com.googlecode.concurrenttrees.solver
Methods in com.googlecode.concurrenttrees.solver with parameters of type NodeModifier and TypeMethodDescriptionprotected Iterable
<ConcurrentRadixTree.NodeKeyPair> LCSubstringSolver.ConcurrentSuffixTreeImpl.lazyTraverseDescendants
(CharSequence startKey, Node startNode) (package private) boolean
LCSubstringSolver.ConcurrentSuffixTreeImpl.subTreeReferencesAllOriginalDocuments
(CharSequence startKey, Node startNode) Returns true if the given node and its descendants collectively reference all original documents added to the solver. -
Uses of Node in com.googlecode.concurrenttrees.suffix
Methods in com.googlecode.concurrenttrees.suffix that return Node