Struct aleph_bft::NodeCount

pub struct NodeCount(pub usize);

Node count. Right now it doubles as node weight in many places in the code, in the future we might need a new type for that.

Tuple Fields

0: usize

Implementations

impl NodeCount

pub fn into_range(self) -> Range<NodeIndex>

pub fn into_iterator(self) -> impl Iterator<Item = NodeIndex>

pub fn consensus_threshold(&self) -> NodeCount

If this is the total node count, what number of nodes is required for secure consensus.

Trait Implementations

impl Add for NodeCount

type Output = NodeCount

The resulting type after applying the + operator.

fn add(self, rhs: NodeCount) -> NodeCount

Performs the + operation.

impl AddAssign for NodeCount

fn add_assign(&mut self, rhs: NodeCount)

Performs the += operation.

impl Clone for NodeCount

fn clone(&self) -> NodeCount

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodeCount

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

Formats the value using the given formatter.

impl Default for NodeCount

fn default() -> NodeCount

Returns the “default value” for a type.

impl Div<usize> for NodeCount

type Output = NodeCount

The resulting type after applying the / operator.

fn div(self, rhs: usize) -> <NodeCount as Div<usize>>::Output

Performs the / operation.

impl From<usize> for NodeCount

fn from(original: usize) -> NodeCount

Converts to this type from the input type.

impl Hash for NodeCount

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

where __H: Hasher,

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 Mul<usize> for NodeCount

type Output = NodeCount

The resulting type after applying the * operator.

fn mul(self, rhs: usize) -> <NodeCount as Mul<usize>>::Output

Performs the * operation.

impl Ord for NodeCount

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

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

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

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for NodeCount

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

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

type Output = NodeCount

The resulting type after applying the - operator.

fn sub(self, rhs: NodeCount) -> NodeCount

Performs the - operation.

impl SubAssign for NodeCount

fn sub_assign(&mut self, rhs: NodeCount)

Performs the -= operation.

impl Sum for NodeCount

fn sum<I>(iter: I) -> NodeCount

where I: Iterator<Item = NodeCount>,

Method which takes an iterator and generates Self from the elements by “summing up” the items.

impl Copy for NodeCount

impl Eq for NodeCount

impl StructuralPartialEq for NodeCount