| Package | Description |
|---|---|
| org.apache.directory.mavibot.btree |
| Modifier and Type | Method and Description |
|---|---|
protected InMemoryNode<K,V> |
InMemoryNode.copy(long revision)
Copies the current page and all its keys, with a new revision.
|
private InMemoryNode<K,V> |
InMemoryBTreeBuilder.createParentNode(BTree<K,V> btree,
java.util.List<InMemoryNode<K,V>> nodes,
int maxElements)
Creates all the nodes using the provided node pages, and update the upper laye
|
| Modifier and Type | Method and Description |
|---|---|
private DeleteResult<K,V> |
InMemoryNode.borrowFromLeft(long revision,
MergedWithSiblingResult<K,V> mergedResult,
InMemoryNode<K,V> sibling,
int pos)
Borrows an element from the left sibling, creating a new sibling with one
less element and creating a new page where the element to remove has been
deleted and the borrowed element added on the left.
|
private DeleteResult<K,V> |
InMemoryNode.borrowFromRight(long revision,
MergedWithSiblingResult<K,V> mergedResult,
InMemoryNode<K,V> sibling,
int pos)
Borrows an element from the right sibling, creating a new sibling with one
less element and creating a new page where the element to remove has been
deleted and the borrowed element added on the right.
|
private DeleteResult<K,V> |
InMemoryNode.mergeWithSibling(long revision,
MergedWithSiblingResult<K,V> mergedResult,
InMemoryNode<K,V> sibling,
boolean isLeft,
int pos)
We have to merge the node with its sibling, both have N/2 elements before the element
removal.
|
| Modifier and Type | Method and Description |
|---|---|
private InMemoryNode<K,V> |
InMemoryBTreeBuilder.createParentNode(BTree<K,V> btree,
java.util.List<InMemoryNode<K,V>> nodes,
int maxElements)
Creates all the nodes using the provided node pages, and update the upper laye
|