Struct SledEventTreeVec 

pub struct SledEventTreeVec<T> { /* private fields */ }

Imitates collection table per key

Implementations

impl<T> SledEventTreeVec<T>

pub fn new(tree: Tree) -> Self

table constructor

impl<T> SledEventTreeVec<T>

where T: Serialize + DeserializeOwned,

DB “Tables” functionality

pub fn get(&self, key: u64) -> Result<Option<Vec<T>>, Error>

Gets all elements for given key as Vec

pub fn put(&self, key: u64, value: Vec<T>) -> Result<(), Error>

Overwrites or adds new key<->value into the tree

pub fn push(&self, key: u64, value: T) -> Result<(), Error>

Pushes element to existing set of T or creates new one with single element

pub fn remove(&self, key: u64, value: T) -> Result<(), Error>

where T: PartialEq,

Removes value T if present

pub fn append(&self, key: u64, value: Vec<T>) -> Result<(), Error>

where T: ToOwned + Clone,

Appends one Vec<T> into DB present one or put()s it if not present as is.

pub fn contains_value(&self, value: &T) -> bool

where T: PartialEq,

check if T is present in Vec<T> in the DB

pub fn iter_values( &self, key: u64, ) -> Option<impl DoubleEndedIterator<Item = T>>

iterate inner collection under same key