pub struct Solution<'a, T, const NX: usize, const NU: usize, const HX: usize, const HU: usize> {
pub reason: TerminationReason,
pub iterations: usize,
pub prim_residual: T,
pub dual_residual: T,
/* private fields */
}Fields§
§reason: TerminationReason§iterations: usize§prim_residual: T§dual_residual: TImplementations§
Source§impl<T: RealField + Copy, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Solution<'_, T, NX, NU, HX, HU>
impl<T: RealField + Copy, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Solution<'_, T, NX, NU, HX, HU>
Sourcepub fn x_prediction(&self, at: usize) -> SVector<T, NX>
pub fn x_prediction(&self, at: usize) -> SVector<T, NX>
Get the predicticted states for the at index
Sourcepub fn u_prediction(&self, at: usize) -> SVector<T, NU>
pub fn u_prediction(&self, at: usize) -> SVector<T, NU>
Get the predicticted input for the at index
Sourcepub fn x_prediction_full(&self) -> SMatrix<T, NX, HX>
pub fn x_prediction_full(&self) -> SMatrix<T, NX, HX>
Get the predictiction of states for this solution
Sourcepub fn u_prediction_full(&self) -> SMatrix<T, NU, HU>
pub fn u_prediction_full(&self) -> SMatrix<T, NU, HU>
Get the predictiction of inputs for this solution
Auto Trait Implementations§
impl<'a, T, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Freeze for Solution<'a, T, NX, NU, HX, HU>where
T: Freeze,
impl<'a, T, const NX: usize, const NU: usize, const HX: usize, const HU: usize> RefUnwindSafe for Solution<'a, T, NX, NU, HX, HU>where
T: RefUnwindSafe,
impl<'a, T, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Send for Solution<'a, T, NX, NU, HX, HU>
impl<'a, T, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Sync for Solution<'a, T, NX, NU, HX, HU>where
T: Sync,
impl<'a, T, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Unpin for Solution<'a, T, NX, NU, HX, HU>where
T: Unpin,
impl<'a, T, const NX: usize, const NU: usize, const HX: usize, const HU: usize> UnwindSafe for Solution<'a, T, NX, NU, HX, HU>where
T: UnwindSafe + RefUnwindSafe,
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<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>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.