loopflow 0.12.28

Run steps and flows with coding agents
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
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
use std::collections::BTreeMap;

use anyhow::{anyhow, bail, ensure, Result};
use clap::ValueEnum;
use serde::{Deserialize, Serialize};

use crate::engine::flow::ConcreteStep;

#[derive(Debug, Clone, Copy, PartialEq, Eq, Serialize, Deserialize, ValueEnum)]
#[serde(rename_all = "snake_case")]
pub enum FlowDecision {
    #[serde(alias = "next", alias = "complete")]
    Advance,
    #[serde(alias = "repeat", alias = "continue")]
    Iterate,
}

#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct FlowVerdict {
    pub decision: FlowDecision,
    pub summary: String,
}

#[derive(Debug, Clone, Default, PartialEq, Eq, Serialize, Deserialize)]
pub struct FlowProgress {
    /// Backward traversals by deciding occurrence, retained for the invocation.
    pub repeats: BTreeMap<String, u32>,
    pub direction: Option<String>,
    pub verdict: Option<FlowVerdict>,
}

#[derive(Debug, Clone, PartialEq, Eq)]
pub enum FlowTransition {
    Next(usize),
    Repeat(usize),
    Finished,
    Blocked(String),
}

/// Compute a transition; the caller must settle it under its execution authority.
///
/// # Errors
/// Returns an error for an invalid cursor or backward-edge definition, or a
/// repeat decision at a step without a backward edge. Errors and blocked
/// outcomes leave progress unchanged.
pub fn finish_step(
    steps: &[ConcreteStep],
    index: usize,
    progress: &mut FlowProgress,
) -> Result<FlowTransition> {
    let step = steps
        .get(index)
        .ok_or_else(|| anyhow!("flow cursor {index} is outside {} steps", steps.len()))?;
    let edge = match step {
        ConcreteStep::Skill(skill) => match &skill.repeat {
            Some(repeat) => {
                let id = skill
                    .id
                    .as_deref()
                    .filter(|id| !id.trim().is_empty())
                    .ok_or_else(|| anyhow!("repeat at step {index} requires an occurrence id"))?;
                ensure!(
                    !repeat.from.trim().is_empty(),
                    "repeat at {id:?} requires a target"
                );
                let target = steps[..index]
                    .iter()
                    .position(|step| {
                        matches!(step, ConcreteStep::Skill(target)
                            if target.id.as_deref() == Some(&repeat.from))
                    })
                    .ok_or_else(|| {
                        anyhow!(
                            "repeat from {:?} at {id:?} must name a preceding node",
                            repeat.from
                        )
                    })?;
                Some((id, target))
            }
            None => None,
        },
        ConcreteStep::Command(_) | ConcreteStep::Xor(_) => None,
    };

    let decision = match &progress.verdict {
        Some(verdict) => {
            if verdict.summary.trim().is_empty() {
                return Ok(FlowTransition::Blocked(format!(
                    "flow decision at step {index} requires evidence or direction"
                )));
            }
            verdict.decision
        }
        None if edge.is_some() => {
            return Ok(FlowTransition::Blocked(format!(
                "repeat at step {index} requires a decision"
            )));
        }
        None => FlowDecision::Advance,
    };

    match decision {
        FlowDecision::Iterate => {
            let Some((id, target)) = edge else {
                bail!("repeat decision at step {index} has no declared backward edge");
            };
            let traversals = progress.repeats.get(id).copied().unwrap_or(0);
            progress
                .repeats
                .insert(id.to_owned(), traversals.saturating_add(1));
            progress.direction = Some(
                progress
                    .verdict
                    .take()
                    .expect("a repeat decision has a verdict")
                    .summary,
            );
            Ok(FlowTransition::Repeat(target))
        }
        FlowDecision::Advance => {
            if progress.verdict.take().is_some() {
                progress.direction = None;
            }
            if index + 1 == steps.len() {
                Ok(FlowTransition::Finished)
            } else {
                Ok(FlowTransition::Next(index + 1))
            }
        }
    }
}

#[cfg(test)]
mod tests {
    use crate::engine::flow::{
        Command, ConcreteCommand, ConcreteSkill, ConcreteStep, RepeatPolicy, Skill,
    };
    use crate::engine::transitions::{
        finish_step, FlowDecision, FlowProgress, FlowTransition, FlowVerdict,
    };

    fn step(id: &str, edge: Option<&str>) -> ConcreteStep {
        ConcreteStep::Skill(ConcreteSkill {
            skill: Skill::named(id),
            id: Some(id.to_owned()),
            human: false,
            repeat: edge.map(|from| RepeatPolicy {
                from: from.to_owned(),
            }),
            flow_parents: vec![],
        })
    }

    fn decide(progress: &mut FlowProgress, decision: FlowDecision, summary: &str) {
        progress.verdict = Some(FlowVerdict {
            decision,
            summary: summary.to_owned(),
        });
    }

