pub struct Solver<T, POLICY: Policy<T, NX, NU>, const NX: usize, const NU: usize, const HX: usize, const HU: usize> {
pub config: Config<T>,
/* private fields */
}Fields§
§config: Config<T>Implementations§
Source§impl<T, C: Policy<T, NX, NU>, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Solver<T, C, NX, NU, HX, HU>
impl<T, C: Policy<T, NX, NU>, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Solver<T, C, NX, NU, HX, HU>
pub fn new(A: SMatrix<T, NX, NX>, B: SMatrix<T, NX, NU>, policy: C) -> Self
pub fn with_sys(self, sys: LtiFn<T, NX, NU>) -> Self
pub fn initial_condition( &mut self, x_now: SVector<T, NX>, ) -> Problem<'_, T, C, NX, NU, HX, HU>
pub fn solve<'a>( &'a mut self, x_now: SVector<T, NX>, x_ref: Option<&'a SMatrix<T, NX, HX>>, u_ref: Option<&'a SMatrix<T, NU, HU>>, x_con: Option<&mut [Constraint<T, impl ProjectMulti<T, NX, HX>, NX, HX>]>, u_con: Option<&mut [Constraint<T, impl ProjectMulti<T, NU, HU>, NU, HU>]>, ) -> Solution<'a, T, NX, NU, HX, HU>
Trait Implementations§
Auto Trait Implementations§
impl<T, POLICY, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Freeze for Solver<T, POLICY, NX, NU, HX, HU>
impl<T, POLICY, const NX: usize, const NU: usize, const HX: usize, const HU: usize> RefUnwindSafe for Solver<T, POLICY, NX, NU, HX, HU>where
POLICY: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, POLICY, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Send for Solver<T, POLICY, NX, NU, HX, HU>
impl<T, POLICY, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Sync for Solver<T, POLICY, NX, NU, HX, HU>
impl<T, POLICY, const NX: usize, const NU: usize, const HX: usize, const HU: usize> Unpin for Solver<T, POLICY, NX, NU, HX, HU>
impl<T, POLICY, const NX: usize, const NU: usize, const HX: usize, const HU: usize> UnwindSafe for Solver<T, POLICY, NX, NU, HX, HU>where
POLICY: UnwindSafe,
T: UnwindSafe,
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.