pub struct ProgressMapperFn<T>(pub fn(T) -> T);Expand description
A function pointer container that can map a progress value to a LERP factor.
Tuple Fields§
§0: fn(T) -> TTrait Implementations§
Source§impl<T> Clone for ProgressMapperFn<T>where
T: Clone,
impl<T> Clone for ProgressMapperFn<T>where
T: Clone,
Source§fn clone(&self) -> ProgressMapperFn<T>
fn clone(&self) -> ProgressMapperFn<T>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<T> Debug for ProgressMapperFn<T>where
T: Debug,
impl<T> Debug for ProgressMapperFn<T>where
T: Debug,
Source§impl<T> Default for ProgressMapperFn<T>
The default value for a ProgressMapperFn is the identity function.
impl<T> Default for ProgressMapperFn<T>
The default value for a ProgressMapperFn is the identity function.
Source§fn default() -> ProgressMapperFn<T>
fn default() -> ProgressMapperFn<T>
Returns the “default value” for a type. Read more
Source§impl<T> From<fn(T) -> T> for ProgressMapperFn<T>
impl<T> From<fn(T) -> T> for ProgressMapperFn<T>
Source§fn from(f: fn(T) -> T) -> ProgressMapperFn<T>
fn from(f: fn(T) -> T) -> ProgressMapperFn<T>
Converts to this type from the input type.
Source§impl<T> Hash for ProgressMapperFn<T>where
T: Hash,
impl<T> Hash for ProgressMapperFn<T>where
T: Hash,
Source§impl<Progress> ProgressMapper<Progress> for ProgressMapperFn<Progress>
impl<Progress> ProgressMapper<Progress> for ProgressMapperFn<Progress>
Source§fn map_progress(&self, progress: Progress) -> Progress
fn map_progress(&self, progress: Progress) -> Progress
Maps an unconstrained progress value to a LERP factor. Read more
impl<T> Copy for ProgressMapperFn<T>where
T: Copy,
Auto Trait Implementations§
impl<T> Freeze for ProgressMapperFn<T>
impl<T> RefUnwindSafe for ProgressMapperFn<T>
impl<T> Send for ProgressMapperFn<T>
impl<T> Sync for ProgressMapperFn<T>
impl<T> Unpin for ProgressMapperFn<T>
impl<T> UnsafeUnpin for ProgressMapperFn<T>
impl<T> UnwindSafe for ProgressMapperFn<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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
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<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
Source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
Read this value from the supplied reader. Same as
ReadEndian::read_from_little_endian().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.