pub struct LoopBudgets {
pub max_turns: u32,
pub max_calls_per_turn: u32,
pub rejection_budget: u32,
pub rho_gate: f64,
pub declared_energy_floor: Option<f64>,
pub context_soft_limit_chars: usize,
pub recovery_budget: u32,
pub turn_deadline_secs: u64,
pub resident: ResidentReserves,
}Expand description
The loop’s finite budgets (PSP-9 system 6).
Fields§
§max_turns: u32N: maximum model turns.
max_calls_per_turn: u32M: maximum tool calls honored in one turn.
rejection_budget: u32B: Paper II’s rejection budget (descents do not consume it).
rho_gate: f64ρ_gate: the measured descent tolerance.
declared_energy_floor: Option<f64>The domain’s declared energy floor, if any.
context_soft_limit_chars: usizeProvider-neutral context projection threshold. The live route’s declared context size may lower this bound.
recovery_budget: u32Paper III’s one non-replenishing recovery pool for this node.
turn_deadline_secs: u64Per-model-call wall-clock deadline in seconds; a finite turn count alone never bounds wall time.
resident: ResidentReservesDefinition 6 reserves and working-set bounds ([context]).
Implementations§
Source§impl LoopBudgets
impl LoopBudgets
Sourcepub fn validate(&self, cadence: &VerificationCadence) -> Result<()>
pub fn validate(&self, cadence: &VerificationCadence) -> Result<()>
A configuration permitting an unbounded unchecked interval is rejected at startup (Paper II Theorem 3).
Trait Implementations§
Source§impl Clone for LoopBudgets
impl Clone for LoopBudgets
Source§fn clone(&self) -> LoopBudgets
fn clone(&self) -> LoopBudgets
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for LoopBudgets
impl RefUnwindSafe for LoopBudgets
impl Send for LoopBudgets
impl Sync for LoopBudgets
impl Unpin for LoopBudgets
impl UnsafeUnpin for LoopBudgets
impl UnwindSafe for LoopBudgets
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.