fn defer_messages(&mut self, step: &mut CpStep<D>) {
        let max_future_epochs = self.algo.max_future_epochs();
        // Append the deferred messages onto the queues.
        for (id, message) in step.defer_messages(&self.peer_epochs, max_future_epochs) {
            self.outgoing_queue
                .entry(id)
                .or_default()
                .entry(message.first_epoch())
                .or_default()
                .push(message);
        }
    }
/// Removes any messages to nodes at earlier epochs from the given `Step`. This may involve
/// decomposing a `Target::all()` message into `Target::Nodes` messages and sending some of the
/// resulting messages while placing onto the queue those remaining messages whose recipient is
/// currently at an earlier epoch.
Removes any messages to nodes at earlier epochs from the given `Step`. This may involve
decomposing a `Target::all()` message into `Target::Nodes` messages and sending some of the
resulting messages while placing onto the queue those remaining messages whose recipient is
currently at an earlier epoch.
Removes any messages to nodes at earlier epochs from the given ` Step ` . This may involve decomposing a ` Target :: all () ` message into ` Target :: Nodes ` messages and sending some of the resulting messages while placing onto the queue those remaining messages whose recipient is currently at an earlier epoch .
fn defer_messages(&mut self, step: &mut CpStep<D>) {
        let max_future_epochs = self.algo.max_future_epochs();
        // Append the deferred messages onto the queues.
        for (id, message) in step.defer_messages(&self.peer_epochs, max_future_epochs) {
            self.outgoing_queue
                .entry(id)
                .or_default()
                .entry(message.first_epoch())
                .or_default()
                .push(message);
        }
    }
fn defer_messages ( & mut self , step : & mut CpStep < D > ) { let max_future_epochs = self . algo . max_future_epochs ( ) ; // Append the deferred messages onto the queues. for ( id , message ) in step . defer_messages ( & self . peer_epochs , max_future_epochs ) { self . outgoing_queue . entry ( id ) . or_default ( ) . entry ( message . first_epoch ( ) ) . or_default ( ) . push ( message ) ; } }
Removes any messages to nodes at earlier epochs from the given `Step`.
Removes any messages to nodes at earlier epochs from the given ` Step ` .
&mut self
step
&mut CpStep<D>
&mut self
step
&mut CpStep<D>