Trait everscale_types::cell::Cell

pub trait Cell<C: CellFamily> {
    fn descriptor(&self) -> CellDescriptor;
    fn data(&self) -> &[u8] ;
    fn bit_len(&self) -> u16;
    fn reference(&self, index: u8) -> Option<&dyn Cell<C>>;
    fn reference_cloned(&self, index: u8) -> Option<CellContainer<C>>;
    fn virtualize(&self) -> &dyn Cell<C>;
    fn hash(&self, level: u8) -> &CellHash;
    fn depth(&self, level: u8) -> u16;
    fn stats(&self) -> CellTreeStats;
}

Represents the interface of a well-formed cell.

Since all basic operations are implements via dynamic dispatch, all high-level helper methods are implemented for dyn Cell.

Required Methods

fn descriptor(&self) -> CellDescriptor

Returns cell descriptor.

See also

Cell descriptor contains some tightly packed info about the cell. If you want convinient methods to access it use: cell_type, level_mask, reference_count, is_exotic

fn data(&self) -> &[u8]

Returns the raw data of this cell.

fn bit_len(&self) -> u16

Returns the data size of this cell in bits.

fn reference(&self, index: u8) -> Option<&dyn Cell<C>>

Returns a reference to the Nth child cell.

fn reference_cloned(&self, index: u8) -> Option<CellContainer<C>>

Returns the Nth child cell.

fn virtualize(&self) -> &dyn Cell<C>

Returns this cell as a virtualized cell, so that all hashes and depths will have an offset.

fn hash(&self, level: u8) -> &CellHash

Returns cell hash for the specified level.

Cell representation hash is the hash at the maximum level (LevelMask::MAX_LEVEL). Use repr_hash as a simple alias for this.

fn depth(&self, level: u8) -> u16

Returns cell depth for the specified level.

fn stats(&self) -> CellTreeStats

Returns the sum of all bits and cells of all elements in the cell tree (including this cell).

Implementations

impl<C: CellFamily> dyn Cell<C> + '_

pub fn cell_type(&self) -> CellType

Computes cell type from descriptor bytes.

pub fn level(&self) -> u8

Computes the cell level from the level mask.

pub fn level_mask(&self) -> LevelMask

Computes the level mask from the descriptor bytes.

pub fn reference_count(&self) -> u8

Computes the number of child cells from descriptor bytes.

pub fn is_exotic(&self) -> bool

Returns whether the cell is not Ordinary.

pub fn repr_hash(&self) -> &CellHash

Returns a representation hash of the cell.

pub fn repr_depth(&self) -> u16

Returns a representation depth of the cell.

pub fn is_empty(&self) -> bool

Returns true if the cell is empty (no bits, no refs).

pub fn references(&self) -> RefsIter<'_, C>

Creates an iterator through child nodes.

pub fn as_slice(&self) -> CellSlice<'_, C>

Returns this cell as a cell slice.

pub fn debug_root(&self) -> DebugCell<'_, C>

Returns an object that implements Debug for printing only the root cell of the cell tree.

pub fn display_root(&self) -> DisplayCellRoot<'_, C>

Returns an object that implements Display for printing only the root cell of the cell tree.

pub fn display_tree(&self) -> DisplayCellTree<'_, C>

Returns an object that implements Display for printing all cells in the cell tree.

Trait Implementations

impl<C: CellFamily> Debug for dyn Cell<C> + '_

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a, C: CellFamily> Load<'a, C> for &'a dyn Cell<C>

fn load_from(slice: &mut CellSlice<'a, C>) -> Option<Self>

impl<C1: CellFamily, C2: CellFamily> PartialEq<dyn Cell<C2>> for dyn Cell<C1> + '_

fn eq(&self, other: &dyn Cell<C2>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<C: CellFamily> Eq for dyn Cell<C> + '_

Implementors

impl<C: CellFamily> Cell<C> for StaticCell