pub struct ConfiguredAlgorithm { /* private fields */ }Expand description
A reusable algorithm with target requirement checks.
Implementations§
Source§impl ConfiguredAlgorithm
impl ConfiguredAlgorithm
Sourcepub fn target_models(&self) -> &BTreeMap<ModelId, TargetModel>
pub fn target_models(&self) -> &BTreeMap<ModelId, TargetModel>
All possible call targets, including judges, subagents and ordered alternatives. Keys are LLM target names or Decision provider model IDs, matching emitted calls. This is a lookup, not an eligible pool; execute only returned call/outcome candidates.
Sourcepub fn run_stream(
&self,
request: Request,
state: State,
) -> Result<StepStream, RunnerError>
pub fn run_stream( &self, request: Request, state: State, ) -> Result<StepStream, RunnerError>
Checks requirements before yielding model or Decision calls.
Invalid requirements or unavailable approved targets fail before the algorithm starts.
Requires Tokio. Reuse the handle to retain task requirements and algorithm-owned state;
state is per-run routing state. Answer/fallback attempts must stay within returned candidates.
Auto Trait Implementations§
impl !Freeze for ConfiguredAlgorithm
impl !RefUnwindSafe for ConfiguredAlgorithm
impl !UnwindSafe for ConfiguredAlgorithm
impl Send for ConfiguredAlgorithm
impl Sync for ConfiguredAlgorithm
impl Unpin for ConfiguredAlgorithm
impl UnsafeUnpin for ConfiguredAlgorithm
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more