pub struct HoldModulator {
pub before: f32,
pub after: f32,
pub time: Time,
}Expand description
Hold envelope.
It looks like this: ⎽│⎺ or ⎺│⎽.
The value before time is before and the value after time is after.
Equivalent to LinearModulator with start_at being equal to end_at.
Fields§
§before: f32§after: f32§time: TimeTrait Implementations§
Auto Trait Implementations§
impl Freeze for HoldModulator
impl RefUnwindSafe for HoldModulator
impl Send for HoldModulator
impl Sync for HoldModulator
impl Unpin for HoldModulator
impl UnwindSafe for HoldModulator
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<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.