pub struct GainSTM<T: GainSTMGenerator, C> {
pub gains: T,
pub config: C,
pub option: GainSTMOption,
}Fields§
§gains: TThe sequence of Gains.
config: CThe STM configuration.
option: GainSTMOptionThe STM option.
Implementations§
Source§impl<T: GainSTMGenerator, C> GainSTM<T, C>
impl<T: GainSTMGenerator, C> GainSTM<T, C>
Sourcepub const fn new(gains: T, config: C, option: GainSTMOption) -> Self
pub const fn new(gains: T, config: C, option: GainSTMOption) -> Self
Create a new GainSTM.
Source§impl<T: GainSTMGenerator> GainSTM<T, Freq<f32>>
impl<T: GainSTMGenerator> GainSTM<T, Freq<f32>>
Sourcepub fn into_nearest(self) -> GainSTM<T, FreqNearest>
pub fn into_nearest(self) -> GainSTM<T, FreqNearest>
Convert to STM with the closest frequency among the possible frequencies.
Source§impl<T: GainSTMGenerator> GainSTM<T, Duration>
impl<T: GainSTMGenerator> GainSTM<T, Duration>
Sourcepub fn into_nearest(self) -> GainSTM<T, PeriodNearest>
pub fn into_nearest(self) -> GainSTM<T, PeriodNearest>
Convert to STM with the closest frequency among the possible period.
Source§impl<T: GainSTMGenerator, C: Into<STMConfig> + Copy> GainSTM<T, C>
impl<T: GainSTMGenerator, C: Into<STMConfig> + Copy> GainSTM<T, C>
Sourcepub fn sampling_config(&self) -> Result<SamplingConfig, AUTDDriverError>
pub fn sampling_config(&self) -> Result<SamplingConfig, AUTDDriverError>
The sampling configuration of the STM.
Trait Implementations§
Source§impl<T: GainSTMGenerator, C: Into<STMConfig> + Debug> DatagramL for GainSTM<T, C>
impl<T: GainSTMGenerator, C: Into<STMConfig> + Debug> DatagramL for GainSTM<T, C>
Source§fn option(&self) -> DatagramOption
fn option(&self) -> DatagramOption
Returns the option of the datagram.
Source§impl<T: GainSTMGenerator, C> Deref for GainSTM<T, C>
impl<T: GainSTMGenerator, C> Deref for GainSTM<T, C>
Auto Trait Implementations§
impl<T, C> Freeze for GainSTM<T, C>
impl<T, C> RefUnwindSafe for GainSTM<T, C>where
T: RefUnwindSafe,
C: RefUnwindSafe,
impl<T, C> Send for GainSTM<T, C>
impl<T, C> Sync for GainSTM<T, C>
impl<T, C> Unpin for GainSTM<T, C>
impl<T, C> UnwindSafe for GainSTM<T, C>where
T: UnwindSafe,
C: 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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<D> DatagramS for Dwhere
D: DatagramL,
impl<D> DatagramS for Dwhere
D: DatagramL,
type G = <D as DatagramL>::G
type Error = <D as DatagramL>::Error
fn operation_generator_with_segment( self, geometry: &Geometry, parallel: bool, segment: Segment, transition_mode: Option<TransitionMode>, ) -> Result<<D as DatagramS>::G, <D as DatagramS>::Error>
Source§fn option(&self) -> DatagramOption
fn option(&self) -> DatagramOption
Returns the option of the datagram.
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<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.