Struct StorageStat

pub struct StorageStat<'a> { /* private fields */ }

A helper to track the size of the unique data in multiple cell trees.

NOTE: It uses hashes for deduplication, so you can only use it for fully computed and valid trees.

Implementations

impl<'a> StorageStat<'a>

pub fn compute_for_slice<'b: 'a>( slice: &'a CellSlice<'b>, limit: usize, ) -> Option<CellTreeStats>

Recursively computes the count of distinct cells returning the total storage used by this dag taking into account the identification of equal cells.

Root slice does not count as cell. A slice subrange of cells is used during computation.

pub fn compute_for_cell( cell: &'a DynCell, limit: usize, ) -> Option<CellTreeStats>

Recursively computes the count of distinct cells returning the total storage used by this dag taking into account the identification of equal cells.

pub fn with_limit(limit: usize) -> Self

Creates a new storage stat state with an explicit limit.

pub fn unlimited() -> Self

Creates a new storage stat state without a limit.

pub fn stats(&self) -> CellTreeStats

Returns the current tree stats.

pub fn add_cell(&mut self, cell: &'a DynCell) -> bool

Merges current stats with the stats from the provided cell tree.

Returns false if the limit was reached.

pub fn add_slice(&mut self, slice: &CellSlice<'a>) -> bool

Merges current stats with the stats from the provided slice.

Returns false if the limit was reached.