| Package | Description |
|---|---|
| org.apache.directory.mavibot.btree |
| Modifier and Type | Field and Description |
|---|---|
protected ParentPos<K,K>[] |
KeyCursor.stack
The stack of pages from the root down to the leaf
|
protected ParentPos<K,V>[] |
TupleCursor.stack
The stack of pages from the root down to the leaf
|
| Modifier and Type | Method and Description |
|---|---|
private ParentPos<K,K> |
KeyCursor.findNextParentPos()
Find the leaf containing the following elements.
|
private ParentPos<K,V> |
TupleCursor.findNextParentPos()
Find the leaf containing the following elements.
|
private ParentPos<K,K> |
KeyCursor.findPrevParentPos()
Find the leaf containing the previous elements.
|
private ParentPos<K,V> |
TupleCursor.findPrevParentPos()
Find the leaf containing the previous elements.
|
| Modifier and Type | Method and Description |
|---|---|
(package private) static <K,V> java.util.LinkedList<ParentPos<K,V>> |
BTreeFactory.getPathToLeftMostLeaf(BTree<K,V> btree)
Includes the intermediate nodes in the path up to and including the left most leaf of the tree
|
(package private) static <K,V> java.util.LinkedList<ParentPos<K,V>> |
BTreeFactory.getPathToRightMostLeaf(BTree<K,V> btree)
Includes the intermediate nodes in the path up to and including the right most leaf of the tree
|
| Modifier and Type | Method and Description |
|---|---|
TupleCursor<K,V> |
InMemoryLeaf.browse(K key,
ReadTransaction<K,V> transaction,
ParentPos<K,V>[] stack,
int depth)
Browses the tree, looking for the given key, and creates a Cursor on top
of the found result.
|
TupleCursor<K,V> |
AbstractPage.browse(K key,
ReadTransaction<K,V> transaction,
ParentPos<K,V>[] stack,
int depth)
Browses the tree, looking for the given key, and creates a Cursor on top
of the found result.
|
TupleCursor<K,V> |
PersistedLeaf.browse(K key,
ReadTransaction<K,V> transaction,
ParentPos<K,V>[] stack,
int depth)
Browses the tree, looking for the given key, and creates a Cursor on top
of the found result.
|
TupleCursor<K,V> |
Page.browse(K key,
ReadTransaction<K,V> transaction,
ParentPos<K,V>[] stack,
int depth)
Browses the tree, looking for the given key, and creates a Cursor on top
of the found result.
|
TupleCursor<K,V> |
InMemoryLeaf.browse(ReadTransaction<K,V> transaction,
ParentPos<K,V>[] stack,
int depth)
Browses the whole tree, and creates a Cursor on top of it.
|
TupleCursor<K,V> |
AbstractPage.browse(ReadTransaction<K,V> transaction,
ParentPos<K,V>[] stack,
int depth)
Browses the whole tree, and creates a Cursor on top of it.
|
TupleCursor<K,V> |
PersistedLeaf.browse(ReadTransaction<K,V> transaction,
ParentPos<K,V>[] stack,
int depth)
Browses the whole tree, and creates a Cursor on top of it.
|
TupleCursor<K,V> |
Page.browse(ReadTransaction<K,V> transaction,
ParentPos<K,V>[] stack,
int depth)
Browses the whole tree, and creates a Cursor on top of it.
|
KeyCursor<K> |
InMemoryLeaf.browseKeys(ReadTransaction<K,K> transaction,
ParentPos<K,K>[] stack,
int depth)
Browses the keys of whole tree, and creates a Cursor on top of it.
|
KeyCursor<K> |
AbstractPage.browseKeys(ReadTransaction<K,K> transaction,
ParentPos<K,K>[] stack,
int depth)
Browses the keys of whole tree, and creates a Cursor on top of it.
|
KeyCursor<K> |
PersistedLeaf.browseKeys(ReadTransaction<K,K> transaction,
ParentPos<K,K>[] stack,
int depth)
Browses the keys of whole tree, and creates a Cursor on top of it.
|
KeyCursor<K> |
Page.browseKeys(ReadTransaction<K,K> transaction,
ParentPos<K,K>[] stack,
int depth)
Browses the keys of whole tree, and creates a Cursor on top of it.
|
| Constructor and Description |
|---|
KeyCursor(ReadTransaction<K,K> transaction,
ParentPos<K,K>[] stack,
int depth)
Creates a new instance of Cursor, starting on a page at a given position.
|
TupleCursor(ReadTransaction<K,V> transaction,
ParentPos<K,V>[] stack,
int depth)
Creates a new instance of Cursor, starting on a page at a given position.
|