Uses of Interface
org.apache.directory.mavibot.btree.DeleteResult

Packages that use DeleteResult

Package	Description
org.apache.directory.mavibot.btree

Uses of DeleteResult in org.apache.directory.mavibot.btree

Subinterfaces of DeleteResult in org.apache.directory.mavibot.btree

Modifier and Type	Interface and Description
(package private) interface	BorrowedFromSiblingResult<K,V> The result of an delete operation, when we have borrowed some element from a sibling.

Classes in org.apache.directory.mavibot.btree that implement DeleteResult

Modifier and Type	Class and Description
(package private) class	AbstractBorrowedFromSiblingResult<K,V> The result of a delete operation, when the child has not been merged, and when we have borrowed an element from the left sibling.
(package private) class	AbstractDeleteResult<K,V> An abstract class to gather common elements of the DeleteResult
(package private) class	BorrowedFromLeftResult<K,V> The result of a delete operation, when the child has not been merged, and when we have borrowed an element from the left sibling.
(package private) class	BorrowedFromRightResult<K,V> The result of a delete operation, when the child has not been merged.
(package private) class	MergedWithSiblingResult<K,V> The result of a delete operation, when the child has not been merged.
(package private) class	NotPresentResult<K,V> The result of an delete operation, when the key to delete is not present in the tree.
(package private) class	RemoveResult<K,V> The result of a delete operation, when the child has not been merged.

Methods in org.apache.directory.mavibot.btree that return DeleteResult

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>	PersistedNode.borrowFromLeft(long revision, MergedWithSiblingResult<K,V> mergedResult, PersistedNode<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>	InMemoryLeaf.borrowFromLeft(Tuple<K,V> removedElement, long revision, InMemoryLeaf<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>	PersistedLeaf.borrowFromLeft(Tuple<K,V> removedElement, long revision, PersistedLeaf<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>	PersistedNode.borrowFromRight(long revision, MergedWithSiblingResult<K,V> mergedResult, PersistedNode<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>	InMemoryLeaf.borrowFromRight(Tuple<K,V> removedElement, long revision, InMemoryLeaf<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>	PersistedLeaf.borrowFromRight(Tuple<K,V> removedElement, long revision, PersistedLeaf<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.
DeleteResult<K,V>	AbstractPage.delete(K key, V value, long revision) Deletes the value from an entry associated with the given key in this page.
DeleteResult<K,V>	Page.delete(K key, V value, long revision) Deletes the value from an entry associated with the given key in this page.
(package private) DeleteResult<K,V>	InMemoryNode.delete(K key, V value, long revision, Page<K,V> parent, int parentPos) The real delete implementation.
(package private) DeleteResult<K,V>	InMemoryLeaf.delete(K key, V value, long revision, Page<K,V> parent, int parentPos) The real delete implementation.
(package private) abstract DeleteResult<K,V>	AbstractPage.delete(K key, V value, long revision, Page<K,V> parent, int parentPos) The real delete implementation.
(package private) DeleteResult<K,V>	PersistedLeaf.delete(K key, V value, long revision, Page<K,V> parent, int parentPos) The real delete implementation.
(package private) DeleteResult<K,V>	PersistedNode.delete(K key, V value, long revision, Page<K,V> parent, int parentPos) The real delete implementation.
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.
private DeleteResult<K,V>	PersistedNode.mergeWithSibling(long revision, MergedWithSiblingResult<K,V> mergedResult, PersistedNode<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.
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.
private DeleteResult<K,V>	PersistedBTree.processDelete(K key, V value, long revision) Insert the tuple into the B-tree rootPage, get back the new rootPage