    #[test]
    fn ordinary_steps_advance_and_finish_without_decisions() {
        let steps = [
            step("start", None),
            ConcreteStep::Command(ConcreteCommand {
                item: Command {
                    command: "finish".to_owned(),
                    args: vec![],
                },
                flow_parents: vec![],
            }),
        ];
        let mut progress = FlowProgress {
            direction: Some("previous direction".to_owned()),
            ..FlowProgress::default()
        };
        assert_eq!(
            finish_step(&steps, 0, &mut progress).unwrap(),
            FlowTransition::Next(1)
        );
        assert_eq!(progress.direction.as_deref(), Some("previous direction"));
        assert_eq!(
            finish_step(&steps, 1, &mut progress).unwrap(),
            FlowTransition::Finished
        );
    }

    #[test]
    fn iterate_requires_an_explicit_edge_even_for_saved_human_steps() {
        for human in [false, true] {
            let mut review = step("review", None);
            if let ConcreteStep::Skill(skill) = &mut review {
                skill.human = human;
            }
            let steps = [step("work", None), review];
            let mut progress = FlowProgress::default();
            decide(&mut progress, FlowDecision::Iterate, "revise the design");
            let mut recovered: FlowProgress =
                serde_json::from_value(serde_json::to_value(&progress).unwrap()).unwrap();
            assert!(finish_step(&steps, 1, &mut recovered)
                .unwrap_err()
                .to_string()
                .contains("no declared backward edge"));
            assert_eq!(recovered, progress);
        }
    }

    #[test]
    fn repeated_visits_carry_direction_then_finish_forward() {
        let steps = [step("work", None), step("review", Some("work"))];
        let mut progress = FlowProgress::default();
        for (count, direction) in [(1, "repair behavior"), (2, "prove recovery")] {
            decide(&mut progress, FlowDecision::Iterate, direction);
            assert_eq!(
                finish_step(&steps, 1, &mut progress).unwrap(),
                FlowTransition::Repeat(0)
            );
            assert_eq!(progress.repeats["review"], count);
            assert_eq!(progress.direction.as_deref(), Some(direction));
            assert_eq!(progress.verdict, None);
            assert_eq!(
                finish_step(&steps, 0, &mut progress).unwrap(),
                FlowTransition::Next(1)
            );
            assert_eq!(progress.direction.as_deref(), Some(direction));
        }
        decide(&mut progress, FlowDecision::Advance, "all claims verified");
        assert_eq!(
            finish_step(&steps, 1, &mut progress).unwrap(),
            FlowTransition::Finished
        );
        assert_eq!(progress.repeats["review"], 2);
        assert_eq!(progress.verdict, None);
        assert_eq!(progress.direction, None);
    }

    #[test]
    fn independent_edges_keep_separate_counts() {
        let steps = [
            step("first", None),
            step("first-review", Some("first")),
            step("second", None),
            step("second-review", Some("second")),
        ];
        let mut progress = FlowProgress::default();
        for (review, target) in [(1, 0), (3, 2)] {
            decide(&mut progress, FlowDecision::Iterate, "another pass");
            assert_eq!(
                finish_step(&steps, review, &mut progress).unwrap(),
                FlowTransition::Repeat(target)
            );
            finish_step(&steps, target, &mut progress).unwrap();
            decide(&mut progress, FlowDecision::Advance, "verified");
            finish_step(&steps, review, &mut progress).unwrap();
        }
        assert_eq!(progress.repeats.len(), 2);
        assert_eq!(progress.repeats["first-review"], 1);
        assert_eq!(progress.repeats["second-review"], 1);
    }

    #[test]
    fn overlapping_edges_can_revisit_a_completed_section() {
        let steps = [
            step("start", None),
            step("middle", None),
            step("inner-review", Some("start")),
            step("outer-review", Some("middle")),
        ];
        let mut progress = FlowProgress::default();
        decide(&mut progress, FlowDecision::Iterate, "first edge");
        assert_eq!(
            finish_step(&steps, 2, &mut progress).unwrap(),
            FlowTransition::Repeat(0)
        );
        finish_step(&steps, 0, &mut progress).unwrap();
        finish_step(&steps, 1, &mut progress).unwrap();
        decide(&mut progress, FlowDecision::Advance, "first edge complete");
        assert_eq!(
            finish_step(&steps, 2, &mut progress).unwrap(),
            FlowTransition::Next(3)
        );
        decide(&mut progress, FlowDecision::Iterate, "overlapping pass");
        assert_eq!(
            finish_step(&steps, 3, &mut progress).unwrap(),
            FlowTransition::Repeat(1)
        );
        finish_step(&steps, 1, &mut progress).unwrap();
        decide(&mut progress, FlowDecision::Iterate, "revisit first edge");
        assert_eq!(
            finish_step(&steps, 2, &mut progress).unwrap(),
            FlowTransition::Repeat(0)
        );
        assert_eq!(progress.direction.as_deref(), Some("revisit first edge"));
        assert_eq!(progress.repeats["inner-review"], 2);
        assert_eq!(progress.repeats["outer-review"], 1);
    }

