pub struct Group<K, FK, F>where
K: Hash + Eq + Clone + Debug + Send + Sync,
FK: Fn(&Transducer) -> Option<K> + Send + Sync,
F: Fn(&Device) -> FK + Send + Sync,{ /* private fields */ }
Implementations§
source§impl<K, FK, F> Group<K, FK, F>
impl<K, FK, F> Group<K, FK, F>
pub const fn with_parallel(self, parallel: bool) -> Group<K, FK, F>
Trait Implementations§
source§impl<K, FK, F> Datagram for Group<K, FK, F>
impl<K, FK, F> Datagram for Group<K, FK, F>
type G = GainOperationGenerator<Group<K, FK, F>>
fn operation_generator( self, geometry: &Geometry, ) -> Result<<Group<K, FK, F> as Datagram>::G, AUTDInternalError>
fn trace(&self, geometry: &Geometry)
fn timeout(&self) -> Option<Duration>
fn parallel_threshold(&self) -> Option<usize>
source§impl<K, FK, F> DatagramS for Group<K, FK, F>
impl<K, FK, F> DatagramS for Group<K, FK, F>
type G = GainOperationGenerator<Group<K, FK, F>>
fn operation_generator_with_segment( self, geometry: &Geometry, segment: Segment, transition: bool, ) -> Result<<Group<K, FK, F> as DatagramS>::G, AUTDInternalError>
fn trace(&self, geometry: &Geometry)
fn timeout(&self) -> Option<Duration>
fn parallel_threshold(&self) -> Option<usize>
source§impl<K, FK, F> Gain for Group<K, FK, F>
impl<K, FK, F> Gain for Group<K, FK, F>
fn calc( &self, geometry: &Geometry, ) -> Result<Box<dyn Fn(&Device) -> Box<dyn Fn(&Transducer) -> Drive + Send + Sync> + '_>, AUTDInternalError>
fn trace(&self, geometry: &Geometry)
fn calc_with_filter<'a>( &'a self, geometry: &Geometry, _filter: HashMap<usize, BitVec>, ) -> Result<Box<dyn Fn(&Device) -> Box<dyn Fn(&Transducer) -> Drive + Send + Sync> + 'a>, AUTDInternalError>
fn transform<'a, D, FT, F>( f: F, ) -> Box<dyn Fn(&Device) -> Box<dyn Fn(&Transducer) -> Drive + Send + Sync> + 'a>
source§impl<K, FK, F> IntoCache<Group<K, FK, F>> for Group<K, FK, F>
impl<K, FK, F> IntoCache<Group<K, FK, F>> for Group<K, FK, F>
fn with_cache(self) -> Cache<Group<K, FK, F>>
source§impl<K, FK, F> IntoTransform<Group<K, FK, F>> for Group<K, FK, F>
impl<K, FK, F> IntoTransform<Group<K, FK, F>> for Group<K, FK, F>
fn with_transform<GainTransformD, GainTransformFT, GainTransformF>( self, f: GainTransformF, ) -> Transform<Group<K, FK, F>, GainTransformD, GainTransformFT, GainTransformF>
Auto Trait Implementations§
impl<K, FK, F> Freeze for Group<K, FK, F>where
F: Freeze,
impl<K, FK, F> !RefUnwindSafe for Group<K, FK, F>
impl<K, FK, F> Send for Group<K, FK, F>
impl<K, FK, F> Sync for Group<K, FK, F>
impl<K, FK, F> Unpin for Group<K, FK, F>
impl<K, FK, F> !UnwindSafe for Group<K, FK, F>
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<D> IntoDatagramWithParallelThreshold<D> for Dwhere
D: Datagram,
impl<D> IntoDatagramWithParallelThreshold<D> for Dwhere
D: Datagram,
fn with_parallel_threshold( self, threshold: 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: bool, ) -> DatagramWithSegment<D>
source§impl<D> IntoDatagramWithTimeout<D> for Dwhere
D: Datagram,
impl<D> IntoDatagramWithTimeout<D> for Dwhere
D: Datagram,
fn with_timeout(self, timeout: 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.