Struct everscale_types::models::block::ShardIdent

pub struct ShardIdent { /* private fields */ }

Shard ident.

Implementations

impl ShardIdent

pub const PREFIX_FULL: u64 = 9_223_372_036_854_775_808u64

The prefix for the full shard.

pub const MAX_SPLIT_DEPTH: u8 = 60u8

Max possible shard split depth.

pub const BITS: u16 = 104u16

The number of data bits that this struct occupies.

pub const MASTERCHAIN: Self = _

Masterchain shard ident.

pub const BASECHAIN: Self = _

Base workchain shard ident.

pub const fn new(workchain: i32, prefix: u64) -> Option<Self>

Tries to create a new shard ident from parts.

pub const fn new_full(workchain: i32) -> Self

Creates a new full shard ident for the specified workchain.

pub const unsafe fn new_unchecked(workchain: i32, prefix: u64) -> Self

Creates a new shard ident from parts.

Safety

The following must be true:

• prefix must not be zero.
• low bits must not be used (see MAX_SPLIT_DEPTH).

pub const fn workchain(&self) -> i32

Returns the shard workchain.

pub const fn prefix(&self) -> u64

Returns the shard prefix.

pub const fn is_full(&self) -> bool

Returns true if this shard could not be merged further.

See PREFIX_FULL

pub const fn is_left_child(&self) -> bool

Returns true if this shard is the left child of the parent shard.

NOTE: Full shard is left.

pub const fn is_right_child(&self) -> bool

Returns true if this shard is the right child of the parent shard.

NOTE: Full shard is left.

pub const fn is_ancestor_of(&self, shard: &Self) -> bool

Returns true if the current shard is somewhere in the parents hierarchy of the specified shard.

pub const fn is_parent_of(&self, child: &Self) -> bool

Returns true if the current shard is the direct parent of the specified shard.

pub const fn is_child_of(&self, parent: &Self) -> bool

Returns true if the current shard is the direct child of the specified shard.

pub const fn intersects(&self, other: &Self) -> bool

Returns true if one shard fully includes another.

pub const fn merge(&self) -> Option<Self>

Returns the parent shard of the current shard.

Returns None for the full shard.

pub const fn split(&self) -> Option<(Self, Self)>

Splits the current shard into two children.

Returns None for the shard with depth > MAX_SPLIT_DEPTH.

pub const fn prefix_len(&self) -> u16

Returns shard prefix len in bits.

pub const fn contains_account(&self, account: &CellHash) -> bool

Returns true if the specified account could be stored in the current shard.

Trait Implementations

impl Clone for ShardIdent

fn clone(&self) -> ShardIdent

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ShardIdent

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

Formats the value using the given formatter.

impl Default for ShardIdent

fn default() -> Self

Returns the “default value” for a type.

impl Display for ShardIdent

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

Formats the value using the given formatter.

impl Hash for ShardIdent

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, C: CellFamily> Load<'a, C> for ShardIdent

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

Tries to load itself from a cell slice.

impl Ord for ShardIdent

fn cmp(&self, other: &ShardIdent) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<ShardIdent> for ShardIdent

fn eq(&self, other: &ShardIdent) -> 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 PartialOrd<ShardIdent> for ShardIdent

fn partial_cmp(&self, other: &ShardIdent) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<C: CellFamily> Store<C> for ShardIdent

fn store_into( &self, builder: &mut CellBuilder<C>, _: &mut dyn Finalizer<C> ) -> bool

Tries to store itself into the cell builder.

impl Copy for ShardIdent

impl Eq for ShardIdent

impl StructuralEq for ShardIdent

impl StructuralPartialEq for ShardIdent