Struct EgriLoop 

pub struct EgriLoop<A, P, X, E, S>
where
    A: Clone,
    P: Proposer<Artifact = A>,
    X: Executor<Artifact = A>,
    E: Evaluator<Artifact = A>,
    S: Selector,
{ /* private fields */ }

The EGRI loop engine — orchestrates the full recursive improvement cycle.

Π = (X, M, H, E, J, C, B, P, L)

while budget remains:
  m = propose(x_t, L)
  x' = apply(m, x_t)
  result = execute(x')
  outcome = evaluate(x', result)
  decision = select(outcome, best)
  apply_decision(decision, x')
  append(L, trial_record)

Implementations

impl<A, P, X, E, S> EgriLoop<A, P, X, E, S>

where A: Clone, P: Proposer<Artifact = A>, X: Executor<Artifact = A>, E: Evaluator<Artifact = A>, S: Selector,

pub fn new( proposer: P, executor: X, evaluator: E, selector: S, budget: BudgetController, ledger: Ledger, ) -> Self

pub fn baseline(&mut self, artifact: A) -> Result<Outcome>

Establish the baseline. Must be called before run.

pub fn step(&mut self) -> Result<TrialRecord>

Run a single trial. Returns the trial record.

pub fn run(&mut self) -> Result<LoopSummary>

Run the full loop until budget is exhausted or an escalation occurs.

pub fn summary(&self) -> LoopSummary

Get current loop summary.

pub fn ledger(&self) -> &Ledger

Access the ledger.

pub fn best(&self) -> Option<&A>

Access the current best artifact.

pub fn rollback(&mut self) -> Result<&A>

Rollback to last promoted state.