Struct simple_db_rust::BTreeTable

pub struct BTreeTable {
    pub key_field: usize,
    pub tuple_scheme: TupleScheme,
    // some fields omitted
}

Fields

key_field: usize

tuple_scheme: TupleScheme

Implementations

impl BTreeTable

pub fn new(file_path: &str, key_field: usize, row_scheme: TupleScheme) -> Self

pub fn get_id(&self) -> i32

pub fn insert_tuple(&self, tuple: Tuple)

Insert a tuple into this BTreeFile, keeping the tuples in sorted order. May cause pages to split if the page where tuple belongs is full.

pub fn split_leaf_page(
    &self,
    page: RefMut<'_, BTreeLeafPage>,
    key_field: usize
) -> Rc<RefCell<BTreeLeafPage>>

Split a leaf page to make room for new tuples and recursively split the parent node as needed to accommodate a new entry. The new entry should have a key matching the key field of the first tuple in the right-hand page (the key is “copied up”), and child pointers pointing to the two leaf pages resulting from the split. Update sibling pointers and parent pointers as needed.

Return the leaf page into which a new tuple with key field “field” should be inserted.

pub fn iterator(&self) -> BTreeTableIterator<'_>

pub fn find_leaf_page(
    &self,
    page_id: BTreePageID,
    field: i32
) -> Rc<RefCell<BTreeLeafPage>>

Recursive function which finds and locks the leaf page in the B+ tree corresponding to the left-most page possibly containing the key field f. It locks all internal nodes along the path to the leaf node with READ_ONLY permission, and locks the leaf node with permission perm.

If f is null, it finds the left-most leaf page – used for the iterator

pub fn get_file(&self) -> RefMut<'_, File>

pub fn get_root_pid(&self) -> BTreePageID

Get the root page pid.

pub fn pages_count(&self) -> usize

The count of pages in this BTreeFile

(BTreeRootPointerPage is not included)

Trait Implementations

impl Display for BTreeTable

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.