Uses of Class
com.bigdata.btree.Leaf

Packages that use Leaf

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 Leaf in com.bigdata.btree

Classes in com.bigdata.btree with type parameters of type Leaf

Modifier and Type	Class and Description
class	AbstractBTreeTupleCursor<I extends AbstractBTree,L extends Leaf,E> Class supporting random access to tuples and sequential tuple-based cursor movement for an AbstractBTree.
interface	ILeafCursor<L extends Leaf> Leaf cursor interface.

Subclasses of Leaf in com.bigdata.btree

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

Methods in com.bigdata.btree that return Leaf

Modifier and Type	Method and Description
Leaf	IndexSegmentBuilder.NOPNodeFactory.allocLeaf(AbstractBTree btree, long addr, ILeafData data)
Leaf	BTree.NodeFactory.allocLeaf(AbstractBTree btree, long addr, ILeafData data)
Leaf	INodeFactory.allocLeaf(AbstractBTree btree, long addr, ILeafData data) Create a leaf.
Leaf	IndexSegment.ImmutableNodeFactory.allocLeaf(AbstractBTree btree, long addr, ILeafData data)
Leaf	BTree.LeafCursor.first()
Leaf	BTree.LeafCursor.last()
Leaf	BTree.LeafCursor.leaf()
Leaf	BTree.LeafCursor.next()
Leaf	BTree.LeafCursor.prior() Materialize the prior leaf in the natural order of the index (this is more general than the right sibling which is restricted to leaves that are children of the same direct parent).
Leaf	BTree.LeafCursor.seek(byte[] key) Descend from the root node to the leaf spanning that key.
Leaf	BTree.LeafCursor.seek(ILeafCursor<Leaf> src)

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

Modifier and Type	Method and Description
static void	AbstractBTreeTestCase.assertSameLeaf(Leaf n1, Leaf n2) Compares leaves for the same data.
void	AbstractBTreeTestCase.assertValues(Object[] values, Leaf leaf)
void	AbstractBTreeTestCase.assertValues(String msg, Object[] values, Leaf leaf) Test helper verifies the #of values, their ordered values, and that all values beyond the last defined value are null.

Method parameters in com.bigdata.btree with type arguments of type Leaf

Modifier and Type	Method and Description
protected com.bigdata.btree.AbstractBTreeTupleCursor.ReadOnlyCursorPosition<E>	AbstractBTreeTupleCursor.ReadOnlyBTreeTupleCursor.newPosition(ILeafCursor<Leaf> leafCursor, int index, byte[] key)
protected com.bigdata.btree.AbstractBTreeTupleCursor.MutableCursorPosition<E>	AbstractBTreeTupleCursor.MutableBTreeTupleCursor.newPosition(ILeafCursor<Leaf> leafCursor, int index, byte[] key)
protected com.bigdata.btree.AbstractBTreeTupleCursor.ReadOnlyCursorPosition<E>	AbstractBTreeTupleCursor.ReadOnlyBTreeTupleCursor.newTemporaryPosition(com.bigdata.btree.AbstractBTreeTupleCursor.ICursorPosition<Leaf,E> p)
protected com.bigdata.btree.AbstractBTreeTupleCursor.ReadOnlyCursorPosition<E>	AbstractBTreeTupleCursor.MutableBTreeTupleCursor.newTemporaryPosition(com.bigdata.btree.AbstractBTreeTupleCursor.ICursorPosition<Leaf,E> p) Note: This is only used by AbstractBTreeTupleCursor.hasNext() and AbstractBTreeTupleCursor.hasPrior() for a temporary test without side-effects on the state of the ITupleCursor and therefore we do NOTNOT register an Leaf.ILeafListener since that is just more overhead and it will not be used.
Leaf	BTree.LeafCursor.seek(ILeafCursor<Leaf> src)

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

Constructor and Description
Leaf(Leaf src) Copy constructor.
LeafTupleIterator(Leaf leaf)
LeafTupleIterator(Leaf leaf, AbstractTuple<E> tuple)
LeafTupleIterator(Leaf leaf, AbstractTuple<E> tuple, byte[] fromKey, byte[] toKey)