Struct ProposalQueue 

pub struct ProposalQueue { /* private fields */ }

Proposal queue that helps filtering and sorting Proposals received during one epoch. The Proposals are stored in a HashMap which maps Proposal references to Proposals, such that, given a reference, a proposal can be accessed efficiently. To enable iteration over the queue in order, the ProposalQueue also contains a vector of ProposalRefs.

Implementations

impl ProposalQueue

pub fn get(&self, proposal_reference: &HashReference) -> Option<&QueuedProposal>

Returns proposal for a given proposal ID

Trait Implementations

impl Clone for ProposalQueue

fn clone(&self) -> ProposalQueue

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProposalQueue

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

Formats the value using the given formatter.

impl Default for ProposalQueue

fn default() -> ProposalQueue

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for ProposalQueue

fn deserialize<__D>( __deserializer: __D, ) -> Result<ProposalQueue, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Extend<QueuedProposal> for ProposalQueue

fn extend<T>(&mut self, iter: T)

where T: IntoIterator<Item = QueuedProposal>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl FromIterator<QueuedProposal> for ProposalQueue

fn from_iter<T>(iter: T) -> ProposalQueue

where T: IntoIterator<Item = QueuedProposal>,

Creates a value from an iterator.

impl<'a> IntoIterator for &'a ProposalQueue

type Item = &'a QueuedProposal

The type of the elements being iterated over.

type IntoIter = Values<'a, HashReference, QueuedProposal>

Which kind of iterator are we turning this into?

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

Creates an iterator from a value.

impl IntoIterator for ProposalQueue

type Item = QueuedProposal

The type of the elements being iterated over.

type IntoIter = IntoValues<HashReference, QueuedProposal>

Which kind of iterator are we turning this into?

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

Creates an iterator from a value.

impl PartialEq for ProposalQueue

fn eq(&self, other: &ProposalQueue) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl Serialize for ProposalQueue

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for ProposalQueue