Struct BlockStoreOverlay

pub struct BlockStoreOverlay(SledDbOverlayPtr);

Overlay structure over a BlockStore instance.

Tuple Fields

0: SledDbOverlayPtr

Implementations

impl BlockStoreOverlay

pub fn new(overlay: &SledDbOverlayPtr) -> Result<Self>

pub fn insert(&self, blocks: &[Block]) -> Result<Vec<HeaderHash>>

Insert a slice of Block into the overlay’s main tree. The block’s hash() function output is used as the key, while value is the serialized Block itself. On success, the function returns the block hashes in the same order.

pub fn insert_order(&self, heights: &[u32], hashes: &[HeaderHash]) -> Result<()>

Insert a slice of u32 and block hashes into overlay’s order tree. The block height is used as the key, and the blockhash is used as value.

pub fn insert_difficulty( &self, block_difficulties: &[BlockDifficulty], ) -> Result<()>

Insert a slice of BlockDifficulty into the overlay’s difficulty tree.

pub fn get( &self, block_hashes: &[HeaderHash], strict: bool, ) -> Result<Vec<Option<Block>>>

Fetch given block hashes from the overlay’s main tree. The resulting vector contains Option, which is Some if the block was found in the overlay, and otherwise it is None, if it has not. The second parameter is a boolean which tells the function to fail in case at least one block was not found.

pub fn get_order( &self, heights: &[u32], strict: bool, ) -> Result<Vec<Option<HeaderHash>>>

Fetch given heights from the overlay’s order tree. The resulting vector contains Option, which is Some if the height was found in the overlay, and otherwise it is None, if it has not. The second parameter is a boolean which tells the function to fail in case at least one height was not found.

pub fn get_last(&self) -> Result<(u32, HeaderHash)>

Fetch the last block hash in the overlay’s order tree, based on the Ord implementation for Vec<u8>.

pub fn is_empty(&self) -> Result<bool>

Check if overlay’s order tree contains any records.