dagrs 0.8.1

Dagrs follows the concept of Flow-based Programming and is suitable for the execution of multiple tasks with graph-like dependencies. Dagrs has the characteristics of high performance and asynchronous execution. It provides users with a convenient programming interface.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

//! # Example: auto_relay
//! The macro `dependencies!` simplifies the construction of a `Graph`,
//! including the addition of nodes and edges.

use dagrs::{EmptyAction, InChannels, Node, NodeTable, OutChannels, auto_node, dependencies};

#[auto_node]
struct MyNode {/*Put customized fields here.*/}

impl MyNode {
    fn new(name: &str, node_table: &mut NodeTable) -> Self {
        Self {
            id: node_table.alloc_id_for(name),
            name: name.to_string(),
            input_channels: InChannels::default(),
            output_channels: OutChannels::default(),
            action: Box::new(EmptyAction),
        }
    }
}

#[tokio::main]
async fn main() -> Result<(), dagrs::DagrsError> {
    let mut node_table = NodeTable::default();

    let node_name = "auto_node";

    let s = MyNode::new(node_name, &mut node_table);
    let a = MyNode::new(node_name, &mut node_table);
    let b = MyNode::new(node_name, &mut node_table);

    let mut g = dependencies!(
        s -> a b,
        b -> a
    )?;
    g.async_start().await?;
    Ok(())
}