scientific-workflow 0.7.1

Configuration-driven scientific tasks, typed state, and durable recordings
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

//! Allocation-stable sweep selection over precomputed mixed-radix strides.

use super::super::parameter_path::ParameterPath;
use super::super::parameter_tree::ParameterLeaf;

pub(crate) struct SweepPlan {
    kind: SweepKind,
    selectable_paths: Vec<ParameterPath>,
}

enum SweepKind {
    Cartesian {
        dimensions: Vec<SweepDimension>,
        combination_count: u64,
    },
    Cases {
        cases: Vec<Vec<ParameterLeaf>>,
    },
}

pub(super) struct SweepDimension {
    pub(super) path: ParameterPath,
    pub(super) candidates: Vec<Vec<ParameterLeaf>>,
    pub(super) stride: u64,
}

impl SweepPlan {
    pub(super) fn cartesian(
        dimensions: Vec<SweepDimension>,
        combination_count: u64,
        selectable_paths: Vec<ParameterPath>,
    ) -> Self {
        Self {
            kind: SweepKind::Cartesian {
                dimensions,
                combination_count,
            },
            selectable_paths,
        }
    }

    pub(super) fn cases(
        cases: Vec<Vec<ParameterLeaf>>,
        selectable_paths: Vec<ParameterPath>,
    ) -> Self {
        Self {
            kind: SweepKind::Cases { cases },
            selectable_paths,
        }
    }

    pub(crate) fn combination_count(&self) -> u64 {
        match &self.kind {
            SweepKind::Cartesian {
                combination_count, ..
            } => *combination_count,
            SweepKind::Cases { cases } => {
                u64::try_from(cases.len()).expect("validated case count fits u64")
            }
        }
    }

    pub(crate) fn selectable_paths(&self) -> &[ParameterPath] {
        &self.selectable_paths
    }

    pub(crate) fn all_leaf_paths(&self) -> Box<dyn Iterator<Item = &ParameterPath> + '_> {
        match &self.kind {
            SweepKind::Cartesian { dimensions, .. } => Box::new(
                dimensions
                    .iter()
                    .flat_map(|dimension| dimension.candidates.iter())
                    .flat_map(|candidate| candidate.iter().map(|leaf| &leaf.path)),
            ),
            SweepKind::Cases { cases } => Box::new(
                cases
                    .iter()
                    .flat_map(|case| case.iter().map(|leaf| &leaf.path)),
            ),
        }
    }

    pub(crate) fn selected_leaves(
        &self,
        ordinal: u64,
    ) -> Box<dyn Iterator<Item = &ParameterLeaf> + '_> {
        match &self.kind {
            SweepKind::Cartesian { dimensions, .. } => {
                Box::new(dimensions.iter().flat_map(move |dimension| {
                    let length = dimension.candidates.len() as u64;
                    let selected = ((ordinal / dimension.stride) % length) as usize;
                    dimension.candidates[selected].iter()
                }))
            }
            SweepKind::Cases { cases } => Box::new(cases[ordinal as usize].iter()),
        }
    }

    pub(crate) fn selected_leaf(
        &self,
        ordinal: u64,
        path: &ParameterPath,
    ) -> Option<&ParameterLeaf> {
        self.selected_leaves(ordinal)
            .find(|leaf| &leaf.path == path)
    }

    pub(crate) fn selected_leaf_count(&self, ordinal: u64) -> usize {
        self.selected_leaves(ordinal).count()
    }
}