noir-compute 0.2.0

Network of Operators In Rust
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

use noir_compute::operator::source::IteratorSource;
use utils::TestHelper;

mod utils;

#[test]
fn interval_join_keyed_stream() {
    TestHelper::local_remote_env(|env| {
        let source = IteratorSource::new(0..10);
        let source2 = IteratorSource::new(0..10);

        let right = env
            .stream(source2)
            .add_timestamps(|&x| x, |&x, &ts| if x % 2 == 0 { Some(ts) } else { None })
            .group_by(|x| x % 2);
        let res = env
            .stream(source)
            .add_timestamps(|&x| x, |&x, &ts| if x % 2 == 0 { Some(ts) } else { None })
            .group_by(|x| x % 2)
            .interval_join(right, 1, 2)
            .collect_vec();

        env.execute_blocking();

        if let Some(mut res) = res.get() {
            let mut expected = Vec::new();
            for l in 0..10 {
                for r in l - 1..=l + 2 {
                    if !(0..10).contains(&r) || l % 2 != r % 2 {
                        continue;
                    }
                    expected.push((l % 2, (l, r)));
                }
            }
            expected.sort_unstable();
            res.sort_unstable();
            assert_eq!(res, expected);
        }
    });
}

#[test]
fn interval_join_stream() {
    TestHelper::local_remote_env(|env| {
        let source = IteratorSource::new(0..10);
        let source2 = IteratorSource::new(0..10);

        let right = env
            .stream(source2)
            .add_timestamps(|&x| x, |&x, &ts| if x % 2 == 0 { Some(ts) } else { None });
        let res = env
            .stream(source)
            .add_timestamps(|&x| x, |&x, &ts| if x % 2 == 0 { Some(ts) } else { None })
            .interval_join(right, 1, 2)
            .collect_vec();

        env.execute_blocking();

        if let Some(mut res) = res.get() {
            let mut expected = Vec::new();
            for l in 0..10 {
                for r in l - 1..=l + 2 {
                    if !(0..10).contains(&r) {
                        continue;
                    }
                    expected.push((l, r));
                }
            }
            expected.sort_unstable();
            res.sort_unstable();
            assert_eq!(res, expected);
        }
    });
}