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

Packages that use Node

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.suffix

Uses of Node in com.googlecode.concurrenttrees.radix

Fields in com.googlecode.concurrenttrees.radix declared as Node

Node	ConcurrentRadixTree.NodeKeyPair.node
protected Node	ConcurrentRadixTree.root

Methods in com.googlecode.concurrenttrees.radix that return Node

Node	ConcurrentRadixTree.getNode()

Methods in com.googlecode.concurrenttrees.radix with parameters of type Node

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 Node

ConcurrentRadixTree.NodeKeyPair(Node node, CharSequence key)

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

Methods in com.googlecode.concurrenttrees.radix.node that return Node

Node	NodeFactory.createNode(CharSequence edgeCharacters, Object value, 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(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

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

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

Node

NodeFactory.createNode(CharSequence edgeCharacters, Object value, 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

Node	SmartArrayBasedNodeFactory.createNode(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot)
Node	DefaultCharSequenceNodeFactory.createNode(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot)
Node	DefaultCharArrayNodeFactory.createNode(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot)
Node	DefaultByteArrayNodeFactory.createNode(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot)

Method parameters in com.googlecode.concurrenttrees.radix.node.concrete with type arguments of type Node

Node	SmartArrayBasedNodeFactory.createNode(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot)
Node	DefaultCharSequenceNodeFactory.createNode(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot)
Node	DefaultCharArrayNodeFactory.createNode(CharSequence edgeCharacters, Object value, List<Node> childNodes, boolean isRoot)
Node	DefaultByteArrayNodeFactory.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 Node

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.

Methods in com.googlecode.concurrenttrees.radix.node.concrete.bytearray that return Node

Node	ByteArrayNodeNonLeafVoidValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	ByteArrayNodeNonLeafNullValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	ByteArrayNodeLeafWithValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	ByteArrayNodeLeafVoidValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	ByteArrayNodeLeafNullValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	ByteArrayNodeDefault.getOutgoingEdge(Character edgeFirstCharacter)

Methods in com.googlecode.concurrenttrees.radix.node.concrete.bytearray that return types with arguments of type Node

List<Node>	ByteArrayNodeNonLeafVoidValue.getOutgoingEdges()
List<Node>	ByteArrayNodeNonLeafNullValue.getOutgoingEdges()
List<Node>	ByteArrayNodeLeafWithValue.getOutgoingEdges()
List<Node>	ByteArrayNodeLeafVoidValue.getOutgoingEdges()
List<Node>	ByteArrayNodeLeafNullValue.getOutgoingEdges()
List<Node>	ByteArrayNodeDefault.getOutgoingEdges()

Methods in com.googlecode.concurrenttrees.radix.node.concrete.bytearray with parameters of type Node

void	ByteArrayNodeNonLeafVoidValue.updateOutgoingEdge(Node childNode)
void	ByteArrayNodeNonLeafNullValue.updateOutgoingEdge(Node childNode)
void	ByteArrayNodeLeafWithValue.updateOutgoingEdge(Node childNode)
void	ByteArrayNodeLeafVoidValue.updateOutgoingEdge(Node childNode)
void	ByteArrayNodeLeafNullValue.updateOutgoingEdge(Node childNode)
void	ByteArrayNodeDefault.updateOutgoingEdge(Node childNode)

Constructor parameters in com.googlecode.concurrenttrees.radix.node.concrete.bytearray with type arguments of type Node

ByteArrayNodeDefault(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 Node

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.

Methods in com.googlecode.concurrenttrees.radix.node.concrete.chararray that return Node

Node	CharArrayNodeNonLeafVoidValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharArrayNodeNonLeafNullValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharArrayNodeLeafWithValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharArrayNodeLeafVoidValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharArrayNodeLeafNullValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharArrayNodeDefault.getOutgoingEdge(Character edgeFirstCharacter)

Methods in com.googlecode.concurrenttrees.radix.node.concrete.chararray that return types with arguments of type Node

List<Node>	CharArrayNodeNonLeafVoidValue.getOutgoingEdges()
List<Node>	CharArrayNodeNonLeafNullValue.getOutgoingEdges()
List<Node>	CharArrayNodeLeafWithValue.getOutgoingEdges()
List<Node>	CharArrayNodeLeafVoidValue.getOutgoingEdges()
List<Node>	CharArrayNodeLeafNullValue.getOutgoingEdges()
List<Node>	CharArrayNodeDefault.getOutgoingEdges()

Methods in com.googlecode.concurrenttrees.radix.node.concrete.chararray with parameters of type Node

void	CharArrayNodeNonLeafVoidValue.updateOutgoingEdge(Node childNode)
void	CharArrayNodeNonLeafNullValue.updateOutgoingEdge(Node childNode)
void	CharArrayNodeLeafWithValue.updateOutgoingEdge(Node childNode)
void	CharArrayNodeLeafVoidValue.updateOutgoingEdge(Node childNode)
void	CharArrayNodeLeafNullValue.updateOutgoingEdge(Node childNode)
void	CharArrayNodeDefault.updateOutgoingEdge(Node childNode)

Constructor parameters in com.googlecode.concurrenttrees.radix.node.concrete.chararray with type arguments of type Node

CharArrayNodeDefault(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 Node

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.

Methods in com.googlecode.concurrenttrees.radix.node.concrete.charsequence that return Node

Node	CharSequenceNodeNonLeafVoidValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharSequenceNodeNonLeafNullValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharSequenceNodeLeafWithValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharSequenceNodeLeafVoidValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharSequenceNodeLeafNullValue.getOutgoingEdge(Character edgeFirstCharacter)
Node	CharSequenceNodeDefault.getOutgoingEdge(Character edgeFirstCharacter)

Methods in com.googlecode.concurrenttrees.radix.node.concrete.charsequence that return types with arguments of type Node

List<Node>	CharSequenceNodeNonLeafVoidValue.getOutgoingEdges()
List<Node>	CharSequenceNodeNonLeafNullValue.getOutgoingEdges()
List<Node>	CharSequenceNodeLeafWithValue.getOutgoingEdges()
List<Node>	CharSequenceNodeLeafVoidValue.getOutgoingEdges()
List<Node>	CharSequenceNodeLeafNullValue.getOutgoingEdges()
List<Node>	CharSequenceNodeDefault.getOutgoingEdges()

Methods in com.googlecode.concurrenttrees.radix.node.concrete.charsequence with parameters of type Node

void	CharSequenceNodeNonLeafVoidValue.updateOutgoingEdge(Node childNode)
void	CharSequenceNodeNonLeafNullValue.updateOutgoingEdge(Node childNode)
void	CharSequenceNodeLeafWithValue.updateOutgoingEdge(Node childNode)
void	CharSequenceNodeLeafVoidValue.updateOutgoingEdge(Node childNode)
void	CharSequenceNodeLeafNullValue.updateOutgoingEdge(Node childNode)
void	CharSequenceNodeDefault.updateOutgoingEdge(Node childNode)

Constructor parameters in com.googlecode.concurrenttrees.radix.node.concrete.charsequence with type arguments of type Node

CharSequenceNodeDefault(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 Node

Node	PrettyPrintable.getNode()

Method parameters in com.googlecode.concurrenttrees.radix.node.util with type arguments of type Node

static int	NodeUtil.binarySearchForEdge(AtomicReferenceArray<Node> childNodes, Character edgeFirstCharacter) Returns the index of the node in the given AtomicReferenceArray 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

Node	ConcurrentInvertedRadixTree.getNode()

Uses of Node in com.googlecode.concurrenttrees.radixreversed

Methods in com.googlecode.concurrenttrees.radixreversed that return Node

Node	ConcurrentReversedRadixTree.getNode()

Uses of Node in com.googlecode.concurrenttrees.suffix

Methods in com.googlecode.concurrenttrees.suffix that return Node

Node	ConcurrentSuffixTree.getNode()