Struct BPlusTreeIndex 

pub struct BPlusTreeIndex {
    pub key_schema: SchemaRef,
    pub buffer_pool: Arc<BufferManager>,
    pub internal_max_size: u32,
    pub leaf_max_size: u32,
    pub header_page_id: PageId,
    pub header_page_lock: Arc<RwLock<()>>,
    pub config: BTreeConfig,
    pub pending_garbage: AtomicUsize,
}

Fields

key_schema: SchemaRef

buffer_pool: Arc<BufferManager>

internal_max_size: u32

leaf_max_size: u32

header_page_id: PageId

header_page_lock: Arc<RwLock<()>>

config: BTreeConfig

pending_garbage: AtomicUsize

Best-effort counter of potentially dead index entries observed by readers.

Implementations

impl BPlusTreeIndex

pub fn new( key_schema: SchemaRef, buffer_pool: Arc<BufferManager>, internal_max_size: u32, leaf_max_size: u32, ) -> Self

pub fn new_with_config( key_schema: SchemaRef, buffer_pool: Arc<BufferManager>, internal_max_size: u32, leaf_max_size: u32, config: BTreeConfig, ) -> Self

pub fn open( key_schema: SchemaRef, buffer_pool: Arc<BufferManager>, internal_max_size: u32, leaf_max_size: u32, header_page_id: PageId, ) -> Self

pub fn open_with_config( key_schema: SchemaRef, buffer_pool: Arc<BufferManager>, internal_max_size: u32, leaf_max_size: u32, header_page_id: PageId, config: BTreeConfig, ) -> Self

pub fn get_root_page_id(&self) -> QuillSQLResult<PageId>

pub fn is_empty(&self) -> QuillSQLResult<bool>

pub fn get(&self, key: &Tuple) -> QuillSQLResult<Option<RecordId>>

pub fn insert(&self, key: &Tuple, rid: RecordId) -> QuillSQLResult<()>

公共 API: 插入一个键值对，使用闩锁耦合实现高并发。

pub fn delete(&self, key: &Tuple) -> QuillSQLResult<()>

Public API: delete a key with latch coupling to ensure concurrency safety.

pub fn to_dot(&self) -> QuillSQLResult<String>

pub fn lazy_cleanup_with<F>( &self, is_globally_dead: F, limit: Option<usize>, ) -> QuillSQLResult<usize>

where F: FnMut(&RecordId) -> bool,

Best-effort lazy cleanup: iterate across leaves and delete keys whose RIDs satisfy the is_globally_dead predicate. This is REDO-safe and uses the existing delete() path to maintain separators and handle underflow properly. Notes:

• Callers should pass a predicate that only returns true for tuples that are globally invisible (e.g., deleted and the deleting txn committed).
• This method is conservative and may revisit pages as structure changes; it favors correctness over speed.

pub fn find_first_leaf_page(&self) -> QuillSQLResult<ReadPageGuard>

pub fn find_leaf_page_for_iterator( &self, key: &Tuple, start_page_id: PageId, ) -> QuillSQLResult<ReadPageGuard>

内部辅助函数：从根节点开始遍历，找到并返回包含目标 key 的 叶子节点的只读保护器 (ReadPageGuard)。

这个函数通过 ReadPageGuard 的 RAII 特性，在遍历时实现了闩锁耦合。

pub fn note_potential_garbage(&self, n: usize)

Hint that a reader observed a globally invisible RID through this index. This increments a best-effort counter to help background cleanup scheduling.

pub fn take_pending_garbage(&self) -> usize

Returns and resets the pending garbage counter.

Trait Implementations

impl Debug for BPlusTreeIndex

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

Formats the value using the given formatter.