Struct tween::FixedTweener

pub struct FixedTweener<Value, Time, T: ?Sized> {
    pub delta: Time,
    pub tweener: Tweener<Value, Time, T>,
}

A FixedTweener is a Tweener wrapper which implements Iterator. To do this, it takes a “fixed” delta on its constructor.

Basic Example

// we provide a tweener which goes from 0 up to 4, in 4 ticks,
// and we progress it by 1 each time we call it.
let (start, end) = (0, 4);
let duration = 4;
let delta = 1;
let mut fixed_tweener = FixedTweener::linear(start, end, duration, delta);
assert_eq!(fixed_tweener.next().unwrap(), 1);
assert_eq!(fixed_tweener.next().unwrap(), 2);
assert_eq!(fixed_tweener.next().unwrap(), 3);
assert_eq!(fixed_tweener.next().unwrap(), 4);
assert_eq!(fixed_tweener.next(), None);

Clamping

FixedTweener, just Tweener, clamps its output, but in its Iterator implementation, it returns None when it would otherwise clamp!

Therefore, in all cases where a fixed_tweener.is_finished() is true, fixed_tweener.next().is_none as well.

If you don’t want this behavior, you can instead use move_next(), which clamps.

// a single iteration length tween
let mut fixed_tweener = FixedTweener::linear(0, 1, 1, 1);

// move it to its end...
assert_eq!(fixed_tweener.next().unwrap(), 1);

// and now `.next` returns `None`!
assert!(fixed_tweener.next().is_none());
assert!(fixed_tweener.is_finished());

// but you can still use `move_next`. Note how it returns `Value`, not `Option<Value>`
assert_eq!(fixed_tweener.move_next(), 1);

Fields

delta: Time

The delta upon which we move.

tweener: Tweener<Value, Time, T>

The internal tweener that we’ve fixed a Delta to.

Implementations

impl<Value, Time, T> FixedTweener<Value, Time, T>

where Value: TweenValue, Time: TweenTime, T: Tween<Value>,

pub fn new( start: Value, end: Value, duration: Time, tween: T, delta: Time ) -> Self

Creates a new FixedTweener out of a Tween, start and end TweenValue, TweenTime duration, and TweenTime delta.

pub fn new_at( start: Value, end: Value, duration: Time, tween: T, current_time: Time, delta: Time ) -> Self

Creates a new FixedTweener out of a Tween, start and end TweenValue, TweenTime duration, and TweenTime current time.

Use this to have “negative” times in Tweeners. This can be useful for starting tweens “with a delay”. See the example in examples/delayed_tween.rs

pub fn from_tweener(tweener: Tweener<Value, Time, T>, delta: Time) -> Self

Creates a new FixedTweener, and takes in the delta time it will use per tick.

pub fn move_next(&mut self) -> Value

This is the exact same as called next via Iterator except that it doesn’t require a useless .unwrap() because it clamps instead.

impl<Value, Time> FixedTweener<Value, Time, Linear>

where Time: TweenTime, Value: TweenValue,

