Struct everscale_network::adnl::NodeIdShort

#[repr(transparent)]
pub struct NodeIdShort(_);

Short ADNL node id.

Implementations

impl NodeIdShort

pub const fn new(hash: [u8; 32]) -> Self

pub fn random() -> Self

pub const fn as_slice(&self) -> &[u8; 32]

pub fn is_zero(&self) -> bool

Trait Implementations

impl<'a> Borrow<[u8; 32]> for &'a NodeIdShort

fn borrow(&self) -> &[u8; 32]

Immutably borrows from an owned value.

impl Borrow<[u8; 32]> for NodeIdShort

fn borrow(&self) -> &[u8; 32]

Immutably borrows from an owned value.

impl Clone for NodeIdShort

fn clone(&self) -> NodeIdShort

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodeIdShort

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

Formats the value using the given formatter.

impl Default for NodeIdShort

fn default() -> NodeIdShort

Returns the “default value” for a type.

impl Display for NodeIdShort

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

Formats the value using the given formatter.

impl From<NodeIdShort> for [u8; 32]

fn from(id: NodeIdShort) -> Self

Converts to this type from the input type.

impl Hash for NodeIdShort

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,

Feeds a slice of this type into the given Hasher.

impl Ord for NodeIdShort

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

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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

Restrict a value to a certain interval.

impl PartialEq<[u8; 32]> for NodeIdShort

fn eq(&self, other: &[u8; 32]) -> 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 PartialEq<[u8]> for NodeIdShort

fn eq(&self, other: &[u8]) -> 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 PartialEq<NodeIdShort> for NodeIdShort

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

fn partial_cmp(&self, other: &NodeIdShort) -> 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 Copy for NodeIdShort

impl Eq for NodeIdShort

impl StructuralEq for NodeIdShort

impl StructuralPartialEq for NodeIdShort