pub struct ReplicatedState<Main> { /* private fields */ }

Implementations§

source§

impl<Main: StateTrait> ReplicatedState<Main>

source

pub fn new<Replicate: StateTrait + Send + 'static>( main_state: Main, replicated_state: Replicate, filter: Option<Box<dyn StateFilter>> ) -> ReplicatedState<Main>

Trait Implementations§

source§

impl<Main: StateTrait> StateTrait for ReplicatedState<Main>

source§

fn get(&self, access_key: StorageKeyWithSpace<'_>) -> Result<Option<Box<[u8]>>>

source§

fn set( &mut self, access_key: StorageKeyWithSpace<'_>, value: Box<[u8]> ) -> Result<()>

source§

fn delete(&mut self, access_key: StorageKeyWithSpace<'_>) -> Result<()>

source§

fn delete_test_only( &mut self, _access_key: StorageKeyWithSpace<'_> ) -> Result<Option<Box<[u8]>>>

source§

fn delete_all( &mut self, access_key_prefix: StorageKeyWithSpace<'_> ) -> Result<Option<Vec<MptKeyValue>>>

source§

fn read_all( &mut self, access_key_prefix: StorageKeyWithSpace<'_> ) -> Result<Option<Vec<MptKeyValue>>>

source§

fn compute_state_root(&mut self) -> Result<StateRootWithAuxInfo>

It’s costly to compute state root however it’s only necessary to compute state root once before committing.
source§

fn get_state_root(&self) -> Result<StateRootWithAuxInfo>

source§

fn commit(&mut self, epoch_id: EpochId) -> Result<StateRootWithAuxInfo>

source§

impl<Main: StorageStateTraitExt> StateTraitExt for ReplicatedState<Main>

source§

fn get_with_proof( &self, access_key: StorageKeyWithSpace<'_> ) -> Result<(Option<Box<[u8]>>, StateProof)>

source§

fn get_node_merkle_all_versions<WithProof: StaticBool>( &self, access_key: StorageKeyWithSpace<'_> ) -> Result<(NodeMerkleTriplet, NodeMerkleProof)>

Compute the merkle of the node under access_key in all tries. Node merkle is computed on the value and children hashes, ignoring the compressed path.

Auto Trait Implementations§

§

impl<Main> !RefUnwindSafe for ReplicatedState<Main>

§

impl<Main> Send for ReplicatedState<Main>
where Main: Send,

§

impl<Main> Sync for ReplicatedState<Main>
where Main: Sync,

§

impl<Main> Unpin for ReplicatedState<Main>
where Main: Unpin,

§

impl<Main> !UnwindSafe for ReplicatedState<Main>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> ElementSatisfy<ElementNoConstrain> for T

source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V