operon 0.7.0

A workflow engine for parallel, incremental scheduling of DAG-defined multiplex tasks.
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283

fn compare_and_replace_tag_opt<const N: usize, Cmp>(
    tags: &mut [Option<([usize; N], usize)>],
    idx: &mut usize,
    tag: ([usize; N], usize),
    cmp: Cmp,
) where
    Cmp: Fn(&([usize; N], usize), &([usize; N], usize)) -> bool,
{
    match &mut tags[*idx] {
        Some(existing_tag) => {
            if cmp(&tag, existing_tag) {
                *existing_tag = tag;
            }
        }
        None => {
            tags[*idx] = Some(tag);
        }
    }
    *idx += 1;
}

/// Computes the Discrete Oriented Polytope (DOP) tags for a set of given tags.
///
/// Specifically, for each coordinate in the input tags, return only the tags that have mimimal and
/// maximal projections against the following vectors:
/// - Each unit vector along each dimension,
/// - Each sum or difference of two distinct unit vectors along each pair of dimensions.
///
/// The algorithm returns at most 2N + 2N(N-1) = 2N^2 tags for N-dimensional coordinates.
pub fn get_dop_tags<const N: usize>(tags: &[([usize; N], usize)]) -> Vec<([usize; N], usize)> {
    // Since the tag is (N+1)-dimensional (including the spawn dim)...
    let mut dop_tags: Vec<Option<([usize; N], usize)>> = vec![None; 2 * (N + 1) * (N + 1)];
    for &tag in tags {
        let mut idx = 0;

        // Compare against the current dop tags and update as needed.
        // Unit across non-spawn dimensions:
        for i in 0..N {
            compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| a.0[i] < b.0[i]);
            compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| a.0[i] > b.0[i]);
        }
        // Unit of spawn dimension:
        compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| a.1 < b.1);
        compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| a.1 > b.1);
        // Sum or difference of two distinct dimensions:
        for i in 0..N {
            for j in (i + 1)..N {
                compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| {
                    a.0[i] + a.0[j] < b.0[i] + b.0[j]
                });
                compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| {
                    a.0[i] + a.0[j] > b.0[i] + b.0[j]
                });
                // Comparison against <1, -1, 0, ...> replaced with additive form to avoid
                // usize subtraction
                compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| {
                    a.0[i] + b.0[j] < b.0[i] + a.0[j]
                });
                compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| {
                    a.0[i] + b.0[j] > b.0[i] + a.0[j]
                });
            }
            compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| {
                a.0[i] + a.1 < b.0[i] + b.1
            });
            compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| {
                a.0[i] + a.1 > b.0[i] + b.1
            });
            compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| {
                a.0[i] + b.1 < b.0[i] + a.1
            });
            compare_and_replace_tag_opt(&mut dop_tags, &mut idx, tag, |a, b| {
                a.0[i] + b.1 > b.0[i] + a.1
            });
        }
    }
    dop_tags
        .into_iter()
        .flatten()
        .collect::<std::collections::HashSet<_>>()
        .into_iter()
        .collect()
}

fn compare_and_replace_coord_opt<const N: usize, Cmp>(
    coords: &mut [Option<[usize; N]>],
    idx: &mut usize,
    coord: [usize; N],
    cmp: Cmp,
) where
    Cmp: Fn(&[usize; N], &[usize; N]) -> bool,
{
    match &mut coords[*idx] {
        Some(existing_coord) => {
            if cmp(&coord, existing_coord) {
                *existing_coord = coord;
            }
        }
        None => {
            coords[*idx] = Some(coord);
        }
    }
    *idx += 1;
}

/// Computes the Discrete Oriented Polytope (DOP) coordinates for a set of given coordinates.
///
/// Specifically, for each coordinate in the input coordinates, return only the coordinates that
/// have mimimal and maximal projections against the following vectors:
/// - Each unit vector along each dimension,
/// - Each sum or difference of two distinct unit vectors along each pair of dimensions.
///
/// The algorithm returns at most 2N + 2N(N-1) = 2N^2 tags for N-dimensional coordinates.
pub fn get_dop_coords<const N: usize>(coords: &[[usize; N]]) -> Vec<[usize; N]> {
    // Since the tag is N-dimensional...
    let mut dop_coords: Vec<Option<[usize; N]>> = vec![None; 2 * N * N];
    for &coord in coords {
        let mut idx = 0;

        // Compare against the current dop coords and update as needed.
        // Unit across dimensions:
        for i in 0..N {
            compare_and_replace_coord_opt(&mut dop_coords, &mut idx, coord, |a, b| a[i] < b[i]);
            compare_and_replace_coord_opt(&mut dop_coords, &mut idx, coord, |a, b| a[i] > b[i]);
        }
        // Sum or difference of two distinct dimensions:
        for i in 0..N {
            for j in (i + 1)..N {
                compare_and_replace_coord_opt(&mut dop_coords, &mut idx, coord, |a, b| {
                    a[i] + a[j] < b[i] + b[j]
                });
                compare_and_replace_coord_opt(&mut dop_coords, &mut idx, coord, |a, b| {
                    a[i] + a[j] > b[i] + b[j]
                });
                // Comparison against <1, -1, 0, ...> replaced with additive form to avoid
                // usize subtraction
                compare_and_replace_coord_opt(&mut dop_coords, &mut idx, coord, |a, b| {
                    a[i] + b[j] < b[i] + a[j]
                });
                compare_and_replace_coord_opt(&mut dop_coords, &mut idx, coord, |a, b| {
                    a[i] + b[j] > b[i] + a[j]
                });
            }
        }
    }
    dop_coords
        .into_iter()
        .flatten()
        .collect::<std::collections::HashSet<_>>()
        .into_iter()
        .collect()
}

