dataflow 0.4.0

Dataflow is a data processing library, primarily for machine learning.
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

#![allow(clippy::type_complexity)]

use std::marker::PhantomData;

use crate::pipeline::Node;

pub struct Map<I, N: Node<I>> {
    _phantom: PhantomData<I>,
    node: N,
}

impl<I, N: Node<I> + Clone> Clone for Map<I, N> {
    fn clone(&self) -> Self {
        Self {
            _phantom: self._phantom,
            node: self.node.clone(),
        }
    }
}

impl<I, O, E: Node<I, Output = O>> Map<I, E> {
    pub fn new(node: E) -> Self {
        Map {
            _phantom: PhantomData::default(),
            node,
        }
    }
}

impl<I, O, N: Node<I, Output = O>> Node<Vec<I>> for Map<I, N> {
    type Output = Vec<O>;

    fn process(&mut self, input: Vec<I>) -> Self::Output {
        input.into_iter().map(|i| self.node.process(i)).collect()
    }
}

pub trait ExtendNodeMap<Input, Output, E: Node<Input, Output = Vec<Output>>> {
    fn map<O, N: Node<Output, Output = O>>(self, node: N) -> (E, Map<Output, N>);
    fn filter_map<O, N: Node<Output, Output = Option<O>>>(
        self,
        node: N,
    ) -> (E, FilterMap<Output, N>);
    fn filter<F: FnMut(&Output) -> bool>(self, function: F) -> (E, Filter<Output, F>);
}

impl<Input, Output, E: Node<Input, Output = Vec<Output>>> ExtendNodeMap<Input, Output, E> for E {
    fn map<O, N: Node<Output, Output = O>>(self, node: N) -> (E, Map<Output, N>)
    where
        Self: std::marker::Sized,
    {
        (self, Map::new(node))
    }

    fn filter_map<O, N: Node<Output, Output = Option<O>>>(
        self,
        node: N,
    ) -> (E, FilterMap<Output, N>)
    where
        Self: std::marker::Sized,
    {
        (self, FilterMap::new(node))
    }

    fn filter<F: FnMut(&Output) -> bool>(self, function: F) -> (E, Filter<Output, F>) {
        (self, Filter::new(function))
    }
}

pub struct FilterMap<I, N: Node<I>> {
    _phantom: PhantomData<I>,
    node: N,
}

impl<I, O, E: Node<I, Output = Option<O>>> FilterMap<I, E> {
    pub fn new(node: E) -> Self {
        FilterMap {
            _phantom: PhantomData::default(),
            node,
        }
    }
}

impl<I, O, N: Node<I, Output = Option<O>>> Node<Vec<I>> for FilterMap<I, N> {
    type Output = Vec<O>;

    fn process(&mut self, input: Vec<I>) -> Self::Output {
        input
            .into_iter()
            .filter_map(|i| self.node.process(i))
            .collect()
    }
}

pub struct Filter<I, F: FnMut(&I) -> bool> {
    _phantom: PhantomData<I>,
    function: F,
}

impl<I, F: FnMut(&I) -> bool> Filter<I, F> {
    pub fn new(function: F) -> Self {
        Filter {
            _phantom: PhantomData::default(),
            function,
        }
    }
}

impl<I, F: FnMut(&I) -> bool> Node<Vec<I>> for Filter<I, F> {
    type Output = Vec<I>;

    fn process(&mut self, input: Vec<I>) -> Self::Output {
        input.into_iter().filter(|i| (self.function)(i)).collect()
    }
}