pub struct Copp2ProblemBuilder<'a, M: RobotTorque> {
pub robot: &'a Robot<M>,
pub idx_s_interval: (usize, usize),
pub a_boundary: (f64, f64),
pub objectives: &'a [CoppObjective<'a>],
}Expand description
Builder for Copp2Problem.
Fields§
§robot: &'a Robot<M>Reference to robot model defining constraints and dynamics.
idx_s_interval: (usize, usize)Closed station-index interval (idx_s_start, idx_s_final).
a_boundary: (f64, f64)Endpoint state tuple (a_start, a_final).
objectives: &'a [CoppObjective<'a>]Objectives for COPP2 optimization.
Implementations§
Source§impl<'a, M: RobotTorque> Copp2ProblemBuilder<'a, M>
impl<'a, M: RobotTorque> Copp2ProblemBuilder<'a, M>
Sourcepub fn new(
robot: &'a Robot<M>,
idx_s_interval: (usize, usize),
a_boundary: (f64, f64),
objectives: &'a [CoppObjective<'a>],
) -> Self
pub fn new( robot: &'a Robot<M>, idx_s_interval: (usize, usize), a_boundary: (f64, f64), objectives: &'a [CoppObjective<'a>], ) -> Self
Create a COPP2 builder with all required fields.
Sourcepub fn build(&self) -> Result<Copp2Problem<'a, M>, CoppError>
pub fn build(&self) -> Result<Copp2Problem<'a, M>, CoppError>
Build a validated Copp2Problem.
Auto Trait Implementations§
impl<'a, M> Freeze for Copp2ProblemBuilder<'a, M>
impl<'a, M> RefUnwindSafe for Copp2ProblemBuilder<'a, M>where
M: RefUnwindSafe,
impl<'a, M> Send for Copp2ProblemBuilder<'a, M>where
M: Sync,
impl<'a, M> Sync for Copp2ProblemBuilder<'a, M>where
M: Sync,
impl<'a, M> Unpin for Copp2ProblemBuilder<'a, M>
impl<'a, M> UnwindSafe for Copp2ProblemBuilder<'a, M>where
M: 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<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<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.