pub struct LinearModulator {
pub start: f32,
pub end: f32,
pub start_at: Time,
pub end_at: Time,
}Expand description
Linear (ramp up or down) envelope.
It looks like this: ⎽╱⎺ or ⎺╲⎽.
The value before start_at is start, the value after end_at is end,
and the value between start_at and end_at changes linearly from start to end.
Fields§
§start: f32§end: f32§start_at: Time§end_at: TimeTrait Implementations§
Auto Trait Implementations§
impl Freeze for LinearModulator
impl RefUnwindSafe for LinearModulator
impl Send for LinearModulator
impl Sync for LinearModulator
impl Unpin for LinearModulator
impl UnwindSafe for LinearModulator
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.