Struct aleph_bft::NodeMap

pub struct NodeMap<T>(/* private fields */);

A container keeping items indexed by NodeIndex.

Implementations

impl<T> NodeMap<T>

pub fn with_size(len: NodeCount) -> NodeMap<T>

where T: Clone,

Constructs a new node map with a given length.

pub fn from_hashmap( len: NodeCount, hashmap: HashMap<NodeIndex, T> ) -> NodeMap<T>

where T: Clone,

pub fn size(&self) -> NodeCount

pub fn iter(&self) -> impl Iterator<Item = (NodeIndex, &T)>

pub fn iter_mut(&mut self) -> impl Iterator<Item = (NodeIndex, &mut T)>

pub fn values(&self) -> impl Iterator<Item = &T>

pub fn into_values(self) -> impl Iterator<Item = T>

where T: 'static,

pub fn get(&self, node_id: NodeIndex) -> Option<&T>

pub fn get_mut(&mut self, node_id: NodeIndex) -> Option<&mut T>

pub fn insert(&mut self, node_id: NodeIndex, value: T)

pub fn to_subset(&self) -> NodeSubset

pub fn item_count(&self) -> usize

Trait Implementations

impl<T> Clone for NodeMap<T>

where T: Clone,

fn clone(&self) -> NodeMap<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for NodeMap<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Decode for NodeMap<T>

where Vec<Option<T>>: Decode,

fn decode<__CodecInputEdqy>( __codec_input_edqy: &mut __CodecInputEdqy ) -> Result<NodeMap<T>, Error>

where __CodecInputEdqy: Input,

Attempt to deserialise the value from input.

fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self> ) -> Result<DecodeFinished, Error>

where I: Input,

Attempt to deserialize the value from input into a pre-allocated piece of memory.

fn skip<I>(input: &mut I) -> Result<(), Error>

where I: Input,

Attempt to skip the encoded value from input.

fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type.

impl<T> Default for NodeMap<T>

where T: Default,

fn default() -> NodeMap<T>

Returns the “default value” for a type.

impl<T> Display for NodeMap<T>

where T: Display,

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

Formats the value using the given formatter.

impl<T> Encode for NodeMap<T>

where Vec<Option<T>>: Encode,

fn size_hint(&self) -> usize

If possible give a hint of expected size of the encoding.

fn encode_to<__CodecOutputEdqy>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy )

where __CodecOutputEdqy: Output + ?Sized,

Convert self to a slice and append it to the destination.

fn encode(&self) -> Vec<u8>

Convert self to an owned vector.

fn using_encoded<__CodecOutputReturn, __CodecUsingEncodedCallback>( &self, f: __CodecUsingEncodedCallback ) -> __CodecOutputReturn

where __CodecUsingEncodedCallback: FnOnce(&[u8]) -> __CodecOutputReturn,

Convert self to a slice and then invoke the given closure with it.

fn encoded_size(&self) -> usize

Calculates the encoded size.

impl<T> From<Vec<Option<T>>> for NodeMap<T>

fn from(original: Vec<Option<T>>) -> NodeMap<T>

Converts to this type from the input type.

impl<T> Hash for NodeMap<T>

where T: Hash,

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<'a, T> IntoIterator for &'a NodeMap<T>

type Item = (NodeIndex, &'a T)

The type of the elements being iterated over.

type IntoIter = Box<dyn Iterator<Item = (NodeIndex, &'a T)> + 'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a NodeMap<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut NodeMap<T>

type Item = (NodeIndex, &'a mut T)

The type of the elements being iterated over.

type IntoIter = Box<dyn Iterator<Item = (NodeIndex, &'a mut T)> + 'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a mut NodeMap<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for NodeMap<T>

where T: 'static,

type Item = (NodeIndex, T)

The type of the elements being iterated over.

type IntoIter = Box<dyn Iterator<Item = (NodeIndex, T)>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <NodeMap<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> PartialEq for NodeMap<T>

where T: PartialEq,

fn eq(&self, other: &NodeMap<T>) -> 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<S> PartialMultisignature for NodeMap<S>

where S: Signature,

type Signature = S

fn add_signature( self, signature: &<NodeMap<S> as PartialMultisignature>::Signature, index: NodeIndex ) -> NodeMap<S>

Adds the signature.

impl<T> EncodeLike for NodeMap<T>

where Vec<Option<T>>: Encode,

impl<T> Eq for NodeMap<T>

where T: Eq,

impl<T> StructuralPartialEq for NodeMap<T>