Uses of Interface com.googlecode.concurrenttrees.radix.node.Node

Packages that use Node
Package	Description
com.googlecode.concurrenttrees.common
com.googlecode.concurrenttrees.radix
com.googlecode.concurrenttrees.radix.node
com.googlecode.concurrenttrees.radix.node.concrete
com.googlecode.concurrenttrees.radix.node.concrete.bytearray
com.googlecode.concurrenttrees.radix.node.concrete.chararray
com.googlecode.concurrenttrees.radix.node.concrete.charsequence
com.googlecode.concurrenttrees.radix.node.util
com.googlecode.concurrenttrees.radixinverted
com.googlecode.concurrenttrees.radixreversed
com.googlecode.concurrenttrees.solver
com.googlecode.concurrenttrees.suffix

Uses of Node in com.googlecode.concurrenttrees.common

Methods in com.googlecode.concurrenttrees.common with parameters of type Node
Modifier and Type	Method	Description
`(package private) static void`	PrettyPrinter.`prettyPrint(Node node, java.lang.Appendable sb, java.lang.String prefix, boolean isTail, boolean isRoot)`

Uses of Node in com.googlecode.concurrenttrees.radix

Fields in com.googlecode.concurrenttrees.radix declared as Node
Modifier and Type	Field	Description
`Node`	ConcurrentRadixTree.NodeKeyPair.`node`
`(package private) Node`	ConcurrentRadixTree.SearchResult.`nodeFound`
`(package private) Node`	ConcurrentRadixTree.SearchResult.`parentNode`
`(package private) Node`	ConcurrentRadixTree.SearchResult.`parentNodesParent`
`protected Node`	ConcurrentRadixTree.`root`

Methods in com.googlecode.concurrenttrees.radix that return Node
Modifier and Type	Method	Description
`Node`	ConcurrentRadixTree.`getNode()`

