Struct cached_pos_ledger_db::SpeculationCache

pub struct SpeculationCache { /* private fields */ }

SpeculationCache implements the block tree structure. The tree is represented by a root block id, all the children of root and a global block map. Each block is an Arc<Mutex<SpeculationBlock>> with ref_count = 1. For the chidren of the root, the sole owner is heads. For the rest, the sole owner is their parent block. So when a block is dropped, all its descendants will be dropped recursively. In the meanwhile, wheir entries in the block map will be removed by each block’s drop().

Implementations

impl SpeculationCache

pub fn new() -> Self

pub fn new_with_startup_info(startup_info: StartupInfo) -> Self

pub fn new_for_db_bootstrapping( tree_state: TreeState, pos_state: PosState ) -> Self

pub fn committed_txns_and_events( &self ) -> (Vec<Transaction>, Vec<ContractEvent>)

pub fn committed_block_id(&self) -> HashValue

pub fn committed_trees(&self) -> &ExecutedTrees

pub fn synced_trees(&self) -> &ExecutedTrees

pub fn update_block_tree_root( &mut self, committed_trees: ExecutedTrees, committed_ledger_info: &LedgerInfo, committed_txns: Vec<Transaction>, reconfig_events: Vec<ContractEvent> )

pub fn update_synced_trees(&mut self, new_trees: ExecutedTrees)

pub fn reset(&mut self)

pub fn add_block( &mut self, parent_block_id: HashValue, block: (HashValue, Vec<Transaction>, ProcessedVMOutput) ) -> Result<(), Error>

pub fn prune( &mut self, committed_ledger_info: &LedgerInfo, committed_txns: Vec<Transaction>, reconfig_events: Vec<ContractEvent> ) -> Result<HashValue, Error>

Return the previous committed block id.

pub fn get_block( &self, block_id: &HashValue ) -> Result<Arc<Mutex<SpeculationBlock>>, Error>