bpTree_Leaf Struct Reference

The storage detail of a leaf node of b-plus tree. More...

#include <bpTree_block.h>

Inheritance diagram for bpTree_Leaf:

Collaboration diagram for bpTree_Leaf:

Public Member Functions
void	init (blockId_t myBId, blockId_t parentId, blockId_t next_block_id)
db_size_t	leaf_biSearch (const key_t key)
Public Member Functions inherited from bpTree_Block
void	init (blockId_t myBId, blockId_t parentId)
bool	isLeaf () const

Public Attributes
MAPPING_T	_k_rowid_pair [MAX_LEAF_SIZE+1]
	One extra space for spanning.
Public Attributes inherited from bpTree_Block
blockType_t	_blockType
blockId_t	_parent_block_id
blockId_t	_block_id
db_size_t	_size
db_size_t	_max_size
blockId_t	_next_block_id

Detailed Description

The storage detail of a leaf node of b-plus tree.

Definition at line 70 of file bpTree_block.h.

Member Function Documentation

init()

void bpTree_Leaf::init ( blockId_t  myBId, blockId_t  parentId, blockId_t  next_block_id  )

inline

Init a leaf node.

Parameters

myBId	block id for this node
parentId	block id for its parent
next_block_id	(right) sibling block id

Definition at line 77 of file bpTree_block.h.

Here is the call graph for this function:

leaf_biSearch()

db_size_t bpTree_Leaf::leaf_biSearch ( const key_t  key )

inline

The smallest key that is greater or equal to the given key. If the given key is greater than all the key, return the position after the last element.

Parameters

key	The given key

Returns

Definition at line 92 of file bpTree_block.h.

---

The documentation for this struct was generated from the following file:

• src/include/index/bpTree_block.h