Struct sc_client_api::in_mem::Backend
source · pub struct Backend<Block: BlockT> { /* private fields */ }
Expand description
In-memory backend. Keeps all states and blocks in memory.
Warning: Doesn’t support all the features necessary for a proper database. Only use this struct for testing purposes. Do NOT use in production.
Implementations§
Trait Implementations§
source§impl<Block: BlockT> AuxStore for Backend<Block>
impl<Block: BlockT> AuxStore for Backend<Block>
source§fn insert_aux<'a, 'b: 'a, 'c: 'a, I: IntoIterator<Item = &'a (&'c [u8], &'c [u8])>, D: IntoIterator<Item = &'a &'b [u8]>>(
&self,
insert: I,
delete: D,
) -> Result<()>
fn insert_aux<'a, 'b: 'a, 'c: 'a, I: IntoIterator<Item = &'a (&'c [u8], &'c [u8])>, D: IntoIterator<Item = &'a &'b [u8]>>( &self, insert: I, delete: D, ) -> Result<()>
Insert auxiliary data into key-value store. Read more
source§impl<Block: BlockT> Backend<Block> for Backend<Block>
impl<Block: BlockT> Backend<Block> for Backend<Block>
§type BlockImportOperation = BlockImportOperation<Block>
type BlockImportOperation = BlockImportOperation<Block>
Associated block insertion operation type.
§type Blockchain = Blockchain<Block>
type Blockchain = Blockchain<Block>
Associated blockchain backend type.
§type State = TrieBackend<MemoryDB<<<Block as Block>::Header as Header>::Hashing, PrefixedKey<<<Block as Block>::Header as Header>::Hashing>, Vec<u8>>, <<Block as Block>::Header as Header>::Hashing>
type State = TrieBackend<MemoryDB<<<Block as Block>::Header as Header>::Hashing, PrefixedKey<<<Block as Block>::Header as Header>::Hashing>, Vec<u8>>, <<Block as Block>::Header as Header>::Hashing>
Associated state backend type.
§type OffchainStorage = InMemOffchainStorage
type OffchainStorage = InMemOffchainStorage
Offchain workers local storage.
source§fn begin_operation(&self) -> Result<Self::BlockImportOperation>
fn begin_operation(&self) -> Result<Self::BlockImportOperation>
Begin a new block insertion transaction with given parent block id. Read more
source§fn begin_state_operation(
&self,
operation: &mut Self::BlockImportOperation,
block: Block::Hash,
) -> Result<()>
fn begin_state_operation( &self, operation: &mut Self::BlockImportOperation, block: Block::Hash, ) -> Result<()>
Note an operation to contain state transition.
source§fn commit_operation(&self, operation: Self::BlockImportOperation) -> Result<()>
fn commit_operation(&self, operation: Self::BlockImportOperation) -> Result<()>
Commit block insertion.
source§fn finalize_block(
&self,
hash: Block::Hash,
justification: Option<Justification>,
) -> Result<()>
fn finalize_block( &self, hash: Block::Hash, justification: Option<Justification>, ) -> Result<()>
Finalize block with given
hash
. Read moresource§fn append_justification(
&self,
hash: Block::Hash,
justification: Justification,
) -> Result<()>
fn append_justification( &self, hash: Block::Hash, justification: Justification, ) -> Result<()>
Append justification to the block with the given
hash
. Read moresource§fn blockchain(&self) -> &Self::Blockchain
fn blockchain(&self) -> &Self::Blockchain
Returns reference to blockchain backend.
source§fn usage_info(&self) -> Option<UsageInfo>
fn usage_info(&self) -> Option<UsageInfo>
Returns current usage statistics.
source§fn offchain_storage(&self) -> Option<Self::OffchainStorage>
fn offchain_storage(&self) -> Option<Self::OffchainStorage>
Returns a handle to offchain storage.
source§fn state_at(&self, hash: Block::Hash) -> Result<Self::State>
fn state_at(&self, hash: Block::Hash) -> Result<Self::State>
Returns state backend with post-state of given block.
source§fn revert(
&self,
_n: NumberFor<Block>,
_revert_finalized: bool,
) -> Result<(NumberFor<Block>, HashSet<Block::Hash>)>
fn revert( &self, _n: NumberFor<Block>, _revert_finalized: bool, ) -> Result<(NumberFor<Block>, HashSet<Block::Hash>)>
Attempts to revert the chain by
n
blocks. If revert_finalized
is set it will attempt to
revert past any finalized block, this is unsafe and can potentially leave the node in an
inconsistent state. All blocks higher than the best block are also reverted and not counting
towards n
. Read moresource§fn remove_leaf_block(&self, _hash: Block::Hash) -> Result<()>
fn remove_leaf_block(&self, _hash: Block::Hash) -> Result<()>
Discard non-best, unfinalized leaf block.
source§fn get_import_lock(&self) -> &RwLock<()>
fn get_import_lock(&self) -> &RwLock<()>
Gain access to the import lock around this backend. Read more
source§fn requires_full_sync(&self) -> bool
fn requires_full_sync(&self) -> bool
Tells whether the backend requires full-sync mode.
source§fn pin_block(&self, hash: <Block as BlockT>::Hash) -> Result<()>
fn pin_block(&self, hash: <Block as BlockT>::Hash) -> Result<()>
Pin the block to keep body, justification and state available after pruning.
Number of pins are reference counted. Users need to make sure to perform
one call to
Self::unpin_block
per call to Self::pin_block
.source§fn unpin_block(&self, hash: <Block as BlockT>::Hash)
fn unpin_block(&self, hash: <Block as BlockT>::Hash)
Unpin the block to allow pruning.
source§fn have_state_at(&self, hash: Block::Hash, _number: NumberFor<Block>) -> bool
fn have_state_at(&self, hash: Block::Hash, _number: NumberFor<Block>) -> bool
Returns true if state for given block is available.
source§fn insert_aux<'a, 'b: 'a, 'c: 'a, I: IntoIterator<Item = &'a (&'c [u8], &'c [u8])>, D: IntoIterator<Item = &'a &'b [u8]>>(
&self,
insert: I,
delete: D,
) -> Result<()>
fn insert_aux<'a, 'b: 'a, 'c: 'a, I: IntoIterator<Item = &'a (&'c [u8], &'c [u8])>, D: IntoIterator<Item = &'a &'b [u8]>>( &self, insert: I, delete: D, ) -> Result<()>
Insert auxiliary data into key-value store.
impl<Block: BlockT> LocalBackend<Block> for Backend<Block>
Auto Trait Implementations§
impl<Block> !Freeze for Backend<Block>
impl<Block> !RefUnwindSafe for Backend<Block>
impl<Block> Send for Backend<Block>
impl<Block> Sync for Backend<Block>
impl<Block> Unpin for Backend<Block>
impl<Block> !UnwindSafe for Backend<Block>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
source§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
Consume self to return an equivalent value of
T
. Read moresource§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.source§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T
.