Struct proc_graph::Network

pub struct Network<T> { /* fields omitted */ }

A network of processes. Each process has a mailbox and the set of addresses (senders) it needs to communicate with its neighbors.

Methods

impl<T> Network<T> where
    T: Default + Send + 'static, 

pub fn new() -> Self

pub fn add_process<'a, F>(
    &'a mut self,
    name: &'static str,
    adj: Vec<&'static str>,
    body: F
) where
    F: Fn(HashMap<String, Sender<(String, T)>>, Receiver<(String, T)>) + Send + 'static, 

Adding a process to the network takes a name, its neighbors, and a closure which acts as the entire body of this process. I.e., if you want the process to run forever, that loop has to be inside the given closure.

The process's neighbor's addresses (the senders) and the process's mailbox are passed into the closure. The only abstraction provided here is converting the given graph—described the process and its adjacencies—into mailboxes and addresses.

pub fn start_and_wait(self)

Start the processes in this network. Blocks until all of the processes have finished.

pub fn start(self)

Start the processes in this network.

Trait Implementations

impl<T: Default> Default for Network<T>

fn default() -> Network<T>

Returns the "default value" for a type.