pub struct ContinuationPath { /* private fields */ }Expand description
Coupled continuation path. Owns the three endpoint legs and the scalar path
parameter s, and drives the K≥2 SAE joint fit down the coupled
homotopy. Entry is always the legal heavy endpoint at s = 1, and
only a solved literal target can produce arrival.
ContinuationPath::step transactionally installs and evaluates one exact
waypoint at a time. The path itself owns the accepted warm trajectory.
Implementations§
Source§impl ContinuationPath
impl ContinuationPath
Sourcepub fn heavy_entry_for_rho(
rho_target: Array1<f64>,
bounds_upper: Array1<f64>,
scalars: ContinuationScalarContract,
) -> Result<Self, EstimationError>
pub fn heavy_entry_for_rho( rho_target: Array1<f64>, bounds_upper: Array1<f64>, scalars: ContinuationScalarContract, ) -> Result<Self, EstimationError>
Build from a concrete log-ρ target and the objective’s legal upper box. The upper box is the heavy entry endpoint; the scalar endpoints come from the typed objective contract. Every endpoint must be finite, and each upper entry must be at least its target.
Sourcepub fn current_scalar_targets(&self) -> ContinuationScalarState
pub fn current_scalar_targets(&self) -> ContinuationScalarState
The scalar leg targets (τ, isometry weight) at the current s. The
wiring agent installs these before the inner solve at this waypoint.
Trait Implementations§
Source§impl Clone for ContinuationPath
impl Clone for ContinuationPath
Source§fn clone(&self) -> ContinuationPath
fn clone(&self) -> ContinuationPath
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreAuto Trait Implementations§
impl !RefUnwindSafe for ContinuationPath
impl !UnwindSafe for ContinuationPath
impl Freeze for ContinuationPath
impl Send for ContinuationPath
impl Sync for ContinuationPath
impl Unpin for ContinuationPath
impl UnsafeUnpin for ContinuationPath
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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>
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>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.