| Package | Description |
|---|---|
| org.apache.directory.mavibot.btree |
| Modifier and Type | Method and Description |
|---|---|
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> |
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.
|
private void |
RecordManager.checkFreePages() |
<K,V> Page<K,V> |
RecordManager.deserialize(BTree<K,V> btree,
long offset)
Deserialize a Page from a B-tree at a give position
|
private long |
RecordManager.dumpBtreeHeader(long btreeOffset)
Dump a B-tree Header
|
private void |
RecordManager.dumpFreePages(long freePageOffset)
Dump the free pages
|
(package private) PageIO |
RecordManager.fetchPage(long offset)
fetch a page from disk, knowing its position in the file.
|
Tuple<K,V> |
AbstractPage.findLeftMost()
Finds the leftmost element in this page.
|
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.
|
Tuple<K,V> |
InMemoryLeaf.findRightMost()
Finds the rightmost element in this page.
|
Tuple<K,V> |
AbstractPage.findRightMost()
Finds the rightmost element in this page.
|
Tuple<K,V> |
PersistedLeaf.findRightMost()
Finds the rightmost element in this page.
|
Tuple<K,V> |
Page.findRightMost()
Finds the rightmost element in this page.
|
(package private) <K,V> void |
RecordManager.freePages(BTree<K,V> btree,
long revision,
java.util.List<Page<K,V>> pages)
Move a list of pages to the free page list.
|
boolean |
Cursor.hasNext()
Tells if the cursor can return a next element
|
boolean |
KeyCursor.hasNext()
Tells if the cursor can return a next element
|
boolean |
TupleCursor.hasNext()
Tells if the cursor can return a next element
|
boolean |
EmptyValueCursor.hasNext()
Tells if the cursor can return a next element
|
boolean |
KeyCursor.hasNextKey()
Tells if the cursor can return a next key
|
boolean |
TupleCursor.hasNextKey()
Tells if the cursor can return a next key
|
boolean |
EmptyValueCursor.hasNextKey()
Tells if the cursor can return a next key
|
private boolean |
KeyCursor.hasNextParentPos()
Tells if there is a next ParentPos
|
private boolean |
TupleCursor.hasNextParentPos()
Tells if there is a next ParentPos
|
boolean |
Cursor.hasPrev()
Tells if the cursor can return a previous element
|
boolean |
KeyCursor.hasPrev()
Tells if the cursor can return a previous element
|
boolean |
ValueArrayCursor.hasPrev()
Tells if the cursor can return a previous element
|
boolean |
TupleCursor.hasPrev()
Tells if the cursor can return a previous element
|
boolean |
EmptyValueCursor.hasPrev()
Tells if the cursor can return a previous element
|
boolean |
ValueBTreeCursor.hasPrev()
Tells if the cursor can return a previous element
|
boolean |
KeyCursor.hasPrevKey()
Tells if the cursor can return a previous key
|
boolean |
TupleCursor.hasPrevKey()
Tells if the cursor can return a previous key
|
boolean |
EmptyValueCursor.hasPrevKey()
Tells if the cursor can return a previous key
|
private boolean |
KeyCursor.hasPrevParentPos()
Tells if there is a prev ParentPos
|
private boolean |
TupleCursor.hasPrevParentPos()
Tells if there is a prev ParentPos
|
private <K,V> void |
RecordManager.loadBtree(PageIO[] pageIos,
BTree<K,V> btree)
Read a B-tree from the disk.
|
(package private) <K,V> void |
RecordManager.loadBtree(PageIO[] pageIos,
BTree btree,
BTree<K,V> parentBTree)
Read a B-tree from the disk.
|
private DeleteResult<K,V> |
InMemoryLeaf.mergeWithSibling(Tuple<K,V> removedElement,
long revision,
InMemoryLeaf<K,V> sibling,
boolean isLeft,
int pos)
Merges the sibling with the current leaf, after having removed the element in the page.
|
private DeleteResult<K,V> |
PersistedLeaf.mergeWithSibling(Tuple<K,V> removedElement,
long revision,
PersistedLeaf<K,V> sibling,
boolean isLeft,
int pos)
Merges the sibling with the current leaf, after having removed the element in the page.
|
V |
ValueCursor.next()
Find the next key/value
|
K |
KeyCursor.next()
Find the next key
|
Tuple<K,V> |
TupleCursor.next()
Find the next key/value
|
V |
EmptyValueCursor.next()
Find the next key/value
|
K |
KeyCursor.nextKey()
Get the next key.
|
Tuple<K,V> |
TupleCursor.nextKey()
Get the next non-duplicate key.
|
V |
ValueCursor.prev()
Find the previous key/value
|
K |
KeyCursor.prev()
Find the previous key
|
V |
ValueArrayCursor.prev()
Find the previous key/value
|
Tuple<K,V> |
TupleCursor.prev()
Find the previous key/value
|
V |
EmptyValueCursor.prev()
Find the previous key/value
|
V |
ValueBTreeCursor.prev()
Find the previous key/value
|
K |
KeyCursor.prevKey()
Get the previous key.
|
Tuple<K,V> |
TupleCursor.prevKey()
Get the previous non-duplicate key.
|
(package private) PageIO[] |
RecordManager.readPageIOs(long position,
long limit)
Reads all the PageIOs that are linked to the page at the given position, including
the first page.
|
private <K,V> Page<K,V> |
RecordManager.readRootPage(BTree<K,V> btree,
long btreeHeaderOffset)
Read a root page from the B-tree header offset
|
(package private) <K,V> long |
RecordManager.updateBtreeHeader(BTree<K,V> btree,
long btreeHeaderOffset)
Update the B-tree header after a B-tree modification.
|
private <K,V> long |
RecordManager.updateBtreeHeader(BTree<K,V> btree,
long btreeHeaderOffset,
boolean onPlace)
Update the B-tree header after a B-tree modification.
|
(package private) <K,V> void |
RecordManager.updateBtreeHeaderOnPlace(BTree<K,V> btree,
long btreeHeaderOffset)
Update the B-tree header after a B-tree modification.
|