Struct BPlusTreeInternalPage 

pub struct BPlusTreeInternalPage {
    pub schema: SchemaRef,
    pub header: BPlusTreeInternalPageHeader,
    pub array: Vec<InternalKV>,
    pub high_key: Option<Tuple>,
}

Internal page format (keys are stored in increasing order):

| HEADER | KEY(1)+PAGE_ID(1) | KEY(2)+PAGE_ID(2) | … | KEY(n)+PAGE_ID(n) |

Header format (size in byte, 12 bytes in total):

| PageType (4) | CurrentSize (4) | MaxSize (4) |

Fields

schema: SchemaRef

header: BPlusTreeInternalPageHeader

array: Vec<InternalKV>

high_key: Option<Tuple>

Implementations

impl BPlusTreeInternalPage

pub fn new(schema: SchemaRef, max_size: u32) -> Self

pub fn min_size(&self) -> u32

pub fn key_at(&self, index: usize) -> &Tuple

pub fn value_at(&self, index: usize) -> PageId

pub fn values(&self) -> Vec<PageId>

pub fn sibling_page_ids( &self, page_id: PageId, ) -> (Option<PageId>, Option<PageId>)

pub fn insert(&mut self, key: Tuple, page_id: PageId)

Insert a key-value pair into the internal page using binary search Works whether the page has a leading NULL sentinel or not.

pub fn batch_insert(&mut self, kvs: Vec<InternalKV>)

pub fn insert_after( &mut self, old_page_id: PageId, key: Tuple, new_page_id: PageId, )

Insert (key,new_page_id) right after the entry whose value equals old_page_id. This mirrors BusTub’s InsertNodeAfter semantics and preserves relative child order.

pub fn remove(&mut self, page_id: PageId) -> Option<(Tuple, PageId)>

pub fn delete(&mut self, key: &Tuple)

pub fn delete_page_id(&mut self, page_id: PageId)

pub fn is_full(&self) -> bool

pub fn split_off(&mut self, at: usize) -> Vec<InternalKV>

pub fn reverse_split_off(&mut self, at: usize) -> Vec<InternalKV>

pub fn replace_key(&mut self, old_key: &Tuple, new_key: Tuple)

pub fn key_index(&self, key: &Tuple) -> Option<usize>

pub fn value_index(&self, page_id: PageId) -> Option<usize>

pub fn look_up(&self, key: &Tuple) -> PageId

pub fn look_up_mut(&mut self, key: &Tuple) -> Option<&mut PageId>

pub fn remove_first_kv(&mut self) -> (Tuple, PageId)

Removes the first key-value pair (not the sentinel) and returns it. Also returns the key that will be promoted up to the parent.

pub fn remove_last_kv(&mut self) -> (Tuple, PageId)

pub fn merge(&mut self, middle_key: Tuple, other: &mut BPlusTreeInternalPage)

Trait Implementations

impl Clone for BPlusTreeInternalPage

fn clone(&self) -> BPlusTreeInternalPage

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for BPlusTreeInternalPage

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

Formats the value using the given formatter.

impl PartialEq for BPlusTreeInternalPage

fn eq(&self, other: &BPlusTreeInternalPage) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for BPlusTreeInternalPage

impl StructuralPartialEq for BPlusTreeInternalPage