futures-dagtask 0.3.0

DAG-based Task Queue
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173

use std::sync::{ Arc, Mutex };
use futures::future;
use futures::prelude::*;
use futures::executor::LocalPool;
use futures_dagtask::TaskGraph;


#[test]
fn test_simple_dependent() {
    let fut = async {
        let mut graph = TaskGraph::new();
        let zero = graph.add_task(&[], future::ready::<u32>(0)).unwrap();
        let one = graph.add_task(&[zero], future::ready(1)).unwrap();
        let (add, exec) = graph.execute();
        let _two = add.add_task(&[one], future::ready(2)).await.unwrap();

        exec.take(3)
            .map(|(_, n)| n)
            .collect::<Vec<_>>().await
    };

    let output = LocalPool::new()
        .run_until(fut);

    assert_eq!(output, vec![0, 1, 2]);
}

#[test]
fn test_concurrent_dependent() {
    let fut = async {
        let mut graph = TaskGraph::new();
        let zero0 = graph.add_task(&[], future::ready::<(u32, u32)>((0, 0))).unwrap();
        let zero1 = graph.add_task(&[], future::ready((0, 1))).unwrap();
        let one0 = graph.add_task(&[zero0], future::ready((1, 0))).unwrap();
        let _one1 = graph.add_task(&[zero0], future::ready((1, 1))).unwrap();
        let (add, exec) = graph.execute();
        let _two0 = add.add_task(
            &[zero1, one0],
            future::ready((2, 0))
        ).await.unwrap();

        exec.take(5)
            .map(|(_, n)| n)
            .collect::<Vec<_>>().await
    };

    let output = LocalPool::new()
        .run_until(fut);

    let zero0 = find(&output, (0, 0));
    let zero1 = find(&output, (0, 1));
    let one0 = find(&output, (1, 0));
    let one1 = find(&output, (1, 1));
    let two0 = find(&output, (2, 0));

    assert!(zero0 < one0 && zero1 < two0 && one0 < two0);
    assert!(zero0 < one1);
}

#[test]
fn test_concurrent_dependent2() {
    let fut = async {
        let mut graph = TaskGraph::new();
        let zero0 = graph.add_task(
            &[],
            future::ready::<(u32, u32)>((0, 0)).boxed()
        ).unwrap();
        let (add, exec) = graph.execute();
        let add = Arc::new(add);
        let add2 = add.clone();

        let _zero1 = add.add_task(
            &[],
            (async move {
                let _one0 = add2.add_task(
                    &[zero0],
                    future::ready((1u32, 0u32)).boxed()
                ).await.unwrap();
                future::ready((0u32, 1u32)).await
            }).boxed()
        ).await.unwrap();

        exec.take(3)
            .map(|(_, n)| n)
            .collect::<Vec<_>>().await
    };

    let output = LocalPool::new()
        .run_until(fut);

    let zero0 = find(&output, (0, 0));
    let zero1 = find(&output, (0, 1));
    let one0 = find(&output, (1, 0));

    assert!(zero0 < one0 && zero1 < one0);
}

#[test]
fn test_cancel() {
    let fut = async {
        let mut graph = TaskGraph::new();
        let zero = graph.add_task(&[], future::ready::<u32>(0)).unwrap();
        let one = graph.add_task(&[zero], future::ready(1)).unwrap();
        let (add, exec) = graph.execute();
        let _two = add.add_task(&[one], future::ready(2)).await.unwrap();

        drop(add);
        exec.map(|(_, n)| n).collect::<Vec<_>>().await
    };

    let output = LocalPool::new()
        .run_until(fut);

    assert_eq!(output, vec![0, 1, 2]);
}

#[test]
fn test_abort() {
    let fut = async {
        let mut graph = TaskGraph::new();
        let zero = graph.add_task(
            &[],
            future::ready::<u32>(0).boxed()
        ).unwrap();
        let (add, exec) = graph.execute();
        let add = Arc::new(Mutex::new(Some(add)));
        let add2 = add.clone();

        add.lock().unwrap().as_ref().unwrap().add_task(
            &[zero],
            (async move {
                add2.lock().unwrap().take().unwrap().abort();
                future::ready(1u32).await
            }).boxed()
        ).await.unwrap();

        exec.map(|(_, n)| n).collect::<Vec<_>>().await
    };

    let output = LocalPool::new()
        .run_until(fut);

    assert_eq!(output, vec![0u32, 1]);
}

#[test]
fn test_custom_index() {
    let fut = async {
        let mut graph = TaskGraph::<future::Ready<u32>, u64>::default();
        let zero = graph.add_task(&[], future::ready(0)).unwrap();
        let one = graph.add_task(&[zero], future::ready(1)).unwrap();
        let (add, exec) = graph.execute();
        let _two = add.add_task(&[one], future::ready(2)).await.unwrap();

        drop(add);
        exec.map(|(_, n)| n).collect::<Vec<_>>().await
    };

    let output = LocalPool::new()
        .run_until(fut);
    assert_eq!(output, vec![0, 1, 2]);
}

fn find(output: &[(u32, u32)], target: (u32, u32)) -> usize {
    output.iter()
        .enumerate()
        .find_map(|(i, &n)| if n == target {
            Some(i)
        } else {
            None
        })
        .unwrap()
}