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

Packages that use InsertResult

Package	Description
org.apache.directory.mavibot.btree

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

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

Modifier and Type	Class and Description
(package private) class	ExistsResult<K,V> The result of an insert operation, returned when the given tuple already exists in the btree that doesn't support duplicates, or while inserting a in a sub-btree that is used to hold the values of a key.
(package private) class	ModifyResult<K,V> The result of an insert operation, when the child has not been split.
(package private) class	SplitResult<K,V> The result of an insert operation, when the page has been split.

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

Modifier and Type	Method and Description
private InsertResult<K,V>	InMemoryNode.addAndSplit(java.util.List<Page<K,V>> copiedPages, long revision, K pivot, Page<K,V> leftPage, Page<K,V> rightPage, int pos) Splits a full page into two new pages, a left, a right and a pivot element.
private InsertResult<K,V>	PersistedNode.addAndSplit(java.util.List<Page<K,V>> copiedPages, long revision, K pivot, Page<K,V> leftPage, Page<K,V> rightPage, int pos) Splits a full page into two new pages, a left, a right and a pivot element.
private InsertResult<K,V>	InMemoryLeaf.addAndSplit(long revision, K key, V value, int pos) Split a full page into two new pages, a left, a right and a pivot element.
private InsertResult<K,V>	PersistedLeaf.addAndSplit(long revision, K key, V value, int pos) Split a full page into two new pages, a left, a right and a pivot element.
private InsertResult<K,V>	PersistedLeaf.addAndSplitSubTree(long revision, K key, int pos) same as PersistedLeaf.addAndSplit(long, Object, Object, int) except the values are not copied.
(package private) InsertResult<K,V>	InMemoryBTree.insert(K key, V value, long revision) Insert an entry in the BTree.
InsertResult<K,V>	InMemoryNode.insert(K key, V value, long revision)
InsertResult<K,V>	InMemoryLeaf.insert(K key, V value, long revision)
InsertResult<K,V>	PersistedLeaf.insert(K key, V value, long revision)
(package private) InsertResult<K,V>	PersistedBTree.insert(K key, V value, long revision) Insert an entry in the BTree.
InsertResult<K,V>	PersistedNode.insert(K key, V value, long revision)
InsertResult<K,V>	Page.insert(K key, V value, long revision) Inserts the given key and value into this page.
(package private) abstract InsertResult<K,V>	AbstractBTree.insert(K key, V value, long revision)
private InsertResult<K,V>	InMemoryNode.insertChild(java.util.List<Page<K,V>> copiedPages, long revision, K key, Page<K,V> leftPage, Page<K,V> rightPage, int pos) Adds a new key into a copy of the current page at a given position.
private InsertResult<K,V>	PersistedNode.insertChild(java.util.List<Page<K,V>> copiedPages, long revision, K key, Page<K,V> leftPage, Page<K,V> rightPage, int pos) Adds a new key into a copy of the current page at a given position.
private InsertResult<K,V>	PersistedBTree.processInsert(K key, V value, long revision) Insert the tuple into the B-tree rootPage, get back the new rootPage
private InsertResult<K,V>	InMemoryNode.replaceChild(long revision, ModifyResult<K,V> result, int pos) This method is used when we have to replace a child in a page when we have found the key in the tree (the value will be changed, so we have made copies of the existing pages).
private InsertResult<K,V>	PersistedNode.replaceChild(long revision, ModifyResult<K,V> result, int pos) This method is used when we have to replace a child in a page when we have found the key in the tree (the value will be changed, so we have made copies of the existing pages).
private InsertResult<K,V>	InMemoryLeaf.replaceElement(long revision, K key, V value, int pos) Copy the current page if needed, and replace the value at the position we have found the key.
private InsertResult<K,V>	PersistedLeaf.replaceElement(long revision, K key, V value, int pos) Copy the current page if needed, and replace the value at the position we have found the key.