Struct autd3_gain_holo::GS
source · pub struct GS<D: Directivity, B: LinAlgBackend<D>> { /* private fields */ }
Implementations§
source§impl<D: Directivity, B: LinAlgBackend<D>> GS<D, B>
impl<D: Directivity, B: LinAlgBackend<D>> GS<D, B>
source§impl<D: Directivity, B: LinAlgBackend<D>> GS<D, B>
impl<D: Directivity, B: LinAlgBackend<D>> GS<D, B>
pub const fn with_repeat(self, repeat: usize) -> Self
pub const fn with_constraint(self, constraint: EmissionConstraint) -> Self
source§impl<D: Directivity, B: LinAlgBackend<D>> GS<D, B>
impl<D: Directivity, B: LinAlgBackend<D>> GS<D, B>
Trait Implementations§
source§impl<D: Directivity, B: LinAlgBackend<D>> Datagram for GS<D, B>
impl<D: Directivity, B: LinAlgBackend<D>> Datagram for GS<D, B>
source§impl<D: Directivity, B: LinAlgBackend<D>> DatagramS for GS<D, B>
impl<D: Directivity, B: LinAlgBackend<D>> DatagramS for GS<D, B>
type G = GainOperationGenerator<GS<D, B>>
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<D: Directivity, B: LinAlgBackend<D>> Gain for GS<D, B>
impl<D: Directivity, B: LinAlgBackend<D>> Gain for GS<D, B>
fn calc(&self, geometry: &Geometry) -> GainCalcResult<'_>
fn calc_with_filter( &self, geometry: &Geometry, filter: HashMap<usize, BitVec<u32>>, ) -> GainCalcResult<'_>
fn trace(&self, _geometry: &Geometry)
fn transform<'a, D, FT, F>( f: F, ) -> Box<dyn Fn(&Device) -> Box<dyn Fn(&Transducer) -> Drive + Send + Sync> + 'a>
source§impl<D: Directivity, B: LinAlgBackend<D>> IntoCache<GS<D, B>> for GS<D, B>
impl<D: Directivity, B: LinAlgBackend<D>> IntoCache<GS<D, B>> for GS<D, B>
fn with_cache(self) -> GainCache<Self>
source§impl<D: Directivity, B: LinAlgBackend<D>> IntoTransform<GS<D, B>> for GS<D, B>
impl<D: Directivity, B: LinAlgBackend<D>> IntoTransform<GS<D, B>> for GS<D, B>
fn with_transform<GainTransformD: Into<Drive>, GainTransformFT: Fn(&Transducer, Drive) -> GainTransformD + Send + Sync, GainTransformF: Fn(&Device) -> GainTransformFT>( self, f: GainTransformF, ) -> GainTransform<Self, GainTransformD, GainTransformFT, GainTransformF>
Auto Trait Implementations§
impl<D, B> Freeze for GS<D, B>
impl<D, B> RefUnwindSafe for GS<D, B>where
D: RefUnwindSafe,
B: RefUnwindSafe,
impl<D, B> Send for GS<D, B>
impl<D, B> Sync for GS<D, B>
impl<D, B> Unpin for GS<D, B>where
D: Unpin,
impl<D, B> UnwindSafe for GS<D, B>where
B: RefUnwindSafe,
D: 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<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.