pub fn build(self, our_id: D::NodeId) -> (SenderQueue<D>, CpStep<SenderQueue<D>>) {
        let epoch = self.algo.epoch();
        let sq = SenderQueue {
            algo: self.algo,
            our_id,
            outgoing_queue: BTreeMap::new(),
            peer_epochs: self.peer_epochs,
            last_epochs: BTreeMap::new(),
            participants_after_change: BTreeSet::new(),
            is_removed: false,
        };
        let step = Target::all().message(Message::EpochStarted(epoch)).into();
        (sq, step)
    }
/// Creates a new sender queue and returns the `Step` with the initial message.
Creates a new sender queue and returns the `Step` with the initial message.
Creates a new sender queue and returns the ` Step ` with the initial message .
pub fn build(self, our_id: D::NodeId) -> (SenderQueue<D>, CpStep<SenderQueue<D>>) {
        let epoch = self.algo.epoch();
        let sq = SenderQueue {
            algo: self.algo,
            our_id,
            outgoing_queue: BTreeMap::new(),
            peer_epochs: self.peer_epochs,
            last_epochs: BTreeMap::new(),
            participants_after_change: BTreeSet::new(),
            is_removed: false,
        };
        let step = Target::all().message(Message::EpochStarted(epoch)).into();
        (sq, step)
    }
pub fn build ( self , our_id : D :: NodeId ) -> ( SenderQueue < D > , CpStep < SenderQueue < D > > ) { let epoch = self . algo . epoch ( ) ; let sq = SenderQueue { algo : self . algo , our_id , outgoing_queue : BTreeMap :: new ( ) , peer_epochs : self . peer_epochs , last_epochs : BTreeMap :: new ( ) , participants_after_change : BTreeSet :: new ( ) , is_removed : false , } ; let step = Target :: all ( ) . message ( Message :: EpochStarted ( epoch ) ) . into ( ) ; ( sq , step ) }
Creates a new sender queue and returns the `Step` with the initial message.
Creates a new sender queue and returns the ` Step ` with the initial message .
self
our_id
D::NodeId
self
our_id
D::NodeId