Struct Runner 

pub struct Runner {
    pub state: RunState,
    /* private fields */
}

Drives one run.

Fields

state: RunState

Run state; public so the CLI can report on it.

Implementations

impl Runner

pub async fn start( repo: &Path, instruction: String, config: Config, ) -> Result<Self>

Start a fresh run against repo.

pub async fn review(repo: &Path, branch: &str, config: Config) -> Result<Self>

Open a review-only run against work that already exists on branch.

The expensive half of the graph is the implement wave — measured at 111 and 134 internal tool-loop turns on this repository, against a handful for a judge or a reviewer. The cheap half is worth running on hand-written work too, and there was no way to reach it.

No new state and no schema change are needed: a run with one viable candidate and a tally already decided degrades execute to exactly review → gate → merge, because judge skips a single-candidate field, deliberate has fewer than two first choices to reconcile, vote returns early, tally is already present and fold_losers has no losers. Resuming such a run therefore does the right thing as well.

pub fn resume(id: &str) -> Result<Self>

Reopen an existing run.

pub async fn execute(&mut self) -> Result<()>

Walk the graph to a terminal state, skipping nodes already recorded.

pub fn on_pause(&mut self, pause: Pause)

Hand the runner a pause to watch.