pub struct BoxedGain { /* private fields */ }Trait Implementations§
source§impl DatagramS for BoxedGain
impl DatagramS for BoxedGain
type G = GainOperationGenerator<<BoxedGain as Gain>::G>
fn operation_generator_with_segment( self, geometry: &Geometry, segment: Segment, transition: Option<TransitionMode>, ) -> Result<Self::G, AUTDInternalError>
fn timeout(&self) -> Option<Duration>
fn parallel_threshold(&self) -> Option<usize>
Auto Trait Implementations§
impl Freeze for BoxedGain
impl !RefUnwindSafe for BoxedGain
impl !Send for BoxedGain
impl !Sync for BoxedGain
impl Unpin for BoxedGain
impl !UnwindSafe for BoxedGain
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> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<G> IntoBoxedGain for Gwhere
G: Gain + 'static,
impl<G> IntoBoxedGain for Gwhere
G: Gain + 'static,
fn into_boxed(self) -> BoxedGain
source§impl<D> IntoDatagramWithParallelThreshold<D> for Dwhere
D: Datagram,
impl<D> IntoDatagramWithParallelThreshold<D> for Dwhere
D: Datagram,
fn with_parallel_threshold( self, threshold: Option<usize>, ) -> DatagramWithParallelThreshold<D>
source§impl<D> IntoDatagramWithSegment<D> for Dwhere
D: DatagramS,
impl<D> IntoDatagramWithSegment<D> for Dwhere
D: DatagramS,
fn with_segment( self, segment: Segment, transition_mode: Option<TransitionMode>, ) -> DatagramWithSegment<D>
source§impl<D> IntoDatagramWithTimeout<D> for Dwhere
D: Datagram,
impl<D> IntoDatagramWithTimeout<D> for Dwhere
D: Datagram,
fn with_timeout(self, timeout: Option<Duration>) -> DatagramWithTimeout<D>
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 moresource§impl<T> Pointable for T
impl<T> Pointable for T
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.