Struct sc_client_api::in_mem::Blockchain
source · pub struct Blockchain<Block: BlockT> { /* private fields */ }
Expand description
In-memory blockchain. Supports concurrent reads.
Implementations§
source§impl<Block: BlockT> Blockchain<Block>
impl<Block: BlockT> Blockchain<Block>
sourcepub fn new() -> Blockchain<Block>
pub fn new() -> Blockchain<Block>
Create new in-memory blockchain storage.
sourcepub fn insert(
&self,
hash: Block::Hash,
header: <Block as BlockT>::Header,
justifications: Option<Justifications>,
body: Option<Vec<<Block as BlockT>::Extrinsic>>,
new_state: NewBlockState
) -> Result<()>
pub fn insert( &self, hash: Block::Hash, header: <Block as BlockT>::Header, justifications: Option<Justifications>, body: Option<Vec<<Block as BlockT>::Extrinsic>>, new_state: NewBlockState ) -> Result<()>
Insert a block header and associated data.
sourcepub fn blocks_count(&self) -> usize
pub fn blocks_count(&self) -> usize
Get total number of blocks.
sourcepub fn equals_to(&self, other: &Self) -> bool
pub fn equals_to(&self, other: &Self) -> bool
Compare this blockchain with another in-mem blockchain
sourcepub fn canon_equals_to(&self, other: &Self) -> bool
pub fn canon_equals_to(&self, other: &Self) -> bool
Compare canonical chain to other canonical chain.
sourcepub fn insert_cht_root(&self, block: NumberFor<Block>, cht_root: Block::Hash)
pub fn insert_cht_root(&self, block: NumberFor<Block>, cht_root: Block::Hash)
Insert header CHT root.
Trait Implementations§
source§impl<Block: BlockT> AuxStore for Blockchain<Block>
impl<Block: BlockT> AuxStore for Blockchain<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 Blockchain<Block>
impl<Block: BlockT> Backend<Block> for Blockchain<Block>
source§fn body(
&self,
hash: Block::Hash
) -> Result<Option<Vec<<Block as BlockT>::Extrinsic>>>
fn body( &self, hash: Block::Hash ) -> Result<Option<Vec<<Block as BlockT>::Extrinsic>>>
Get block body. Returns
None
if block is not found.source§fn justifications(&self, hash: Block::Hash) -> Result<Option<Justifications>>
fn justifications(&self, hash: Block::Hash) -> Result<Option<Justifications>>
Get block justifications. Returns
None
if no justification exists.source§fn last_finalized(&self) -> Result<Block::Hash>
fn last_finalized(&self) -> Result<Block::Hash>
Get last finalized block hash.
source§fn leaves(&self) -> Result<Vec<Block::Hash>>
fn leaves(&self) -> Result<Vec<Block::Hash>>
Returns hashes of all blocks that are leaves of the block tree.
in other words, that have no children, are chain heads.
Results must be ordered best (longest, highest) chain first.
source§fn children(&self, _parent_hash: Block::Hash) -> Result<Vec<Block::Hash>>
fn children(&self, _parent_hash: Block::Hash) -> Result<Vec<Block::Hash>>
Return hashes of all blocks that are children of the block with
parent_hash
.source§fn indexed_transaction(&self, _hash: Block::Hash) -> Result<Option<Vec<u8>>>
fn indexed_transaction(&self, _hash: Block::Hash) -> Result<Option<Vec<u8>>>
Get single indexed transaction by content hash. Note that this will only fetch transactions
that are indexed by the runtime with
storage_index_transaction
.fn block_indexed_body(&self, _hash: Block::Hash) -> Result<Option<Vec<Vec<u8>>>>
§fn longest_containing(
&self,
base_hash: <Block as Block>::Hash,
import_lock: &RwLock<RawRwLock, ()>
) -> Result<Option<<Block as Block>::Hash>, Error>
fn longest_containing( &self, base_hash: <Block as Block>::Hash, import_lock: &RwLock<RawRwLock, ()> ) -> Result<Option<<Block as Block>::Hash>, Error>
Get the most recent block hash of the longest chain that contains
a block with the given
base_hash
. Read more§fn has_indexed_transaction(
&self,
hash: <Block as Block>::Hash
) -> Result<bool, Error>
fn has_indexed_transaction( &self, hash: <Block as Block>::Hash ) -> Result<bool, Error>
Check if indexed transaction exists.
§fn displaced_leaves_after_finalizing(
&self,
finalized_block_hash: <Block as Block>::Hash,
finalized_block_number: <<Block as Block>::Header as Header>::Number
) -> Result<DisplacedLeavesAfterFinalization<Block>, Error>
fn displaced_leaves_after_finalizing( &self, finalized_block_hash: <Block as Block>::Hash, finalized_block_number: <<Block as Block>::Header as Header>::Number ) -> Result<DisplacedLeavesAfterFinalization<Block>, Error>
Returns all leaves that will be displaced after the block finalization.
source§impl<Block: Clone + BlockT> Clone for Blockchain<Block>
impl<Block: Clone + BlockT> Clone for Blockchain<Block>
source§fn clone(&self) -> Blockchain<Block>
fn clone(&self) -> Blockchain<Block>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<Block: BlockT> Default for Blockchain<Block>
impl<Block: BlockT> Default for Blockchain<Block>
source§impl<Block: BlockT> HeaderBackend<Block> for Blockchain<Block>
impl<Block: BlockT> HeaderBackend<Block> for Blockchain<Block>
source§fn header(&self, hash: Block::Hash) -> Result<Option<<Block as BlockT>::Header>>
fn header(&self, hash: Block::Hash) -> Result<Option<<Block as BlockT>::Header>>
Get block header. Returns
None
if block is not found.source§fn number(&self, hash: Block::Hash) -> Result<Option<NumberFor<Block>>>
fn number(&self, hash: Block::Hash) -> Result<Option<NumberFor<Block>>>
Get block number by hash. Returns
None
if the header is not in the chain.source§fn hash(
&self,
number: <<Block as BlockT>::Header as HeaderT>::Number
) -> Result<Option<Block::Hash>>
fn hash( &self, number: <<Block as BlockT>::Header as HeaderT>::Number ) -> Result<Option<Block::Hash>>
Get block hash by number. Returns
None
if the header is not in the chain.§fn block_hash_from_id(
&self,
id: &BlockId<Block>
) -> Result<Option<<Block as Block>::Hash>, Error>
fn block_hash_from_id( &self, id: &BlockId<Block> ) -> Result<Option<<Block as Block>::Hash>, Error>
Convert an arbitrary block ID into a block hash.
§fn block_number_from_id(
&self,
id: &BlockId<Block>
) -> Result<Option<<<Block as Block>::Header as Header>::Number>, Error>
fn block_number_from_id( &self, id: &BlockId<Block> ) -> Result<Option<<<Block as Block>::Header as Header>::Number>, Error>
Convert an arbitrary block ID into a block hash.
§fn expect_header(
&self,
hash: <Block as Block>::Hash
) -> Result<<Block as Block>::Header, Error>
fn expect_header( &self, hash: <Block as Block>::Hash ) -> Result<<Block as Block>::Header, Error>
Get block header. Returns
UnknownBlock
error if block is not found.§fn expect_block_number_from_id(
&self,
id: &BlockId<Block>
) -> Result<<<Block as Block>::Header as Header>::Number, Error>
fn expect_block_number_from_id( &self, id: &BlockId<Block> ) -> Result<<<Block as Block>::Header as Header>::Number, Error>
Convert an arbitrary block ID into a block number. Returns
UnknownBlock
error if block is
not found.§fn expect_block_hash_from_id(
&self,
id: &BlockId<Block>
) -> Result<<Block as Block>::Hash, Error>
fn expect_block_hash_from_id( &self, id: &BlockId<Block> ) -> Result<<Block as Block>::Hash, Error>
Convert an arbitrary block ID into a block hash. Returns
UnknownBlock
error if block is
not found.source§impl<Block: BlockT> HeaderMetadata<Block> for Blockchain<Block>
impl<Block: BlockT> HeaderMetadata<Block> for Blockchain<Block>
fn header_metadata( &self, hash: Block::Hash ) -> Result<CachedHeaderMetadata<Block>, Self::Error>
fn insert_header_metadata( &self, _hash: Block::Hash, _metadata: CachedHeaderMetadata<Block> )
fn remove_header_metadata(&self, _hash: Block::Hash)
Auto Trait Implementations§
impl<Block> !RefUnwindSafe for Blockchain<Block>
impl<Block> Send for Blockchain<Block>
impl<Block> Sync for Blockchain<Block>
impl<Block> Unpin for Blockchain<Block>
impl<Block> !UnwindSafe for Blockchain<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
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
Causes
self
to use its Binary
implementation when Debug
-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
Causes
self
to use its Display
implementation when
Debug
-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
Causes
self
to use its LowerExp
implementation when
Debug
-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
Causes
self
to use its LowerHex
implementation when
Debug
-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
Causes
self
to use its Octal
implementation when Debug
-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
Causes
self
to use its Pointer
implementation when
Debug
-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
Causes
self
to use its UpperExp
implementation when
Debug
-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
Causes
self
to use its UpperHex
implementation when
Debug
-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
Formats each item in a sequence. Read more
§impl<Block, T> ForkBackend<Block> for T
impl<Block, T> ForkBackend<Block> for T
§fn expand_forks(
&self,
fork_heads: &[<Block as Block>::Hash]
) -> Result<BTreeSet<<Block as Block>::Hash>, Error>
fn expand_forks( &self, fork_heads: &[<Block as Block>::Hash] ) -> Result<BTreeSet<<Block as Block>::Hash>, Error>
Returns block hashes for provided fork heads. It skips the fork if when blocks are missing
(e.g. warp-sync) and internal
tree_route
function fails. Read more§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Pipes by value. This is generally the method you want to use. Read more
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
Borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
Mutably borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
self
, then passes self.as_ref()
into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self
, then passes self.deref()
into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
§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 more§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
Deref::Target
of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
Calls
.tap()
only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.§impl<T> TryConv for T
impl<T> TryConv for T
§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T
.