dfir_rs 0.16.0

DFIR runtime for Rust, used by Hydro.
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

use std::cell::RefCell;
use std::rc::Rc;

use dfir_rs::dfir_expect_warnings;
use dfir_rs::util::collect_ready;

#[test]
fn test_degenerate_union() {
    let (result_send, mut result_recv) = dfir_rs::util::unbounded_channel::<usize>();

    let mut df = dfir_expect_warnings! {
        {
            source_iter([1, 2, 3]) -> union() -> for_each(|x| result_send.send(x).unwrap());
        },
        ("`union` should have at least 2 input(s), actually has 1.", 2:38),
    };
    df.run_available_sync();

    assert_eq!(&[1, 2, 3], &*collect_ready::<Vec<_>, _>(&mut result_recv));
}

#[test]
fn test_empty_union() {
    let mut df = dfir_expect_warnings! {
        {
            union() -> for_each(|x: usize| println!("{}", x));
        },
        ("`union` should have at least 2 input(s), actually has 0.", 2:12),
    };
    df.run_available_sync();
}

#[test]
fn test_degenerate_tee() {
    let (result_send, mut result_recv) = dfir_rs::util::unbounded_channel::<usize>();

    let mut df = dfir_expect_warnings! {
        {
            source_iter([1, 2, 3]) -> tee() -> for_each(|x| result_send.send(x).unwrap());
        },
        ("`tee` should have at least 2 output(s), actually has 1.", 2:38)
    };
    df.run_available_sync();

    assert_eq!(&[1, 2, 3], &*collect_ready::<Vec<_>, _>(&mut result_recv));
}

#[test]
fn test_empty_tee() {
    let output = <Rc<RefCell<Vec<usize>>>>::default();
    let output_inner = Rc::clone(&output);

    let mut df = dfir_expect_warnings! {
        {
            source_iter([1, 2, 3]) -> inspect(|&x| output_inner.borrow_mut().push(x)) -> tee();
        },
        ("`tee` should have at least 2 output(s), actually has 0.", 2:89),
    };
    df.run_available_sync();

    assert_eq!(&[1, 2, 3], &**output.borrow());
}

// Mainly checking subgraph partitioning pull-push handling.
// But in a different edge order.
#[test]
pub fn test_warped_diamond() {
    let mut df = dfir_expect_warnings! {
        {
            // active nodes
            nodes = union();

            // stream of nodes into the system
            init = join() -> for_each(|(n, (a, b))| {
                println!("DEBUG ({:?}, ({:?}, {:?}))", n, a, b);
            });
            new_node = source_iter([1, 2, 3]) -> tee();
            // add self
            new_node[0] -> map(|n| (n, 'a')) -> [0]nodes;
            // join peers against active nodes
            nodes -> [0]init;
            new_node[1] -> map(|n| (n, 'b')) -> [1]init;
        },
        ("`union` should have at least 2 input(s), actually has 1.", 3:20),
    };
    df.run_available_sync();
}

#[test]
pub fn test_warped_diamond_2() {
    let mut hf = dfir_expect_warnings! {
        {
            // active nodes
            nodes = union();

            // stream of nodes into the system
            init = join() -> for_each(|(n, (a, b))| {
                println!("DEBUG ({:?}, ({:?}, {:?}))", n, a, b);
            });
            new_node = source_iter([1, 2, 3]) -> tee();
            // add self
            new_node[0] -> map(|n| (n, 'a')) -> [0]nodes;
            // join peers against active nodes
            nodes -> [0]init;
            new_node[1] -> map(|n| (n, 'b')) -> [1]init;

            ntwk = source_iter([4, 5, 6]) -> tee();
        },
        ("`union` should have at least 2 input(s), actually has 1.", 3:20),
        ("`tee` should have at least 2 output(s), actually has 0.", 16:45),
    };
    hf.run_available_sync();
}