| Package | Description |
|---|---|
| org.apache.directory.mavibot.btree |
| Modifier and Type | Class and Description |
|---|---|
class |
EmptyTupleCursor<K,V>
A Cursor which is used when we have no element to return
|
| Modifier and Type | Method and Description |
|---|---|
TupleCursor<K,V> |
BTree.browse()
Creates a cursor starting at the beginning of the tree
|
TupleCursor<K,V> |
AbstractBTree.browse()
Creates a cursor starting at the beginning of the tree
|
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> |
BTree.browse(long revision)
Creates a cursor starting at the beginning of the tree, for a given revision
|
TupleCursor<K,V> |
AbstractBTree.browse(long revision)
Creates a cursor starting at the beginning of the tree, for a given revision
|
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.
|
TupleCursor<K,V> |
BTree.browseFrom(K key)
Creates a cursor starting on the given key
|
TupleCursor<K,V> |
AbstractBTree.browseFrom(K key)
Creates a cursor starting on the given key
|
TupleCursor<K,V> |
BTree.browseFrom(long revision,
K key)
Creates a cursor starting on the given key at the given revision
|
TupleCursor<K,V> |
AbstractBTree.browseFrom(long revision,
K key)
Creates a cursor starting on the given key at the given revision
|