Struct bm::ProvingBackend

pub struct ProvingBackend<'a, DB: Backend> where
    IntermediateOf<DB>: Eq + Hash,  { /* fields omitted */ }

Proving merkle database.

Methods

impl<'a, DB: Backend> ProvingBackend<'a, DB> where
    IntermediateOf<DB>: Eq + Hash, 

pub fn new(db: &'a mut DB) -> Self

Create a new proving database.

pub fn reset(
    &mut self
) -> HashMap<IntermediateOf<Self>, (ValueOf<Self>, ValueOf<Self>)>

Reset the proving database and get all the proofs.

Trait Implementations

impl<'a, DB: Backend> Backend for ProvingBackend<'a, DB> where
    IntermediateOf<DB>: Eq + Hash, 

type Intermediate = DB::Intermediate

Intermediate value stored in this merkle database.

type End = DB::End

End value stored in this merkle database.

type Error = DB::Error

Error type for DB access.

fn intermediate_of(
    &self,
    left: &ValueOf<Self>,
    right: &ValueOf<Self>
) -> IntermediateOf<Self>

Get the intermediate value of given left and right child.

fn empty_at(
    &mut self,
    depth_to_bottom: usize
) -> Result<ValueOf<Self>, Self::Error>

Get or create the empty value at given depth-to-bottom.

fn get(
    &self,
    key: &IntermediateOf<Self>
) -> Result<(ValueOf<Self>, ValueOf<Self>), Self::Error>

Get an internal item by key.

fn rootify(&mut self, key: &IntermediateOf<Self>) -> Result<(), Self::Error>

Rootify a key.

fn unrootify(&mut self, key: &IntermediateOf<Self>) -> Result<(), Self::Error>

Unrootify a key.

fn insert(
    &mut self,
    key: IntermediateOf<Self>,
    value: (ValueOf<Self>, ValueOf<Self>)
) -> Result<(), Self::Error>

Insert a new internal item.