Struct autd3_driver::datagram::GainCache
source · pub struct GainCache<G: Gain> { /* private fields */ }Implementations§
Trait Implementations§
source§impl<G: Gain> DatagramS for Cache<G>
impl<G: Gain> DatagramS for Cache<G>
type G = GainOperationGenerator<Cache<G>>
fn operation_generator_with_segment( self, geometry: &Geometry, segment: Segment, transition: bool, ) -> Result<Self::G, AUTDInternalError>
fn trace(&self, geometry: &Geometry)
fn timeout(&self) -> Option<Duration>
fn parallel_threshold(&self) -> Option<usize>
source§impl<G: Gain> Gain for Cache<G>
impl<G: Gain> Gain for Cache<G>
fn calc(&self, geometry: &Geometry) -> GainCalcResult<'_>
fn trace(&self, geometry: &Geometry)
fn calc_with_filter<'a>( &'a self, geometry: &Geometry, _filter: HashMap<usize, BitVec<u32>>, ) -> GainCalcResult<'a>
fn transform<'a, D: Into<Drive>, FT: Fn(&Transducer) -> D + Sync + Send + 'static, F: Fn(&Device) -> FT + 'a>(
f: F,
) -> Box<dyn Fn(&Device) -> Box<dyn Fn(&Transducer) -> Drive + Sync + Send> + 'a>where
Self: Sized,
Auto Trait Implementations§
impl<G> Freeze for Cache<G>where
G: Freeze,
impl<G> !RefUnwindSafe for Cache<G>
impl<G> !Send for Cache<G>
impl<G> !Sync for Cache<G>
impl<G> Unpin for Cache<G>where
G: Unpin,
impl<G> !UnwindSafe for Cache<G>
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit)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.