The B-plus-tree storage details on the disk. More...
#include <bpTree_disk.h>
Public Member Functions | |
| Bp_tree (BufferManager *buf_manager) | |
| void | InitRoot (std::string indexFileName) |
| const std::string & | getName () const |
| bool | Insert (const key_t &key, const value_t &val) |
| Basic insertion to the tree. More... | |
| bool | Delete (const key_t &key) |
| Basic deletion from the tree. More... | |
| bool | Delete (const key_t &key, value_t &deleted) |
| bool | FindValue (const key_t &key, value_t &result) const |
| Find the values by key (normally, we may say "pointers" for "values") More... | |
| bool | FindRange (const key_t &lower_key, const key_t &upper_key, std::vector< value_t > &result) const |
| Find the value(pointer) based on the given lower and upper key. More... | |
| bool | UpdateKey (const key_t &former_key, const key_t &new_key) |
| Update a certain key. More... | |
| bool | UpdateValue (const key_t &key, const value_t &new_val) |
| Update a certain value. More... | |
Detailed Description
The B-plus-tree storage details on the disk.
Definition at line 26 of file bpTree_disk.h.
Member Function Documentation
◆ Delete() [1/2]
| bool Bp_tree::Delete | ( | const key_t & | key | ) |
Basic deletion from the tree.
Users should call more general functions, like update val, etc.
- Parameters
-
key The key for a certain record.
- Returns
- true Deletion success.
- false Insertion success.
Here is the caller graph for this function:
◆ Delete() [2/2]
| bool Bp_tree::Delete | ( | const key_t & | key, |
| value_t & | deleted | ||
| ) |
- Parameters
-
key deleted [out] The deleted value.
- Returns
◆ FindRange()
| bool Bp_tree::FindRange | ( | const key_t & | lower_key, |
| const key_t & | upper_key, | ||
| std::vector< value_t > & | result | ||
| ) | const |
Find the value(pointer) based on the given lower and upper key.
- Parameters
-
lower_key [in] upper_key [in] result [out]
- Returns
- true Search success
- false Search failure
Here is the caller graph for this function:
◆ FindValue()
| bool Bp_tree::FindValue | ( | const key_t & | key, |
| value_t & | result | ||
| ) | const |
Find the values by key (normally, we may say "pointers" for "values")
- Parameters
-
key The search key. result [out] The search result. Push them back in the result.
- Returns
- true Search success
- false
Here is the caller graph for this function:
◆ InitRoot()
| void Bp_tree::InitRoot | ( | std::string | indexFileName | ) |
Init 1.indexName of the bpTree 2.root block id 3.total block count. Must be called before every use !
- Parameters
-
indexFileName
Here is the caller graph for this function:
◆ Insert()
| bool Bp_tree::Insert | ( | const key_t & | key, |
| const value_t & | val | ||
| ) |
Basic insertion to the tree.
- Parameters
-
key The key for the val. val The val (or normally so-called "pointer") to the record.
- Returns
- true Insertion success
- false Insertion fail
Here is the caller graph for this function:
◆ UpdateKey()
| bool Bp_tree::UpdateKey | ( | const key_t & | former_key, |
| const key_t & | new_key | ||
| ) |
Update a certain key.
- Parameters
-
former_key new_key
- Returns
◆ UpdateValue()
| bool Bp_tree::UpdateValue | ( | const key_t & | key, |
| const value_t & | new_val | ||
| ) |
Update a certain value.
- Parameters
-
key new_val
- Returns
Here is the caller graph for this function:
The documentation for this class was generated from the following file:
- src/include/index/bpTree_disk.h
