Struct oasis_core_runtime::storage::mkvs::Tree

pub struct Tree { /* private fields */ }

A patricia tree-based MKVS implementation.

Implementations

impl Tree

pub fn commit(&mut self, namespace: Namespace, version: u64) -> Result<Hash>

Commit tree updates to the underlying database and return the write log and new merkle root.

impl Tree

pub fn insert(&mut self, key: &[u8], value: &[u8]) -> Result<Option<Vec<u8>>>

Insert a key/value pair into the tree.

impl Tree

pub fn iter(&self) -> TreeIterator<'_>

Return an iterator over the tree.

impl Tree

pub fn get(&self, key: &[u8]) -> Result<Option<Vec<u8>>>

Get an existing key.

pub fn get_proof(&self, key: &[u8]) -> Result<Option<Proof>>

pub fn cache_contains_key(&self, key: &[u8]) -> bool

Check if the key exists in the local cache.

impl Tree

pub fn prefetch_prefixes(&self, prefixes: &[Prefix], limit: u16) -> Result<()>

Populate the in-memory tree with nodes for keys starting with given prefixes.

impl Tree

pub fn remove(&mut self, key: &[u8]) -> Result<Option<Vec<u8>>>

Remove entry with given key, returning the value at the key if the key was previously in the database.

impl Tree

pub fn new(read_syncer: Box<dyn ReadSync>, opts: &Options) -> Tree

Construct a new tree instance using the given read syncer and options struct.

pub fn builder() -> Builder

Return an builder struct to chain configuration calls on.

Trait Implementations

impl Debug for Tree

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

Formats the value using the given formatter.

impl FallibleMKVS for Tree

fn get(&self, key: &[u8]) -> Result<Option<Vec<u8>>>

Fetch entry with given key.

fn get_proof(&self, key: &[u8]) -> Result<Option<Proof>>

Fetch proof for entry with given key.

fn cache_contains_key(&self, key: &[u8]) -> bool

Check if the local MKVS cache contains the given key.

fn insert(&mut self, key: &[u8], value: &[u8]) -> Result<Option<Vec<u8>>>

Update entry with given key.

fn remove(&mut self, key: &[u8]) -> Result<Option<Vec<u8>>>

Remove entry with given key, returning the value at the key if the key was previously in the database.

fn prefetch_prefixes(&self, prefixes: &[Prefix], limit: u16) -> Result<()>

Populate the in-memory tree with nodes for keys starting with given prefixes.

fn iter(&self) -> Box<dyn Iterator + '_>

Returns an iterator over the tree.

fn commit(&mut self, namespace: Namespace, version: u64) -> Result<Hash>

Commit all database changes to the underlying store.

impl Send for Tree