| Access | Constructor and Description |
|---|---|
| public | |
| pack-priv | LeafControlRow(OpenBTree
The open btree to allocate this page from. btree, Page The newly allocated page where the control row will
be inserted. page, ControlRow The parent of the leaf page. Set to null for root.
RESOLVE (mikem) - set to null otherwise? parent, boolean Is this page the root of the tree? isRoot)Constructs a leaf-page control row, for a newly allocated leaf page. |
| Modifier and Type | Method and Description |
|---|---|
| private static LeafControlRow | allocate(OpenBTree
The open conglomerate from which to get the leaf from btree, ControlRow The parent page of the newly allocated page, null if
allocating root page. parent)Allocate a new leaf page to the conglomerate. |
| public int | checkConsistency(OpenBTree
The open btree to associate latches/locks with. btree, ControlRow The parent page of this page, "null" if this page is
root or if not maintaining parent links. parent, boolean Should the consistency check go to other pages (this
option breaks the latch protocol). check_other_pages)Implements abstract org. Perform consistency checks on a leaf page.</menu> |
| protected final void | controlRowInit()
Implements abstract org. Perform page specific initialization. |
| private float | Returns: The requested non_deleted_row_count.Count non deleted row up to and including this slot. startslot)Return the number of non-deleted rows from slot 1 through "startslot" Return the number of non-deleted rows that exist on the page starting at slot one through "startslot". |
| protected ControlRow | Returns: The page which is the leftmost child of this page.The open btree to associate latches/locks with. btree)Implements abstract org. Return the left child pointer for the page. |
| protected final int | Returns: The total number of columns in the control row.Implements abstract org. Get the number of columns in the control row. |
| protected ControlRow | Returns: The page which is the rightmost child of this page.The open btree to associate latches/locks with. btree)Implements abstract org. Return the right child pointer for the page. |
| public int | getTypeFormatId()
Implements org. Return my format identifier. |
| private static void | growRoot(OpenBTree open_btree, DataValueDescriptor[] template, LeafControlRow leafroot)
Grow a new root page from a leaf page. |
| public static void | initEmptyBtree(OpenBTree
The open btree to initialize (container is open). open_btree)Initialize conglomerate with one page, to be a 1 page btree. |
| public boolean | Returns: true if the current page is the leftmost leaf of the tree, else return false.Implements abstract org. Is the current page the leftmost leaf of tree? |
| public boolean | Returns: true if the current page is the rightmost leaf of the tree, else return false.Implements abstract org. Is the current page the rightmost leaf of tree? |
| public void | printTree(OpenBTree btree)
Implements abstract org. Recursively print the tree starting at current node in tree. |
| public ControlRow | search(SearchParameters sp)
Implements abstract org. Perform a search of this leaf page, ultimately returning the latched leaf page and row slot after which the given key belongs. |
| protected ControlRow | Returns: The leftmost leaf page.The open btree to associate latches/locks with. btree)Implements abstract org. Search and return the left most leaf page. |
| protected ControlRow | Returns: The rightmost leaf page.The open btree to associate latches/locks with. btree)Implements abstract org. Search and return the right most leaf page. |
| protected boolean | shrinkFor(OpenBTree btree, DataValueDescriptor[] key)
Implements abstract org. Perform a recursive shrink operation for the key. |
| protected long | Returns: page number of the newly allocated leaf page created by split.The open btree to associate latches with. open_btree, DataValueDescriptor[] A scratch area to use while searching for split pass. template, BranchControlRow The parent page of the current page in the split pass.
starts at null for root. parent_page, DataValueDescriptor[] The key to make room for during the split pass. splitrow, int A flag used to direct where point of split should be
chosen. flag)Implements abstract org. Perform a top down split pass making room for the the key in "row". |
| LeafControlRow | back to summary |
|---|---|
| public LeafControlRow() No arg constructor. Public no arg constructor is for the monitor to call for format id implemenation, it should not be called for any other reason. | |
| LeafControlRow | back to summary |
|---|---|
| pack-priv LeafControlRow(OpenBTree btree, Page page, ControlRow parent, boolean isRoot) throws StandardException Constructs a leaf-page control row, for a newly allocated leaf page.
| |
| allocate | back to summary |
|---|---|
| private static LeafControlRow allocate(OpenBTree btree, ControlRow parent) throws StandardException Allocate a new leaf page to the conglomerate.
| |
| checkConsistency | back to summary |
|---|---|
| public int checkConsistency(OpenBTree btree, ControlRow parent, boolean check_other_pages) throws StandardException Implements abstract org. Perform consistency checks on a leaf page. Check consistency of the page and its children, returning the number of pages seen, and throwing errors if inconsistencies are found. The checks specific to a leaf page are: This method also performs the consistency checks that are common to both leaf and branch pages.
| |
| controlRowInit | back to summary |
|---|---|
| protected final void controlRowInit() Implements abstract org. Perform page specific initialization.
| |
| get_left_nondeleted_rowcnt | back to summary |
|---|---|
| private float get_left_nondeleted_rowcnt(int startslot) throws StandardException Return the number of non-deleted rows from slot 1 through "startslot" Return the number of non-deleted rows that exist on the page starting at slot one through "startslot". RESOLVE (mikem) - is the expense of this routine worth it, it is only used for costing. Could an estimate from the nonDeletedRecordCount() be used instead?
| |
| getLeftChild | back to summary |
|---|---|
| protected ControlRow getLeftChild(OpenBTree btree) throws StandardException Implements abstract org. Return the left child pointer for the page. Leaf pages don't have children, so they override this and return null.
| |
| getNumberOfControlRowColumns | back to summary |
|---|---|
| protected final int getNumberOfControlRowColumns() Implements abstract org. Get the number of columns in the control row. Control rows all share the first columns as defined by this class and then add columns to the end of the control row. For instance a branch control row add a child page pointer field.
| |
| getRightChild | back to summary |
|---|---|
| protected ControlRow getRightChild(OpenBTree btree) throws StandardException Implements abstract org. Return the right child pointer for the page. Leaf pages don't have children, so they override this and return null.
| |
| getTypeFormatId | back to summary |
|---|---|
| public int getTypeFormatId() Implements org. Return my format identifier.
| |
| growRoot | back to summary |
|---|---|
| private static void growRoot(OpenBTree open_btree, DataValueDescriptor[] template, LeafControlRow leafroot) throws StandardException Grow a new root page from a leaf page. Slightly tricky because we want to retain page 0 as the root. On entry, the current leaf root page is expected to be latched. On exit, all latches will have been released. The caller cannot not assume success. If we have to release latches this routine just returns and assumes the caller will retry the grow root if necessary. | |
| initEmptyBtree | back to summary |
|---|---|
| public static void initEmptyBtree(OpenBTree open_btree) throws StandardException Initialize conglomerate with one page, to be a 1 page btree. Given a conglomerate which already has one page allocated to it, initialize the page to be a leaf-root page with no entries. Allocate the control row and store it on the page.
| |
| isLeftmostLeaf | back to summary |
|---|---|
| public boolean isLeftmostLeaf() throws StandardException Implements abstract org. Is the current page the leftmost leaf of tree?
| |
| isRightmostLeaf | back to summary |
|---|---|
| public boolean isRightmostLeaf() throws StandardException Implements abstract org. Is the current page the rightmost leaf of tree?
| |
| printTree | back to summary |
|---|---|
| public void printTree(OpenBTree btree) throws StandardException Implements abstract org. Recursively print the tree starting at current node in tree. This is a leaf so return.
| |
| search | back to summary |
|---|---|
| public ControlRow search(SearchParameters sp) throws StandardException Implements abstract org. Perform a search of this leaf page, ultimately returning the latched leaf page and row slot after which the given key belongs. The slot is returned in the result structure. If the key exists on the page, the result.exact will be true. Otherwise, result.exact will be false, and the row slot returned will be the one immediately preceding the position at which the key belongs.
| |
| searchLeft | back to summary |
|---|---|
| protected ControlRow searchLeft(OpenBTree btree) throws StandardException Implements abstract org. Search and return the left most leaf page. Perform a recursive search, ultimately returning the leftmost leaf page which is the first leaf page in the leaf sibling chain. (This method might better be called getFirstLeafPage()).
| |
| searchRight | back to summary |
|---|---|
| protected ControlRow searchRight(OpenBTree btree) throws StandardException Implements abstract org. Search and return the right most leaf page. Perform a recursive search, ultimately returning the rightmost leaf page which is the last leaf page in the leaf sibling chain. (This method might better be called getLastLeafPage()).
| |
| shrinkFor | back to summary |
|---|---|
| protected boolean shrinkFor(OpenBTree btree, DataValueDescriptor[] key) throws StandardException Implements abstract org. Perform a recursive shrink operation for the key. If this method returns true, the caller should remove the corresponding entry for the page. This routine is not guaranteed to successfully shrink anything. The page lead to by the key might turn out not to be empty by the time shrink gets there, and shrinks will give up if there is a deadlock. The receiver page must be latched on entry and is returned unlatched.
| |
| splitFor | back to summary |
|---|---|
| protected long splitFor(OpenBTree open_btree, DataValueDescriptor[] template, BranchControlRow parent_page, DataValueDescriptor[] splitrow, int flag) throws StandardException Implements abstract org. Perform a top down split pass making room for the the key in "row". Perform a split such that a subsequent call to insert given the argument index row will likely find room for it. Since latches are released the client must code for the case where another user has grabbed the space made available by the split pass and be ready to do another split. On entry, the parent is either null or latched, and the current page is latched. On exit, all pages will have been unlatched. If the parent is null, then this page is a root leaf page.
| |