Struct agilulf::Database

pub struct Database { /* fields omitted */ }

A Database with LevelDB algorithm. (Though the compaction of sstable is not implemented yet)

Now it will freeze exceeded MemDatabase into frozen_databases list. Then a background thread will write the frozen database into disk and modify the MANIFEST.

Trait Implementations

impl AsyncDatabase for Database

fn get(
    &self,
    key: Slice
) -> Pin<Box<dyn Future<Output = DatabaseResult<Slice>> + Send>>

GET request for the database will firstly read from MemDatabase. And then read from frozen database . Then will find in SSTable. If they are all not found, error will be returned.

fn put(
    &self,
    key: Slice,
    value: Slice
) -> Pin<Box<dyn Future<Output = DatabaseResult<()>> + Send>>

PUT request to this database will simply run PUT command on MemDatabase and check whether MemDatabase is so big that needs to freeze.

fn scan(
    &self,
    start: Slice,
    end: Slice
) -> Pin<Box<dyn Future<Output = Vec<(Slice, Slice)>> + Send>>

SCAN operation will merge every iterator from MemDatabase and FrozenDatabase and SStable together and return.

fn delete(
    &self,
    key: Slice
) -> Pin<Box<dyn Future<Output = DatabaseResult<()>> + Send>>