Methods in com.googlecode.concurrenttrees.radix with parameters of type Node
Modifier and Type	Method	Description
`protected ConcurrentRadixTree.SearchResult.Classification`	ConcurrentRadixTree.SearchResult.`classify(java.lang.CharSequence key, Node nodeFound, int charsMatched, int charsMatchedInNodeFound)`
`(package private) java.lang.Iterable<java.lang.CharSequence>`	ConcurrentRadixTree.`getDescendantKeys(java.lang.CharSequence startKey, Node startNode)`	Returns a lazy iterable which will return `CharSequence` keys for which the given key is a prefix.
`(package private) <O> java.lang.Iterable<KeyValuePair<O>>`	ConcurrentRadixTree.`getDescendantKeyValuePairs(java.lang.CharSequence startKey, Node startNode)`	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`.
`(package private) <O> java.lang.Iterable<O>`	ConcurrentRadixTree.`getDescendantValues(java.lang.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 java.lang.Iterable<ConcurrentRadixTree.NodeKeyPair>`	ConcurrentRadixTree.`lazyTraverseDescendants(java.lang.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 Node
Constructor	Description
`NodeKeyPair(Node node, java.lang.CharSequence key)`
`SearchResult(java.lang.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 Node
Modifier and Type	Method	Description
`Node`	NodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.List<Node> childNodes, boolean isRoot)`	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.
`Node`	Node.`getOutgoingEdge(java.lang.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 Node
Modifier and Type	Method	Description
`java.util.List<Node>`	Node.`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 Node
Modifier and Type	Method	Description
`void`	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 Node
Modifier and Type	Method	Description
`Node`	NodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.List<Node> childNodes, boolean isRoot)`	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.

Uses of Node in com.googlecode.concurrenttrees.radix.node.concrete

Methods in com.googlecode.concurrenttrees.radix.node.concrete that return Node
Modifier and Type	Method	Description
`Node`	DefaultByteArrayNodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.List<Node> childNodes, boolean isRoot)`
`Node`	DefaultCharArrayNodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.List<Node> childNodes, boolean isRoot)`
`Node`	DefaultCharSequenceNodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.List<Node> childNodes, boolean isRoot)`
`Node`	SmartArrayBasedNodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.List<Node> childNodes, boolean isRoot)`

Method parameters in com.googlecode.concurrenttrees.radix.node.concrete with type arguments of type Node
Modifier and Type	Method	Description
`Node`	DefaultByteArrayNodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.List<Node> childNodes, boolean isRoot)`
`Node`	DefaultCharArrayNodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.List<Node> childNodes, boolean isRoot)`
`Node`	DefaultCharSequenceNodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.List<Node> childNodes, boolean isRoot)`
`Node`	SmartArrayBasedNodeFactory.`createNode(java.lang.CharSequence edgeCharacters, java.lang.Object value, java.util.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 Node
Modifier and Type	Class	Description
`class`	`ByteArrayNodeDefault`	Similar to `CharArrayNodeDefault` but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
`class`	`ByteArrayNodeLeafNullValue`	Similar to `CharArrayNodeLeafNullValue` but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
`class`	`ByteArrayNodeLeafVoidValue`	Similar to `CharArrayNodeLeafVoidValue` but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
`class`	`ByteArrayNodeLeafWithValue`	Similar to `CharArrayNodeLeafWithValue` but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
`class`	`ByteArrayNodeNonLeafNullValue`	Similar to `CharArrayNodeNonLeafNullValue` but represents each character in UTF-8, instead of Java's default 2-byte UFT-16 encoding.
`class`	`ByteArrayNodeNonLeafVoidValue`	Similar to `CharArrayNodeNonLeafVoidValue` 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 Node
Modifier and Type	Field	Description
`private java.util.concurrent.atomic.AtomicReferenceArray<Node>`	ByteArrayNodeDefault.`outgoingEdges`
`private java.util.concurrent.atomic.AtomicReferenceArray<Node>`	ByteArrayNodeNonLeafNullValue.`outgoingEdges`
`private java.util.concurrent.atomic.AtomicReferenceArray<Node>`	ByteArrayNodeNonLeafVoidValue.`outgoingEdges`
`private java.util.List<Node>`	ByteArrayNodeDefault.`outgoingEdgesAsList`
`private java.util.List<Node>`	ByteArrayNodeNonLeafNullValue.`outgoingEdgesAsList`
`private java.util.List<Node>`	ByteArrayNodeNonLeafVoidValue.`outgoingEdgesAsList`

Methods in com.googlecode.concurrenttrees.radix.node.concrete.bytearray that return Node
Modifier and Type	Method	Description
`Node`	ByteArrayNodeDefault.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	ByteArrayNodeLeafNullValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	ByteArrayNodeLeafVoidValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	ByteArrayNodeLeafWithValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	ByteArrayNodeNonLeafNullValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	ByteArrayNodeNonLeafVoidValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`

Methods in com.googlecode.concurrenttrees.radix.node.concrete.bytearray that return types with arguments of type Node
Modifier and Type	Method	Description
`java.util.List<Node>`	ByteArrayNodeDefault.`getOutgoingEdges()`
`java.util.List<Node>`	ByteArrayNodeLeafNullValue.`getOutgoingEdges()`
`java.util.List<Node>`	ByteArrayNodeLeafVoidValue.`getOutgoingEdges()`
`java.util.List<Node>`	ByteArrayNodeLeafWithValue.`getOutgoingEdges()`
`java.util.List<Node>`	ByteArrayNodeNonLeafNullValue.`getOutgoingEdges()`
`java.util.List<Node>`	ByteArrayNodeNonLeafVoidValue.`getOutgoingEdges()`

