daedalus-planner 0.1.1

Planner that validates and schedules Daedalus dataflow graphs.
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

use crate::{ComputeAffinity, NodeInstance};

/// Convenience helper to build a `NodeInstance` for tests/examples.
///
/// ```
/// use daedalus_planner::helpers::node;
/// use daedalus_planner::ComputeAffinity;
/// let instance = node("demo", ComputeAffinity::CpuOnly, ["in"], ["out"]);
/// assert_eq!(instance.outputs.len(), 1);
/// ```
pub fn node(
    id: impl Into<String>,
    compute: ComputeAffinity,
    inputs: impl IntoIterator<Item = impl Into<String>>,
    outputs: impl IntoIterator<Item = impl Into<String>>,
) -> NodeInstance {
    NodeInstance {
        id: daedalus_registry::ids::NodeId::new(id.into()),
        bundle: None,
        label: None,
        inputs: inputs.into_iter().map(Into::into).collect(),
        outputs: outputs.into_iter().map(Into::into).collect(),
        compute,
        const_inputs: Vec::new(),
        sync_groups: Vec::new(),
        metadata: Default::default(),
    }
}