Struct rustdb::sortedfile::SortedFile

pub struct SortedFile {
    pub pages: RefCell<HashMap<u64, PagePtr>>,
    pub dirty_pages: RefCell<Vec<PagePtr>>,
    pub rec_size: usize,
    pub key_size: usize,
    pub root_page: u64,
    /* private fields */
}

Sorted Record storage.

SortedFile is a tree of pages.

Each page is either a parent page with links to child pages, or a leaf page.

Fields

pages: RefCell<HashMap<u64, PagePtr>>

Cached pages.

dirty_pages: RefCell<Vec<PagePtr>>

List of pages that have changed.

rec_size: usize

Size of a record.

key_size: usize

Size of a key.

root_page: u64

The root page.

Implementations

impl SortedFile

pub fn new(rec_size: usize, key_size: usize, root_page: u64) -> Self

Create File with specified record size, key size, root page.

pub fn save(&self, db: &DB, op: SaveOp)

Save changes to underlying storage.

pub fn rollback(&self)

Clear the cache, changes are discarded instead of being saved.

pub fn free_pages(&self, db: &DB, r: &dyn Record)

Free the underlying storage. File is not useable after this.

pub fn insert(&self, db: &DB, r: &dyn Record)

Insert a Record. If the key is a duplicate, the record is not saved.

pub fn remove(&self, db: &DB, r: &dyn Record)

Remove a Record.

pub fn get(&self, db: &DB, r: &dyn Record) -> Option<(PagePtr, usize)>

Locate a record with matching key. Result is PagePtr and offset of data.

pub fn asc(self: &Rc<Self>, db: &DB, start: Box<dyn Record>) -> Asc

For iteration in ascending order from start.

pub fn dsc(self: &Rc<Self>, db: &DB, start: Box<dyn Record>) -> Dsc

For iteration in descending order from start.

pub fn set_dirty(&self, p: &mut Page, pp: &PagePtr)

Mark a page as changed.

pub fn repack(&self, db: &DB, r: &dyn Record) -> i64

Attempt to free up logical pages by re-packing child pages.

pub fn get_used(&self, db: &DB, to: &mut HashSet<u64>)

Get the set of used logical pages.