use clock::ReplicaId; pub struct Network { inboxes: std::collections::BTreeMap>>, all_messages: Vec, rng: R, } #[derive(Clone)] struct Envelope { message: T, } impl Network { pub fn new(rng: R) -> Self { Network { inboxes: Default::default(), all_messages: Vec::new(), rng, } } pub fn add_peer(&mut self, id: ReplicaId) { self.inboxes.insert(id, Vec::new()); } pub fn replicate(&mut self, old_replica_id: ReplicaId, new_replica_id: ReplicaId) { self.inboxes .insert(new_replica_id, self.inboxes[&old_replica_id].clone()); } pub fn is_idle(&self) -> bool { self.inboxes.values().all(|i| i.is_empty()) } pub fn broadcast(&mut self, sender: ReplicaId, messages: Vec) { for (replica, inbox) in self.inboxes.iter_mut() { if *replica != sender { for message in &messages { // Insert one or more duplicates of this message, potentially *before* the previous // message sent by this peer to simulate out-of-order delivery. for _ in 0..self.rng.gen_range(1..4) { let insertion_index = self.rng.gen_range(0..inbox.len() + 1); inbox.insert( insertion_index, Envelope { message: message.clone(), }, ); } } } } self.all_messages.extend(messages); } pub fn has_unreceived(&self, receiver: ReplicaId) -> bool { !self.inboxes[&receiver].is_empty() } pub fn receive(&mut self, receiver: ReplicaId) -> Vec { let inbox = self.inboxes.get_mut(&receiver).unwrap(); let count = self.rng.gen_range(0..inbox.len() + 1); inbox .drain(0..count) .map(|envelope| envelope.message) .collect() } }