acts 0.17.2

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

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

#[derive(Debug)]
pub struct TaskTree {
    maps: BTreeMap<String, Arc<Task>>,
    root: Option<Arc<Task>>,
}

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

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

    pub fn root(&self) -> Option<Arc<Task>> {
        self.root.clone()
    }

    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>) {
        self.maps
            .entry(task.id.clone())
            .and_modify(|t| {
                *t = task.clone();
                // t.set_pure_state(task.state());
                // t.set_end_time(task.end_time());
                // t.set_data(&task.data());
                // t.set_hooks(&task.hooks());
                // if let Some(err) = task.err() {
                //     t.set_err(&err);
                // }
            })
            .or_insert(task.clone());
        if task.node().kind() == NodeKind::Workflow {
            self.root = Some(task);
        }
    }
}