Skip to main content

GrowthReplay

Struct GrowthReplay 

pub struct GrowthReplay { /* private fields */ }
Expand description

The growth rule replayed from the seed.

Derived by replay, never stored, and advanced incrementally per two cache rules (evaluate every decision point in an interval; roll back and re-advance when a gap fills below the watermark). Pure over the finished prefix it has consumed: advancing twice over the same view is a no-op, and a cold replay of the same trials produces the identical state (warm == cold, unconditionally).

Implementations§

§

impl GrowthReplay

pub fn new(policy: &SpacePolicy, directions: &[Direction]) -> Self

A replay at the seed: nothing consumed, nothing grown.

pub fn live(&self, name: &str) -> Option<&Distribution>

The live distribution for name, if the policy declares it.

pub fn braked(&self, name: &str, side: Side) -> Option<GrowthReason>

The brake that froze side of name, if any — atune doctor’s GrowthStopped source, and BoundaryPressure’s suppression test.

pub fn decisions(&self) -> &[GrowthDecision]

Every decision taken so far, oldest first.

pub fn covers(&self, policy: &SpacePolicy) -> bool

true when this replay was built over exactly policy’s parameter set — the staleness test for a cached replay whose policy has since gained a define-by-run registration.

pub fn grew(&self) -> bool

true if any bound currently differs from its seed.

pub fn advance(&mut self, view: &StudyView)

Advances over every finished trial the view holds that this replay has not consumed, evaluating the rule at each decision point in order (cache rule 1). A finished trial arriving below the watermark — a filled gap, a resumed Paused trial — resets the replay to the seed and re-consumes everything (cache rule 2), which is what makes warm == cold unconditional. Not rare: with several workers, trials finish out of number order, and each that lands below the watermark resets (N59, open).

Incremental: the gap test compares the view’s finished count through the watermark with the consumed count in O(log n), and only the trials numbered above the watermark are visited, so an advance costs the new and still-running trials above the watermark rather than a rescan of the whole view.

Trait Implementations§

§

impl Clone for GrowthReplay

§

fn clone(&self) -> GrowthReplay

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Debug for GrowthReplay

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
§

impl PartialEq for GrowthReplay

§

fn eq(&self, other: &GrowthReplay) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
§

impl StructuralPartialEq for GrowthReplay

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more