Methods in com.googlecode.concurrenttrees.radix.node.concrete.bytearray with parameters of type Node
Modifier and Type	Method	Description
`void`	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 Node
Constructor	Description
`ByteArrayNodeDefault(java.lang.CharSequence edgeCharSequence, java.lang.Object value, java.util.List<Node> outgoingEdges)`
`ByteArrayNodeNonLeafNullValue(java.lang.CharSequence edgeCharSequence, java.util.List<Node> outgoingEdges)`
`ByteArrayNodeNonLeafVoidValue(java.lang.CharSequence edgeCharSequence, java.util.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 Node
Modifier and Type	Class	Description
`class`	`CharArrayNodeDefault`	A non-optimized implementation of the `Node` interface.
`class`	`CharArrayNodeLeafNullValue`	Stores only incoming edge as a `char[]`.
`class`	`CharArrayNodeLeafVoidValue`	Stores only incoming edge as a `char[]`.
`class`	`CharArrayNodeLeafWithValue`	Stores only incoming edge as a `char[]`, and a reference to a value.
`class`	`CharArrayNodeNonLeafNullValue`	Stores incoming edge as a `char[]` and outgoing edges as an `AtomicReferenceArray`.
`class`	`CharArrayNodeNonLeafVoidValue`	Stores incoming edge as a `char[]` and outgoing edges as an `AtomicReferenceArray`.

Fields in com.googlecode.concurrenttrees.radix.node.concrete.chararray with type parameters of type Node
Modifier and Type	Field	Description
`private java.util.concurrent.atomic.AtomicReferenceArray<Node>`	CharArrayNodeDefault.`outgoingEdges`
`private java.util.concurrent.atomic.AtomicReferenceArray<Node>`	CharArrayNodeNonLeafNullValue.`outgoingEdges`
`private java.util.concurrent.atomic.AtomicReferenceArray<Node>`	CharArrayNodeNonLeafVoidValue.`outgoingEdges`
`private java.util.List<Node>`	CharArrayNodeDefault.`outgoingEdgesAsList`
`private java.util.List<Node>`	CharArrayNodeNonLeafNullValue.`outgoingEdgesAsList`
`private java.util.List<Node>`	CharArrayNodeNonLeafVoidValue.`outgoingEdgesAsList`

Methods in com.googlecode.concurrenttrees.radix.node.concrete.chararray that return Node
Modifier and Type	Method	Description
`Node`	CharArrayNodeDefault.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharArrayNodeLeafNullValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharArrayNodeLeafVoidValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharArrayNodeLeafWithValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharArrayNodeNonLeafNullValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharArrayNodeNonLeafVoidValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`

Methods in com.googlecode.concurrenttrees.radix.node.concrete.chararray that return types with arguments of type Node
Modifier and Type	Method	Description
`java.util.List<Node>`	CharArrayNodeDefault.`getOutgoingEdges()`
`java.util.List<Node>`	CharArrayNodeLeafNullValue.`getOutgoingEdges()`
`java.util.List<Node>`	CharArrayNodeLeafVoidValue.`getOutgoingEdges()`
`java.util.List<Node>`	CharArrayNodeLeafWithValue.`getOutgoingEdges()`
`java.util.List<Node>`	CharArrayNodeNonLeafNullValue.`getOutgoingEdges()`
`java.util.List<Node>`	CharArrayNodeNonLeafVoidValue.`getOutgoingEdges()`

Methods in com.googlecode.concurrenttrees.radix.node.concrete.chararray with parameters of type Node
Modifier and Type	Method	Description
`void`	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 Node
Constructor	Description
`CharArrayNodeDefault(java.lang.CharSequence edgeCharSequence, java.lang.Object value, java.util.List<Node> outgoingEdges)`
`CharArrayNodeNonLeafNullValue(java.lang.CharSequence edgeCharSequence, java.util.List<Node> outgoingEdges)`
`CharArrayNodeNonLeafVoidValue(java.lang.CharSequence edgeCharSequence, java.util.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 Node
Modifier and Type	Class	Description
`class`	`CharSequenceNodeDefault`	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.
`class`	`CharSequenceNodeLeafNullValue`	Stores only incoming edge as a `CharSequence` (a view onto the original key) rather than copying the edge into a character array.
`class`	`CharSequenceNodeLeafVoidValue`	Stores only incoming edge as a `CharSequence` (a view onto the original key) rather than copying the edge into a character array.
`class`	`CharSequenceNodeLeafWithValue`	Stores incoming edge as a `CharSequence` (a view onto the original key) rather than copying the edge into a character array.
`class`	`CharSequenceNodeNonLeafNullValue`	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`.
`class`	`CharSequenceNodeNonLeafVoidValue`	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`.

Fields in com.googlecode.concurrenttrees.radix.node.concrete.charsequence with type parameters of type Node
Modifier and Type	Field	Description
`private java.util.concurrent.atomic.AtomicReferenceArray<Node>`	CharSequenceNodeDefault.`outgoingEdges`
`private java.util.concurrent.atomic.AtomicReferenceArray<Node>`	CharSequenceNodeNonLeafNullValue.`outgoingEdges`
`private java.util.concurrent.atomic.AtomicReferenceArray<Node>`	CharSequenceNodeNonLeafVoidValue.`outgoingEdges`
`private java.util.List<Node>`	CharSequenceNodeDefault.`outgoingEdgesAsList`
`private java.util.List<Node>`	CharSequenceNodeNonLeafNullValue.`outgoingEdgesAsList`
`private java.util.List<Node>`	CharSequenceNodeNonLeafVoidValue.`outgoingEdgesAsList`

Methods in com.googlecode.concurrenttrees.radix.node.concrete.charsequence that return Node
Modifier and Type	Method	Description
`Node`	CharSequenceNodeDefault.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharSequenceNodeLeafNullValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharSequenceNodeLeafVoidValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharSequenceNodeLeafWithValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharSequenceNodeNonLeafNullValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`
`Node`	CharSequenceNodeNonLeafVoidValue.`getOutgoingEdge(java.lang.Character edgeFirstCharacter)`

