Struct ShardStateStorage 

pub struct ShardStateStorage { /* private fields */ }

Implementations

impl ShardStateStorage

pub fn new( cells_db: CellsDb, block_handle_storage: Arc<BlockHandleStorage>, block_storage: Arc<BlockStorage>, temp_file_storage: TempFileStorage, cache_size_bytes: ByteSize, drop_interval: u32, ) -> Result<Arc<Self>>

pub fn metrics(&self) -> ShardStateStorageMetrics

pub fn min_ref_mc_state(&self) -> &MinRefMcStateTracker

pub fn cell_storage(&self) -> &Arc<CellStorage>

pub fn load_mc_block_id(&self, seqno: u32) -> Result<Option<BlockId>>

Find mc block id from db snapshot

pub async fn store_state( &self, handle: &BlockHandle, state: &ShardStateStuff, hint: StoreStateHint, ) -> Result<bool>

pub async fn store_state_root( &self, handle: &BlockHandle, root_cell: Cell, hint: StoreStateHint, ) -> Result<bool>

pub async fn store_state_file( &self, block_id: &BlockId, boc: File, ) -> Result<HashBytes>

pub async fn store_state_bytes( &self, block_id: &BlockId, boc: Bytes, ) -> Result<HashBytes>

pub async fn load_state( &self, ref_by_mc_seqno: u32, block_id: &BlockId, ) -> Result<ShardStateStuff>

pub fn load_state_root_hash(&self, block_id: &BlockId) -> Result<HashBytes>

pub async fn remove_outdated_states(&self, mc_seqno: u32) -> Result<()>

pub async fn compute_recent_blocks( &self, mc_seqno: u32, ) -> Result<Option<TopBlocks>>

Searches for an edge with the least referenced masterchain block

Returns None if all states are recent enough