Struct autd3_core::stm::GainSTM
source · pub struct GainSTM<'a, T: Transducer> { /* private fields */ }Implementations§
source§impl<'a, T: Transducer> GainSTM<'a, T>
impl<'a, T: Transducer> GainSTM<'a, T>
pub fn add_gain<G: Gain<T> + 'a>(self, gain: G) -> Self
pub fn add_gain_boxed(self, gain: Box<dyn Gain<T>>) -> Self
pub fn add_gains_from_iter<I: IntoIterator<Item = Box<dyn Gain<T> + 'a>>>( self, iter: I ) -> Self
pub fn gains(&self) -> &[Box<dyn Gain<T> + 'a>]
pub fn gains_mut(&mut self) -> &mut [Box<dyn Gain<T> + 'a>]
pub fn mode(&self) -> Mode
pub fn with_props(props: STMProps) -> Self
pub fn with_props_mode(props: STMProps, mode: Mode) -> Self
source§impl<'a, T: Transducer> GainSTM<'a, T>
impl<'a, T: Transducer> GainSTM<'a, T>
pub fn new(freq: f64) -> Self
pub fn with_sampling_frequency_division(freq_div: u32) -> Self
pub fn with_sampling_frequency(freq: f64) -> Self
pub fn with_start_idx(self, idx: Option<u16>) -> Self
pub fn with_finish_idx(self, idx: Option<u16>) -> Self
pub fn start_idx(&self) -> Option<u16>
pub fn finish_idx(&self) -> Option<u16>
pub fn size(&self) -> usize
pub fn freq(&self) -> f64
pub fn sampling_frequency(&self) -> f64
pub fn sampling_frequency_division(&self) -> u32
Trait Implementations§
Auto Trait Implementations§
impl<'a, T> !RefUnwindSafe for GainSTM<'a, T>
impl<'a, T> !Send for GainSTM<'a, T>
impl<'a, T> !Sync for GainSTM<'a, T>
impl<'a, T> Unpin for GainSTM<'a, T>
impl<'a, T> !UnwindSafe for GainSTM<'a, T>
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
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.