    #[test]
    fn missing_and_empty_decisions_preserve_all_progress() {
        let steps = [step("work", None), step("review", Some("work"))];
        let verdicts = [
            None,
            Some((FlowDecision::Advance, " \n")),
            Some((FlowDecision::Iterate, "")),
        ];
        for verdict in verdicts {
            let mut progress = FlowProgress {
                repeats: [("review".to_owned(), 1)].into(),
                direction: Some("preserved direction".to_owned()),
                verdict: verdict.map(|(decision, summary)| FlowVerdict {
                    decision,
                    summary: summary.to_owned(),
                }),
            };
            let before = progress.clone();
            let outcome = finish_step(&steps, 1, &mut progress).unwrap();
            assert!(matches!(&outcome, FlowTransition::Blocked(reason) if !reason.is_empty()));
            assert_eq!(progress, before);
        }
    }

    #[test]
    fn observed_pass_count_never_prevents_iteration() {
        for traversals in [0, 7, 100, u32::MAX] {
            let steps = [step("work", None), step("review", Some("work"))];
            let mut progress = FlowProgress {
                repeats: [("review".to_owned(), traversals)].into(),
                direction: Some("retained".to_owned()),
                verdict: None,
            };
            decide(&mut progress, FlowDecision::Iterate, "one more pass");
            assert_eq!(
                finish_step(&steps, 1, &mut progress).unwrap(),
                FlowTransition::Repeat(0)
            );
            assert_eq!(progress.direction.as_deref(), Some("one more pass"));
            assert!(progress.verdict.is_none());
        }
    }

    #[test]
    fn invalid_cursor_and_edges_are_errors_without_mutation() {
        let invalid = [
            (vec![], 0),
            (vec![step("work", None)], 1),
            (vec![step("review", Some("review"))], 0),
            (vec![step("review", Some("later")), step("later", None)], 0),
            (vec![step("work", None), step("review", Some("missing"))], 1),
            (vec![step("work", None), step("", Some("work"))], 1),
            (vec![step("work", None)], 0),
        ];
        for (steps, index) in invalid {
            let mut progress = FlowProgress::default();
            decide(&mut progress, FlowDecision::Iterate, "another pass");
            let before = progress.clone();
            assert!(finish_step(&steps, index, &mut progress).is_err());
            assert_eq!(progress, before);
        }
    }

    #[test]
    fn navigation_reads_old_names_but_writes_advance_and_iterate_only() {
        for (saved, decision, canonical) in [
            ("continue", FlowDecision::Iterate, "iterate"),
            ("repeat", FlowDecision::Iterate, "iterate"),
            ("complete", FlowDecision::Advance, "advance"),
            ("next", FlowDecision::Advance, "advance"),
        ] {
            let decoded: FlowDecision = serde_json::from_value(saved.into()).unwrap();
            assert_eq!(decoded, decision);
            assert_eq!(serde_json::to_value(decoded).unwrap(), canonical);
        }
        assert!(serde_json::from_value::<FlowDecision>("blocked".into()).is_err());
    }

    #[test]
    fn persisted_pending_decision_recovers_the_same_transition() {
        let steps = [step("work", None), step("review", Some("work"))];
        let mut original = FlowProgress {
            repeats: [("review".to_owned(), 1)].into(),
            ..FlowProgress::default()
        };
        decide(
            &mut original,
            FlowDecision::Iterate,
            "recover this direction",
        );
        let encoded = serde_json::to_value(&original).unwrap();
        assert_eq!(encoded["verdict"]["decision"], "iterate");
        let mut recovered: FlowProgress = serde_json::from_value(encoded).unwrap();
        assert_eq!(
            finish_step(&steps, 1, &mut original).unwrap(),
            finish_step(&steps, 1, &mut recovered).unwrap()
        );
        assert_eq!(original, recovered);
        assert_eq!(recovered.repeats["review"], 2);
        assert_eq!(
            recovered.direction.as_deref(),
            Some("recover this direction")
        );
    }

    #[test]
    fn saved_definition_discards_retired_limit_without_losing_the_pending_iteration() {
        let steps = [step("work", None), step("review", Some("work"))];
        let mut saved = serde_json::to_value(&steps).unwrap();
        saved[1]["Skill"]["policy"]["repeat"]["max_iterations"] = 1.into();
        let recovered: Vec<ConcreteStep> = serde_json::from_value(saved).unwrap();
        assert_eq!(recovered, steps);
        let mut progress = FlowProgress {
            repeats: [("review".into(), 20)].into(),
            direction: None,
            verdict: Some(FlowVerdict {
                decision: FlowDecision::Iterate,
                summary: "continue the saved work".into(),
            }),
        };
        assert_eq!(
            finish_step(&recovered, 1, &mut progress).unwrap(),
            FlowTransition::Repeat(0)
        );
        assert_eq!(
            progress.direction.as_deref(),
            Some("continue the saved work")
        );
        assert_eq!(progress.repeats["review"], 21);
        assert!(progress.verdict.is_none());
    }
}