Methods in com.googlecode.concurrenttrees.radix.node.concrete.charsequence that return types with arguments of type Node
Modifier and Type	Method	Description
`java.util.List<Node>`	CharSequenceNodeDefault.`getOutgoingEdges()`
`java.util.List<Node>`	CharSequenceNodeLeafNullValue.`getOutgoingEdges()`
`java.util.List<Node>`	CharSequenceNodeLeafVoidValue.`getOutgoingEdges()`
`java.util.List<Node>`	CharSequenceNodeLeafWithValue.`getOutgoingEdges()`
`java.util.List<Node>`	CharSequenceNodeNonLeafNullValue.`getOutgoingEdges()`
`java.util.List<Node>`	CharSequenceNodeNonLeafVoidValue.`getOutgoingEdges()`

Methods in com.googlecode.concurrenttrees.radix.node.concrete.charsequence with parameters of type Node
Modifier and Type	Method	Description
`void`	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 Node
Constructor	Description
`CharSequenceNodeDefault(java.lang.CharSequence edgeCharSequence, java.lang.Object value, java.util.List<Node> outgoingEdges)`
`CharSequenceNodeNonLeafNullValue(java.lang.CharSequence edgeCharSequence, java.util.List<Node> outgoingEdges)`
`CharSequenceNodeNonLeafVoidValue(java.lang.CharSequence edgeCharSequence, java.util.List<Node> outgoingEdges)`

Uses of Node in com.googlecode.concurrenttrees.radix.node.util

Methods in com.googlecode.concurrenttrees.radix.node.util that return Node
Modifier and Type	Method	Description
`Node`	PrettyPrintable.`getNode()`

Method parameters in com.googlecode.concurrenttrees.radix.node.util with type arguments of type Node
Modifier and Type	Method	Description
`static int`	NodeUtil.`binarySearchForEdge(java.util.concurrent.atomic.AtomicReferenceArray<Node> childNodes, java.lang.Character edgeFirstCharacter)`	Returns the index of the node in the given `AtomicReferenceArray` whose edge starts with the given first character.
`static void`	NodeUtil.`ensureNoDuplicateEdges(java.util.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
Modifier and Type Method Description

Node ConcurrentInvertedRadixTree.getNode()
Uses of Node in com.googlecode.concurrenttrees.radixreversed

Methods in com.googlecode.concurrenttrees.radixreversed that return Node
Modifier and Type Method Description

Node ConcurrentReversedRadixTree.getNode()

Uses of Node in com.googlecode.concurrenttrees.solver

Methods in com.googlecode.concurrenttrees.solver with parameters of type Node
Modifier and Type	Method	Description
`protected java.lang.Iterable<ConcurrentRadixTree.NodeKeyPair>`	LCSubstringSolver.ConcurrentSuffixTreeImpl.`lazyTraverseDescendants(java.lang.CharSequence startKey, Node startNode)`
`(package private) boolean`	LCSubstringSolver.ConcurrentSuffixTreeImpl.`subTreeReferencesAllOriginalDocuments(java.lang.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
Modifier and Type Method Description

Node ConcurrentSuffixTree.getNode()