rsdiff-graphs 0.0.2

Computational graphs for 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

/*
    Appellation: node <module>
    Contrib: FL03 <jo3mccain@icloud.com>
*/
use crate::NodeIndex;
use rsdiff::id::AtomicId;
use rsdiff::ops::{BinaryOp, Op, UnaryOp};

#[derive(Clone, Debug)]
pub enum Node<T> {
    Binary {
        lhs: NodeIndex,
        rhs: NodeIndex,
        op: BinaryOp,
    },
    Unary {
        input: NodeIndex,
        op: UnaryOp,
    },
    Op {
        inputs: Vec<NodeIndex>,
        op: Op,
    },
    Input {
        id: AtomicId,
        param: bool,
        value: T,
    },
}

impl<T> Node<T> {
    pub fn binary(lhs: NodeIndex, rhs: NodeIndex, op: impl Into<BinaryOp>) -> Self {
        Node::Binary {
            lhs,
            rhs,
            op: op.into(),
        }
    }

    pub fn unary(input: NodeIndex, op: impl Into<UnaryOp>) -> Self {
        Node::Unary {
            input,
            op: op.into(),
        }
    }

    pub fn op(inputs: impl IntoIterator<Item = NodeIndex>, op: impl Into<Op>) -> Self {
        Node::Op {
            inputs: Vec::from_iter(inputs),
            op: op.into(),
        }
    }

    pub fn input(param: bool, value: T) -> Self {
        Node::Input {
            id: AtomicId::new(),
            param,
            value,
        }
    }

    pub fn value(&self) -> T
    where
        T: Copy + Default,
    {
        match self {
            Node::Input { value, .. } => *value,
            _ => T::default(),
        }
    }
}