Struct everscale_types::cell::UsageTreeWithSubtrees

impl UsageTreeWithSubtrees

pub fn track(&self, cell: &Cell) -> Cell

Wraps the specified cell in a usage cell to keep track of the data or links being accessed.

pub fn contains_direct(&self, repr_hash: &CellHash) -> bool

Returns true if the cell with the specified representation hash is present in this usage tree.

pub fn contains_subtree(&self, repr_hash: &CellHash) -> bool

Returns true if the subtree root with the specified representation hash is present in this usage tree.

pub fn add_subtree(&mut self, root: &DynCell) -> bool

Adds a subtree to the usage tree. Returns whether the value was newly inserted.

Trait Implementations§

impl MerkleFilter for UsageTreeWithSubtrees

fn check(&self, cell: &CellHash) -> FilterAction

Returns how the cell should be included in the Merkle proof or update.

Auto Trait Implementations§

impl UnwindSafe for UsageTreeWithSubtrees

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

impl<T, U> Into for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T, U> TryFrom for Twhere U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

impl<T, U> TryInto for Twhere U: TryFrom<T>,