pub fn linear( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, Linear>

Creates a new Linear Tweener.

pub fn linear_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, Linear>

Creates a new Linear Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, CubicIn>

where Time: TweenTime, Value: TweenValue,

pub fn cubic_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, CubicIn>

Creates a new CubicIn Tweener.

pub fn cubic_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, CubicIn>

Creates a new CubicIn Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, CubicOut>

where Time: TweenTime, Value: TweenValue,

pub fn cubic_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, CubicOut>

Creates a new CubicOut Tweener.

pub fn cubic_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, CubicOut>

Creates a new CubicOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, CubicInOut>

where Time: TweenTime, Value: TweenValue,

pub fn cubic_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, CubicInOut>

Creates a new CubicInOut Tweener.

pub fn cubic_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, CubicInOut>

Creates a new CubicInOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, SineIn>

where Time: TweenTime, Value: TweenValue,

pub fn sine_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, SineIn>

Creates a new SineIn Tweener.

pub fn sine_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, SineIn>

Creates a new SineIn Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, SineOut>

where Time: TweenTime, Value: TweenValue,

pub fn sine_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, SineOut>

Creates a new SineOut Tweener.

pub fn sine_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, SineOut>

Creates a new SineOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, SineInOut>

where Time: TweenTime, Value: TweenValue,

pub fn sine_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, SineInOut>

Creates a new SineOut Tweener.

pub fn sine_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, SineInOut>

Creates a new SineOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, QuintIn>

where Time: TweenTime, Value: TweenValue,

pub fn quint_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, QuintIn>

Creates a new QuintInOut Tweener.

pub fn quint_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, QuintIn>

Creates a new QuintInOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, QuintOut>

where Time: TweenTime, Value: TweenValue,

pub fn quint_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, QuintOut>

Creates a new QuintOut Tweener.

pub fn quint_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, QuintOut>

Creates a new QuintOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, QuintInOut>

where Time: TweenTime, Value: TweenValue,

pub fn quint_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, QuintInOut>

Creates a new QuintInOut Tweener.

pub fn quint_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, QuintInOut>

Creates a new QuintInOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, QuadIn>

where Time: TweenTime, Value: TweenValue,

pub fn quad_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, QuadIn>

Creates a new QuadIn Tweener.

pub fn quad_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, QuadIn>

Creates a new QuadIn Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, QuadOut>

where Time: TweenTime, Value: TweenValue,

pub fn quad_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, QuadOut>

Creates a new QuadOut Tweener.

pub fn quad_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, QuadOut>

Creates a new QuadOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, QuadInOut>

where Time: TweenTime, Value: TweenValue,

pub fn quad_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, QuadInOut>

Creates a new QuadInOut Tweener.

pub fn quad_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, QuadInOut>

Creates a new QuadInOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, QuartIn>

where Time: TweenTime, Value: TweenValue,

pub fn quart_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, QuartIn>

Creates a new QuartIn Tweener.

pub fn quart_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, QuartIn>

Creates a new QuartIn Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, QuartOut>

where Time: TweenTime, Value: TweenValue,

pub fn quart_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, QuartOut>

Creates a new QuartOut Tweener.

pub fn quart_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, QuartOut>

Creates a new QuartOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, QuartInOut>

where Time: TweenTime, Value: TweenValue,

pub fn quart_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, QuartInOut>

Creates a new QuartInOut Tweener.

pub fn quart_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, QuartInOut>

Creates a new QuartInOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, ExpoIn>

where Time: TweenTime, Value: TweenValue,

pub fn expo_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, ExpoIn>

Creates a new ExpoIn Tweener.

pub fn expo_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, ExpoIn>

Creates a new ExpoIn Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, ExpoOut>

where Time: TweenTime, Value: TweenValue,

pub fn expo_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, ExpoOut>

Creates a new ExpoOut Tweener.

pub fn expo_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, ExpoOut>

Creates a new ExpoOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, ExpoInOut>

where Time: TweenTime, Value: TweenValue,

pub fn expo_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, ExpoInOut>

Creates a new ExpoInOut Tweener.

pub fn expo_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, ExpoInOut>

Creates a new ExpoInOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, CircIn>

where Time: TweenTime, Value: TweenValue,

pub fn circ_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, CircIn>

Creates a new CircIn Tweener.

pub fn circ_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, CircIn>

Creates a new CircIn Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, CircOut>

where Time: TweenTime, Value: TweenValue,

pub fn circ_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, CircOut>

Creates a new CircOut Tweener.

pub fn circ_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, CircOut>

Creates a new CircOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, CircInOut>

where Time: TweenTime, Value: TweenValue,

pub fn circ_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, CircInOut>

Creates a new CircInOut Tweener.

pub fn circ_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, CircInOut>

Creates a new CircInOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, BackIn>

where Time: TweenTime, Value: TweenValue,

pub fn back_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, BackIn>

Creates a new BackIn Tweener.

pub fn back_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, BackIn>

Creates a new BackIn Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, BackOut>

where Time: TweenTime, Value: TweenValue,

pub fn back_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, BackOut>

Creates a new BackOut Tweener.

pub fn back_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, BackOut>

Creates a new BackOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, BackInOut>

where Time: TweenTime, Value: TweenValue,

pub fn back_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, BackInOut>

Creates a new BackInOut Tweener.

pub fn back_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, BackInOut>

Creates a new BackInOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, ElasticIn>

where Time: TweenTime, Value: TweenValue,

pub fn elastic_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, ElasticIn>

Creates a new ElasticIn Tweener.

pub fn elastic_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, ElasticIn>

Creates a new ElasticIn Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, ElasticOut>

where Time: TweenTime, Value: TweenValue,

pub fn elastic_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, ElasticOut>

Creates a new ElasticOut Tweener.

pub fn elastic_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, ElasticOut>

Creates a new ElasticOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, ElasticInOut>

where Time: TweenTime, Value: TweenValue,

pub fn elastic_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, ElasticInOut>

Creates a new ElasticInOut Tweener.

pub fn elastic_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, ElasticInOut>

Creates a new ElasticInOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, BounceIn>

where Time: TweenTime, Value: TweenValue,

pub fn bounce_in( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, BounceIn>

Creates a new BounceIn Tweener.

pub fn bounce_in_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, BounceIn>

Creates a new BounceIn Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, BounceOut>

where Time: TweenTime, Value: TweenValue,

pub fn bounce_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, BounceOut>

Creates a new BounceOut Tweener.

pub fn bounce_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, BounceOut>

Creates a new BounceOut Tweener at the given time.

impl<Value, Time> FixedTweener<Value, Time, BounceInOut>

where Time: TweenTime, Value: TweenValue,

pub fn bounce_in_out( start: Value, end: Value, duration: Time, delta: Time ) -> FixedTweener<Value, Time, BounceInOut>

Creates a new BounceInOut Tweener.

pub fn bounce_in_out_at( start: Value, end: Value, duration: Time, current_time: Time ) -> Tweener<Value, Time, BounceInOut>

Creates a new BounceInOut Tweener at the given time.

Methods from Deref<Target = Tweener<Value, Time, T>>

pub fn move_to(&mut self, position: Time) -> Value

Moves the tween to a given Time. If this Tween previously was outside 0..=1 in parametric (percentage) space, ie. outside the duration of the tween or in negative time, this can move it back into bounds.

Giving TweenTime::ZERO to this function effectively resets a tweener.

Giving a negative time or a time beyond duration will move the tween there, but we will always clamp the output time.

pub fn move_by(&mut self, delta: Time) -> Value

Drives the Tweener forward X steps in time.

If an input higher than the tween’s duration is given, you will receive the max value of the tween.

pub fn initial_value(&self) -> Value

The initial value a tween was set to start at.

pub fn final_value(&self) -> Value

The final value the tween should end at.

pub fn is_started(&self) -> bool

Returns true is the Tweener’s current_time is greater than or equal to 0. Only negative times will return false.

Note that for tweens without bounds (infinite tweens like Looper), this method will always return true. Moreover, this method does not check if a tweener is finished. For that, use is_finished.

pub fn is_finished(&self) -> bool

Returns true is the Tweener’s current_time is greater than or equal to duration.

Note that for tweens without bounds (infinite tweens like Looper), this method will always return false. Moreover, this method does not check if a tweener is started. For that, use is_started.

pub fn is_valid(&self) -> bool

Returns true is the Tweener’s current_time is greater than or equal to 0 but less than duration.

Note that for tweens without bounds (infinite tweens like Looper), this method will always return true.

This method is rarely needed – only use it if you are doing some second-order tweening.

pub fn current_time_state(&self) -> CurrentTimeState

Returns CurrentTimeState based on the Tweener’s current_time.

Note that for tweens without bounds (in this library, Looper, Oscillator, and Extrapolator), this method will always return CurrentTimeState::Valid.

Trait Implementations

impl<Value: Clone, Time: Clone, T: Clone + ?Sized> Clone for FixedTweener<Value, Time, T>

fn clone(&self) -> FixedTweener<Value, Time, T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Value: Debug, Time: Debug, T: Debug + ?Sized> Debug for FixedTweener<Value, Time, T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<Value, Time, T> Deref for FixedTweener<Value, Time, T>

type Target = Tweener<Value, Time, T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<Value, Time, T> DerefMut for FixedTweener<Value, Time, T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<Value, Time, T> Iterator for FixedTweener<Value, Time, T>

where Value: TweenValue, Time: TweenTime, T: Tween<Value>,

type Item = Value

The type of the elements being iterated over.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

fn next_chunk<const N: usize>( &mut self ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

where Self: Sized,

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

where Self: Sized,

Consumes the iterator, returning the last element.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator.

fn map<B, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F)

where Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

fn skip(self, n: usize) -> Skip<Self>

where Self: Sized,

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Borrows an iterator, rather than consuming it.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R

where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn fold<B, F>(self, init: B, f: F) -> B

where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> R, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, F: FnMut(&Self::Item) -> R, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: 'a + Copy, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: 'a + Clone, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering>

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another.

fn eq_by<I, F>(self, other: I, eq: F) -> bool

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another.

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬This is a nightly-only experimental API. (is_sorted)

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)

Checks if the elements of this iterator are sorted using the given key extraction function.

impl<Value: Ord, Time: Ord, T: Ord + ?Sized> Ord for FixedTweener<Value, Time, T>

fn cmp(&self, other: &FixedTweener<Value, Time, T>) -> Ordering

This method returns an Ordering between self and other.

impl<Value: PartialEq, Time: PartialEq, T: PartialEq + ?Sized> PartialEq for FixedTweener<Value, Time, T>

fn eq(&self, other: &FixedTweener<Value, Time, T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Value: PartialOrd, Time: PartialOrd, T: PartialOrd + ?Sized> PartialOrd for FixedTweener<Value, Time, T>

fn partial_cmp(&self, other: &FixedTweener<Value, Time, T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Value: Copy, Time: Copy, T: Copy + ?Sized> Copy for FixedTweener<Value, Time, T>

impl<Value: Eq, Time: Eq, T: Eq + ?Sized> Eq for FixedTweener<Value, Time, T>

impl<Value, Time, T: ?Sized> StructuralPartialEq for FixedTweener<Value, Time, T>