Struct Proposals 

pub struct Proposals<T: NodeType> {
    live: BTreeMap<ViewNumber, Commitment<Leaf2<T>>>,
    all: BTreeMap<ViewNumber, BTreeMap<Commitment<Leaf2<T>>, Proposal<T>>>,
}

The proposals a node holds, by view and commitment.

A view normally holds one. An equivocating leader can send different proposals for its view to different nodes, and at an epoch boundary two leaders can propose for one view, so a node can hold several. Every certificate names its proposal by commitment, and whatever a node does on a certificate’s behalf looks the proposal up by that commitment. So no proposal ever has to give way to another, whatever order they arrive in.

live is, per view, the proposal the node paired with its own VID share.

Fields

live: BTreeMap<ViewNumber, Commitment<Leaf2<T>>>

all: BTreeMap<ViewNumber, BTreeMap<Commitment<Leaf2<T>>, Proposal<T>>>

Implementations

impl<T: NodeType> Proposals<T>

pub fn new() -> Self

pub fn live(&self, v: ViewNumber) -> Option<&Proposal<T>>

pub fn at(&self, v: ViewNumber) -> impl Iterator<Item = &Proposal<T>>

pub fn get( &self, v: ViewNumber, c: Commitment<Leaf2<T>>, ) -> Option<&Proposal<T>>

pub fn contains(&self, v: ViewNumber, c: Commitment<Leaf2<T>>) -> bool

pub fn range<R>(&self, r: R) -> impl Iterator<Item = &Proposal<T>>

where R: RangeBounds<ViewNumber>,

pub fn latest_before( &self, v: ViewNumber, c: Commitment<Leaf2<T>>, ) -> Option<&Proposal<T>>

The proposal held under c at the latest view before v.

pub fn last(&self) -> Option<&Proposal<T>>

pub fn insert_under(&mut self, p: Proposal<T>, c: Commitment<Leaf2<T>>)

pub fn set_live(&mut self, v: ViewNumber, c: Commitment<Leaf2<T>>)

pub fn retain_from(&mut self, view: ViewNumber)