[−][src]Trait sp_blockchain::Backend

pub trait Backend<Block: BlockT>: HeaderBackend<Block> + HeaderMetadata<Block, Error = Error> {
    pub fn body(
        &self, 
        id: BlockId<Block>
    ) -> Result<Option<Vec<<Block as BlockT>::Extrinsic>>>;

    pub fn justification(
        &self, 
        id: BlockId<Block>
    ) -> Result<Option<Justification>>;

    pub fn last_finalized(&self) -> Result<Block::Hash>;

    pub fn cache(&self) -> Option<Arc<dyn Cache<Block>>>;

    pub fn leaves(&self) -> Result<Vec<Block::Hash>>;

    pub fn children(&self, parent_hash: Block::Hash) -> Result<Vec<Block::Hash>>;

    pub fn best_containing(
        &self, 
        target_hash: Block::Hash, 
        maybe_max_number: Option<NumberFor<Block>>, 
        import_lock: &RwLock<()>
    ) -> Result<Option<Block::Hash>> { ... }
}

Blockchain database backend. Does not perform any validation.

Required methods

pub fn body(
    &self,
    id: BlockId<Block>
) -> Result<Option<Vec<<Block as BlockT>::Extrinsic>>>[src]

Get block body. Returns None if block is not found.

pub fn justification(&self, id: BlockId<Block>) -> Result<Option<Justification>>[src]

Get block justification. Returns None if justification does not exist.

pub fn last_finalized(&self) -> Result<Block::Hash>[src]

Get last finalized block hash.

pub fn cache(&self) -> Option<Arc<dyn Cache<Block>>>[src]

Returns data cache reference, if it is enabled on this backend.

pub fn leaves(&self) -> Result<Vec<Block::Hash>>[src]

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.

pub fn children(&self, parent_hash: Block::Hash) -> Result<Vec<Block::Hash>>[src]

Return hashes of all blocks that are children of the block with parent_hash.

Loading content...

Provided methods

pub fn best_containing(
    &self,
    target_hash: Block::Hash,
    maybe_max_number: Option<NumberFor<Block>>,
    import_lock: &RwLock<()>
) -> Result<Option<Block::Hash>>[src]

Get the most recent block hash of the best (longest) chains that contain block with the given target_hash.

The search space is always limited to blocks which are in the finalized chain or descendents of it.

If maybe_max_block_number is Some(max_block_number) the search is limited to block numbers <= max_block_number. in other words as if there were no blocks greater max_block_number. Returns Ok(None) if target_hash is not found in search space. TODO: document time complexity of this, see #1444

Loading content...

Implementors

Loading content...