Uses of Class
com.bigdata.btree.Node

Packages that use Node

Package	Description
com.bigdata.btree	The BTree is a scalable B+-Tree with copy-on-write semantics mapping variable length unsigned byte[] keys to variable length byte[] values (null values are allowed).

Uses of Node in com.bigdata.btree

Subclasses of Node in com.bigdata.btree

Modifier and Type	Class and Description
static class	IndexSegment.ImmutableNodeFactory.ImmutableNode Immutable node throws UnsupportedOperationException for the public mutator API but does not try to override all low-level mutation behaviors.

Fields in com.bigdata.btree with type parameters of type Node

Modifier and Type	Field and Description
protected Reference<Node>	AbstractNode.parent The parent of this node.

Methods in com.bigdata.btree that return Node

Modifier and Type	Method and Description
Node	IndexSegmentBuilder.NOPNodeFactory.allocNode(AbstractBTree btree, long addr, INodeData data)
Node	BTree.NodeFactory.allocNode(AbstractBTree btree, long addr, INodeData data)
Node	INodeFactory.allocNode(AbstractBTree btree, long addr, INodeData data) Create a node.
Node	IndexSegment.ImmutableNodeFactory.allocNode(AbstractBTree btree, long addr, INodeData data)
Node	AbstractNode.getParent() The parent iff the node has been added as the child of another node and the parent reference has not been cleared.
Node	BTree.Stack.peek() Return the element on the top of the stack.
Node	BTree.Stack.pop() Pop an element off of the stack.

Methods in com.bigdata.btree with parameters of type Node

Modifier and Type	Method and Description
static void	AbstractBTreeTestCase.assertChildKeys(long[] childAddr, Node node) Special purpose helper used to vet Node#childAddr.
static void	AbstractBTreeTestCase.assertSameNode(Node n1, Node n2) Compares two nodes (or leaves) for the same data.
protected void	Node.prefetchChildLeaves(Node node, byte[] fromKey, byte[] toKey) When we visit a node whose children are leaves, schedule memoization of those leaves whose separator key in the node is LT the toKey (non-blocking).
protected void	Node.prefetchRightSibling(Node node, byte[] toKey) If the caller's toKey is GT the separator keys for the children of this node then the iterator will need to visit the rightSibling of the node and this method will schedule the memoization of the node's rightSibling in order to reduce the IO latency when the iterator visit that rightSibling (non-blocking).
void	BTree.Stack.push(Node item) Push an element onto the stack.

Constructors in com.bigdata.btree with parameters of type Node

Constructor and Description
Node(Node src, long triggeredByChildId) Copy constructor.