#[cfg(test)]
mod tests {
    use std::collections::HashSet;

    use super::*;

    fn set_of<T: std::hash::Hash + Eq>(v: Vec<T>) -> HashSet<T> {
        v.into_iter().collect()
    }

    #[test]
    fn dop_coords_empty() {
        let coords: Vec<[usize; 2]> = vec![];
        let result = get_dop_coords::<2>(&coords);
        let result_set = set_of(result);

        let expected: HashSet<[usize; 2]> = HashSet::new();
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_coords_single_point() {
        let coords = vec![[3, 7]];
        let result = get_dop_coords::<2>(&coords);
        let result_set = set_of(result);

        let expected = set_of(vec![[3, 7]]);
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_coords_two_points_axis_extrema() {
        let coords = vec![[0, 10], [10, 0]];
        let result = get_dop_coords::<2>(&coords);
        let result_set = set_of(result);

        // Both are extrema along some axis or diagonal
        let expected = set_of(vec![[0, 10], [10, 0]]);
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_coords_square_2d() {
        // Four corners of a square
        let coords = vec![[0, 0], [0, 10], [10, 0], [10, 10]];
        let result = get_dop_coords::<2>(&coords);
        let result_set = set_of(result);

        // All corners should remain as extrema
        let expected = set_of(vec![[0, 0], [0, 10], [10, 0], [10, 10]]);
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_coords_interior_removed() {
        let coords = vec![[0, 0], [0, 10], [10, 0], [10, 10], [5, 5]];
        let result = get_dop_coords::<2>(&coords);
        let result_set = set_of(result);

        // Interior point should not be part of the DOP
        let expected = set_of(vec![[0, 0], [0, 10], [10, 0], [10, 10]]);
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_coords_duplicates() {
        let coords = vec![[1, 2], [1, 2], [1, 2]];
        let result = get_dop_coords::<2>(&coords);
        let result_set = set_of(result);

        let expected = set_of(vec![[1, 2]]);
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_tags_empty() {
        let tags: Vec<([usize; 2], usize)> = vec![];
        let result = get_dop_tags::<2>(&tags);
        let result_set = set_of(result);
        let expected: HashSet<([usize; 2], usize)> = HashSet::new();
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_tags_single_point() {
        let tags = vec![([3, 7], 5)];
        let result = get_dop_tags::<2>(&tags);
        let result_set = set_of(result);

        let expected = set_of(vec![([3, 7], 5)]);
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_tags_extrema() {
        let tags = vec![([0, 0], 0), ([10, 0], 0), ([0, 10], 0), ([10, 10], 0)];
        let result = get_dop_tags::<2>(&tags);
        let result_set = set_of(result);

        let expected = set_of(vec![([0, 0], 0), ([10, 0], 0), ([0, 10], 0), ([10, 10], 0)]);
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_tags_interior_removed() {
        let tags = vec![
            ([0, 0], 0),
            ([10, 0], 0),
            ([0, 10], 0),
            ([10, 10], 0),
            ([5, 5], 0), // interior
        ];
        let result = get_dop_tags::<2>(&tags);
        let result_set = set_of(result);

        let expected = set_of(vec![([0, 0], 0), ([10, 0], 0), ([0, 10], 0), ([10, 10], 0)]);
        assert_eq!(result_set, expected);
    }

    #[test]
    fn dop_tags_spawn_dimension_extrema() {
        let tags = vec![([5, 5], 0), ([5, 5], 10), ([5, 5], 20)];
        let result = get_dop_tags::<2>(&tags);
        let result_set = set_of(result);

        // Only min and max along spawn dimension should remain
        let expected = set_of(vec![([5, 5], 0), ([5, 5], 20)]);
        assert_eq!(result_set, expected);
    }
}