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

use futures::future;
use futures_dagtask::{ TaskGraph, Error };


#[test]
fn test_cycle_dependent() {
    let mut graph = TaskGraph::new();
    let mut graph2 = TaskGraph::new();

    let zero = graph.add_task(&[], future::ready::<u32>(0)).unwrap();
    let err = graph2.add_task(&[zero], future::ready::<u32>(0));

    assert!(match err {
        Err(Error::WouldCycle(_)) => true,
        _ => false
    });
}

#[test]
fn test_overflow_index() {
    let mut graph = TaskGraph::<future::Ready<u8>, u8>::default();
    for i in 0..255 {
        graph.add_task(&[], future::ready(i)).unwrap();
    }

    let err = graph.add_task(&[], future::ready(255));

    assert!(match err {
        Err(Error::Exhausted(_)) => true,
        _ => false
    });
}