#[non_exhaustive]pub enum EaseFunction {
Show 39 variants
Linear,
QuadraticIn,
QuadraticOut,
QuadraticInOut,
CubicIn,
CubicOut,
CubicInOut,
QuarticIn,
QuarticOut,
QuarticInOut,
QuinticIn,
QuinticOut,
QuinticInOut,
SmoothStepIn,
SmoothStepOut,
SmoothStep,
SmootherStepIn,
SmootherStepOut,
SmootherStep,
SineIn,
SineOut,
SineInOut,
CircularIn,
CircularOut,
CircularInOut,
ExponentialIn,
ExponentialOut,
ExponentialInOut,
ElasticIn,
ElasticOut,
ElasticInOut,
BackIn,
BackOut,
BackInOut,
BounceIn,
BounceOut,
BounceInOut,
Steps(usize, JumpAt),
Elastic(f32),
}Expand description
Curve functions over the unit interval, commonly used for easing transitions.
EaseFunction can be used on its own to interpolate between 0.0 and 1.0.
It can also be combined with EasingCurve to interpolate between other
intervals and types, including vectors and rotations.
§Example
sample the smoothstep function at various points. This will return None
if the parameter is outside the unit interval.
let f = EaseFunction::SmoothStep;
assert_eq!(f.sample(-1.0), None);
assert_eq!(f.sample(0.0), Some(0.0));
assert_eq!(f.sample(0.5), Some(0.5));
assert_eq!(f.sample(1.0), Some(1.0));
assert_eq!(f.sample(2.0), None);sample_clamped will clamp the parameter to the unit interval, so it
always returns a value.
assert_eq!(f.sample_clamped(-1.0), 0.0);
assert_eq!(f.sample_clamped(0.0), 0.0);
assert_eq!(f.sample_clamped(0.5), 0.5);
assert_eq!(f.sample_clamped(1.0), 1.0);
assert_eq!(f.sample_clamped(2.0), 1.0);Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Linear
f(t) = t
QuadraticIn
f(t) = t²
This is the Hermite interpolator for
- f(0) = 0
- f(1) = 1
- f′(0) = 0
QuadraticOut
f(t) = -(t * (t - 2.0))
This is the Hermite interpolator for
- f(0) = 0
- f(1) = 1
- f′(1) = 0
QuadraticInOut
Behaves as EaseFunction::QuadraticIn for t < 0.5 and as EaseFunction::QuadraticOut for t >= 0.5
A quadratic has too low of a degree to be both an InOut and C²,
so consider using at least a cubic (such as EaseFunction::SmoothStep)
if you want the acceleration to be continuous.
CubicIn
f(t) = t³
This is the Hermite interpolator for
- f(0) = 0
- f(1) = 1
- f′(0) = 0
- f″(0) = 0
CubicOut
f(t) = (t - 1.0)³ + 1.0
CubicInOut
Behaves as EaseFunction::CubicIn for t < 0.5 and as EaseFunction::CubicOut for t >= 0.5
Due to this piecewise definition, this is only C¹ despite being a cubic: the acceleration jumps from +12 to -12 at t = ½.
Consider using EaseFunction::SmoothStep instead, which is also cubic,
or EaseFunction::SmootherStep if you picked this because you wanted
the acceleration at the endpoints to also be zero.
QuarticIn
f(t) = t⁴
QuarticOut
f(t) = 1.0 - (1.0 - t)⁴
QuarticInOut
Behaves as EaseFunction::QuarticIn for t < 0.5 and as EaseFunction::QuarticOut for t >= 0.5
QuinticIn
f(t) = t⁵
QuinticOut
f(t) = (t - 1.0)⁵ + 1.0
QuinticInOut
Behaves as EaseFunction::QuinticIn for t < 0.5 and as EaseFunction::QuinticOut for t >= 0.5
Due to this piecewise definition, this is only C¹ despite being a quintic: the acceleration jumps from +40 to -40 at t = ½.
Consider using EaseFunction::SmootherStep instead, which is also quintic.
SmoothStepIn
Behaves as the first half of EaseFunction::SmoothStep.
This has f″(1) = 0, unlike EaseFunction::QuadraticIn which starts similarly.
SmoothStepOut
Behaves as the second half of EaseFunction::SmoothStep.
This has f″(0) = 0, unlike EaseFunction::QuadraticOut which ends similarly.
SmoothStep
f(t) = 3t² - 2t³
This is the Hermite interpolator for
- f(0) = 0
- f(1) = 1
- f′(0) = 0
- f′(1) = 0
See also smoothstep in GLSL.
SmootherStepIn
Behaves as the first half of EaseFunction::SmootherStep.
This has f″(1) = 0, unlike EaseFunction::CubicIn which starts similarly.
SmootherStepOut
Behaves as the second half of EaseFunction::SmootherStep.
This has f″(0) = 0, unlike EaseFunction::CubicOut which ends similarly.
SmootherStep
f(t) = 6t⁵ - 15t⁴ + 10t³
This is the Hermite interpolator for
- f(0) = 0
- f(1) = 1
- f′(0) = 0
- f′(1) = 0
- f″(0) = 0
- f″(1) = 0
SineIn
f(t) = 1.0 - cos(t * π / 2.0)
SineOut
f(t) = sin(t * π / 2.0)
SineInOut
Behaves as EaseFunction::SineIn for t < 0.5 and as EaseFunction::SineOut for t >= 0.5
CircularIn
f(t) = 1.0 - sqrt(1.0 - t²)
CircularOut
f(t) = sqrt((2.0 - t) * t)
CircularInOut
Behaves as EaseFunction::CircularIn for t < 0.5 and as EaseFunction::CircularOut for t >= 0.5
ExponentialIn
f(t) ≈ 2.0^(10.0 * (t - 1.0))
The precise definition adjusts it slightly so it hits both (0, 0) and (1, 1):
f(t) = 2.0^(10.0 * t - A) - B, where A = log₂(2¹⁰-1) and B = 1/(2¹⁰-1).
ExponentialOut
f(t) ≈ 1.0 - 2.0^(-10.0 * t)
As with EaseFunction::ExponentialIn, the precise definition adjusts it slightly
so it hits both (0, 0) and (1, 1).
ExponentialInOut
Behaves as EaseFunction::ExponentialIn for t < 0.5 and as EaseFunction::ExponentialOut for t >= 0.5
ElasticIn
f(t) = -2.0^(10.0 * t - 10.0) * sin((t * 10.0 - 10.75) * 2.0 * π / 3.0)
ElasticOut
f(t) = 2.0^(-10.0 * t) * sin((t * 10.0 - 0.75) * 2.0 * π / 3.0) + 1.0
ElasticInOut
Behaves as EaseFunction::ElasticIn for t < 0.5 and as EaseFunction::ElasticOut for t >= 0.5
BackIn
f(t) = 2.70158 * t³ - 1.70158 * t²
BackOut
f(t) = 1.0 + 2.70158 * (t - 1.0)³ + 1.70158 * (t - 1.0)²
BackInOut
Behaves as EaseFunction::BackIn for t < 0.5 and as EaseFunction::BackOut for t >= 0.5
BounceIn
bouncy at the start!
BounceOut
bouncy at the end!
BounceInOut
Behaves as EaseFunction::BounceIn for t < 0.5 and as EaseFunction::BounceOut for t >= 0.5
Steps(usize, JumpAt)
n steps connecting the start and the end. Jumping behavior is customizable via
JumpAt. See JumpAt for all the options and visual examples.
Elastic(f32)
f(omega,t) = 1 - (1 - t)²(2sin(omega * t) / omega + cos(omega * t)), parametrized by omega
Trait Implementations§
Source§impl Clone for EaseFunction
impl Clone for EaseFunction
Source§fn clone(&self) -> EaseFunction
fn clone(&self) -> EaseFunction
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreimpl Copy for EaseFunction
Source§impl Curve<f32> for EaseFunction
impl Curve<f32> for EaseFunction
Source§fn sample_unchecked(&self, t: f32) -> f32
fn sample_unchecked(&self, t: f32) -> f32
t, extracting the associated value.
This is the unchecked version of sampling, which should only be used if the sample time t
is already known to lie within the curve’s domain. Read moreSource§fn sample(&self, t: f32) -> Option<T>
fn sample(&self, t: f32) -> Option<T>
t, returning None if the point is
outside of the curve’s domain.Source§fn sample_clamped(&self, t: f32) -> T
fn sample_clamped(&self, t: f32) -> T
t, clamping t to lie inside the
domain of the curve.Source§impl Debug for EaseFunction
impl Debug for EaseFunction
Source§impl<'de> Deserialize<'de> for EaseFunction
impl<'de> Deserialize<'de> for EaseFunction
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Source§impl PartialEq for EaseFunction
impl PartialEq for EaseFunction
Source§impl Serialize for EaseFunction
impl Serialize for EaseFunction
impl StructuralPartialEq for EaseFunction
Auto Trait Implementations§
impl Freeze for EaseFunction
impl RefUnwindSafe for EaseFunction
impl Send for EaseFunction
impl Sync for EaseFunction
impl Unpin for EaseFunction
impl UnsafeUnpin for EaseFunction
impl UnwindSafe for EaseFunction
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<C, T> CurveExt<T> for Cwhere
C: Curve<T>,
impl<C, T> CurveExt<T> for Cwhere
C: Curve<T>,
Source§fn sample_iter(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = Option<T>>
fn sample_iter( &self, iter: impl IntoIterator<Item = f32>, ) -> impl Iterator<Item = Option<T>>
n >= 0 points on this curve at the parameter values t_n,
returning None if the point is outside of the curve’s domain. Read moreSource§fn sample_iter_unchecked(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = T>
fn sample_iter_unchecked( &self, iter: impl IntoIterator<Item = f32>, ) -> impl Iterator<Item = T>
n >= 0 points on this curve at the parameter values t_n,
extracting the associated values. This is the unchecked version of sampling, which should
only be used if the sample times t_n are already known to lie within the curve’s domain. Read moreSource§fn sample_iter_clamped(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = T>
fn sample_iter_clamped( &self, iter: impl IntoIterator<Item = f32>, ) -> impl Iterator<Item = T>
n >= 0 points on this curve at the parameter values t_n,
clamping t_n to lie inside the domain of the curve. Read moreSource§fn map<S, F>(self, f: F) -> MapCurve<T, S, Self, F>where
F: Fn(T) -> S,
fn map<S, F>(self, f: F) -> MapCurve<T, S, Self, F>where
F: Fn(T) -> S,
f; i.e., if the
sample at time t for this curve is x, the value at time t on the new curve will be
f(x).Source§fn reparametrize<F>(self, domain: Interval, f: F) -> ReparamCurve<T, Self, F>
fn reparametrize<F>(self, domain: Interval, f: F) -> ReparamCurve<T, Self, F>
Curve whose parameter space is related to the parameter space of this curve
by f. For each time t, the sample from the new curve at time t is the sample from
this curve at time f(t). The given domain will be the domain of the new curve. The
function f is expected to take domain into self.domain(). Read moreSource§fn reparametrize_linear(
self,
domain: Interval,
) -> Result<LinearReparamCurve<T, Self>, LinearReparamError>
fn reparametrize_linear( self, domain: Interval, ) -> Result<LinearReparamCurve<T, Self>, LinearReparamError>
Source§fn reparametrize_by_curve<C>(self, other: C) -> CurveReparamCurve<T, Self, C>
fn reparametrize_by_curve<C>(self, other: C) -> CurveReparamCurve<T, Self, C>
Source§fn graph(self) -> GraphCurve<T, Self>
fn graph(self) -> GraphCurve<T, Self>
Source§fn chain<C>(self, other: C) -> Result<ChainCurve<T, Self, C>, ChainError>where
C: Curve<T>,
fn chain<C>(self, other: C) -> Result<ChainCurve<T, Self, C>, ChainError>where
C: Curve<T>,
Source§fn reverse(self) -> Result<ReverseCurve<T, Self>, ReverseError>
fn reverse(self) -> Result<ReverseCurve<T, Self>, ReverseError>
Source§fn repeat(self, count: usize) -> Result<RepeatCurve<T, Self>, RepeatError>
fn repeat(self, count: usize) -> Result<RepeatCurve<T, Self>, RepeatError>
Source§fn forever(self) -> Result<ForeverCurve<T, Self>, RepeatError>
fn forever(self) -> Result<ForeverCurve<T, Self>, RepeatError>
Source§fn ping_pong(self) -> Result<PingPongCurve<T, Self>, PingPongError>
fn ping_pong(self) -> Result<PingPongCurve<T, Self>, PingPongError>
Source§fn chain_continue<C>(
self,
other: C,
) -> Result<ContinuationCurve<T, Self, C>, ChainError>where
T: VectorSpace,
C: Curve<T>,
fn chain_continue<C>(
self,
other: C,
) -> Result<ContinuationCurve<T, Self, C>, ChainError>where
T: VectorSpace,
C: Curve<T>,
Source§fn samples(
&self,
samples: usize,
) -> Result<impl Iterator<Item = T>, ResamplingError>
fn samples( &self, samples: usize, ) -> Result<impl Iterator<Item = T>, ResamplingError>
Source§impl<C, T> CurveResampleExt<T> for C
impl<C, T> CurveResampleExt<T> for C
Source§fn resample<I>(
&self,
segments: usize,
interpolation: I,
) -> Result<SampleCurve<T, I>, ResamplingError>
fn resample<I>( &self, segments: usize, interpolation: I, ) -> Result<SampleCurve<T, I>, ResamplingError>
Curve to produce a new one that is defined by interpolation over equally
spaced sample values, using the provided interpolation to interpolate between adjacent samples.
The curve is interpolated on segments segments between samples. For example, if segments is 1,
only the start and end points of the curve are used as samples; if segments is 2, a sample at
the midpoint is taken as well, and so on. Read moreSource§fn resample_auto(
&self,
segments: usize,
) -> Result<SampleAutoCurve<T>, ResamplingError>where
T: StableInterpolate,
fn resample_auto(
&self,
segments: usize,
) -> Result<SampleAutoCurve<T>, ResamplingError>where
T: StableInterpolate,
Curve to produce a new one that is defined by interpolation over equally
spaced sample values, using automatic interpolation to interpolate between adjacent samples.
The curve is interpolated on segments segments between samples. For example, if segments is 1,
only the start and end points of the curve are used as samples; if segments is 2, a sample at
the midpoint is taken as well, and so on. Read moreSource§fn resample_uneven<I>(
&self,
sample_times: impl IntoIterator<Item = f32>,
interpolation: I,
) -> Result<UnevenSampleCurve<T, I>, ResamplingError>
fn resample_uneven<I>( &self, sample_times: impl IntoIterator<Item = f32>, interpolation: I, ) -> Result<UnevenSampleCurve<T, I>, ResamplingError>
Source§fn resample_uneven_auto(
&self,
sample_times: impl IntoIterator<Item = f32>,
) -> Result<UnevenSampleAutoCurve<T>, ResamplingError>where
T: StableInterpolate,
fn resample_uneven_auto(
&self,
sample_times: impl IntoIterator<Item = f32>,
) -> Result<UnevenSampleAutoCurve<T>, ResamplingError>where
T: StableInterpolate,
Curve to produce a new one that is defined by automatic interpolation over
samples taken at the given set of times. The given sample_times are expected to contain at least
two valid times within the curve’s domain interval. Read moreimpl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn 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>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which 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)
&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)
&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> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T, W> HasTypeWitness<W> for Twhere
W: MakeTypeWitness<Arg = T>,
T: ?Sized,
impl<T, W> HasTypeWitness<W> for Twhere
W: MakeTypeWitness<Arg = T>,
T: ?Sized,
Source§impl<T> Identity for Twhere
T: ?Sized,
impl<T> Identity for Twhere
T: ?Sized,
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> ⓘ
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> ⓘ
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> Serialize for T
impl<T> Serialize for T
fn erased_serialize(&self, serializer: &mut dyn Serializer) -> Result<(), Error>
fn do_erased_serialize( &self, serializer: &mut dyn Serializer, ) -> Result<(), ErrorImpl>
Source§impl<T> TypeData for T
impl<T> TypeData for T
Source§fn clone_type_data(&self) -> Box<dyn TypeData>
fn clone_type_data(&self) -> Box<dyn TypeData>
self.