dager 0.1.1

Crate to create and execute a graph of nodes.
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

/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at https://mozilla.org/MPL/2.0/. */


use std::marker::PhantomData;

use crate::edge::Edge;

///represent one input pin. Might have a edge assigned. If not, the default value provided by the node is used. Otherwise
/// The aggregator waits for a input via an edge.
pub struct InCol<A>{
    pub edge: Option<Edge>,
    pub value: Option<A>
}

impl<A> Default for InCol<A>{
    fn default() -> Self{
	InCol{
	    edge: None,
	    value: None
	}
    }
}

///Represents some output pin that might have an edge attached. If an edge is attached, the parent node
/// can send data to some receiving node's aggregator.
pub struct OutCol<A>{
    ty: PhantomData<A>,
    pub edge: Option<Edge>,
}

impl<A> Default for OutCol<A>{
    fn default() -> Self {
	OutCol{
	    ty: PhantomData,
	    edge: None
	}
    }
}