acts 0.24.0

a fast, lightweight, extensiable workflow engine
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

use crate::{NodeKind, Result, scheduler::Task};
use std::{collections::BTreeMap, sync::Arc};

#[derive(Debug)]
pub struct TaskTree {
    maps: BTreeMap<String, Arc<Task>>,
    root: Option<Arc<Task>>,
    /// task instances created per node id; bounds re-execution of a node
    /// (a self-loop / cyclic `next` must not create tasks forever)
    run_counts: BTreeMap<String, usize>,
}

impl TaskTree {
    pub fn new() -> Self {
        Self {
            maps: BTreeMap::new(),
            root: None,
            run_counts: BTreeMap::new(),
        }
    }

    pub fn tasks(&self) -> Vec<Arc<Task>> {
        self.maps.values().cloned().collect()
    }

    pub fn task_by_tid(&self, tid: &str) -> Option<Arc<Task>> {
        self.maps.get(tid).cloned()
    }

    pub fn find_tasks(&self, predicate: impl Fn(&Arc<Task>) -> bool) -> Vec<Arc<Task>> {
        let mut tasks = Vec::new();
        for t in self.maps.values() {
            if predicate(t) {
                tasks.push(t.clone());
            }
        }
        tasks
    }

    pub fn push(&mut self, task: Arc<Task>) -> Result<()> {
        let is_new = !self.maps.contains_key(&task.id);
        // only insert and not replace old task
        self.maps.entry(task.id.clone()).or_insert(task.clone());
        if is_new {
            *self
                .run_counts
                .entry(task.node().id().to_string())
                .or_insert(0) += 1;
        }
        if task.node().kind() == NodeKind::Workflow {
            self.root = Some(task);
        }
        Ok(())
    }
    /// number of task instances created for the node in this process
    pub fn run_count(&self, node_id: &str) -> usize {
        self.run_counts.get(node_id).copied().unwrap_or(0)
    }
}