Struct Anims

pub struct Anims<'a> { /* private fields */ }

Animations of a Model https://stereokit.net/Pages/StereoKit/ModelAnimCollection.html

see also Model::get_anims

Examples

use stereokit_rust::{maths::{Vec3, Matrix}, model::{Model, Anims, AnimMode}};

let model = Model::from_file("center.glb", None)
                             .expect("Could not load model").copy();
let transform = Matrix::t_r_s(Vec3::NEG_Y * 0.40, [0.0, 190.0, 0.0], Vec3::ONE * 0.25);

let mut anims = model.get_anims();
assert_eq!(anims.get_count(), 1);
anims.play_anim("SuzanneAction", AnimMode::Manual).anim_completion(0.80);

for (iter, anim) in anims.enumerate() {
    match iter {
        0 => assert_eq!(anim.name, "SuzanneAction"),
        _ => panic!("Unexpected animation name"),
    }
}

let mut anims = model.get_anims();
filename_scr = "screenshots/anims.jpeg";
test_screenshot!( // !!!! Get a proper main loop !!!!
    model.draw(token, transform, None, None);
);

Implementations

impl<'a> Anims<'a>

pub fn from<M: AsRef<Model>>(model: &'a M) -> Anims<'a>

Same as Model::get_anims

pub fn get_name_at_index(&self, index: i32) -> Option<&str>

Get the name of the animation at given index

see also model_anim_get_name

Examples

use stereokit_rust::{model::{Model, Anims, AnimMode}, system::Assets};

let model = Model::from_file("mobiles.gltf", None)
                             .expect("Could not load model").copy();
Assets::block_for_priority(i32::MAX);

let mut anims = model.get_anims();
assert_eq!(anims.get_count(), 3);
assert_eq!(anims.get_name_at_index(0), Some("rotate"));
assert_eq!(anims.get_name_at_index(1), Some("flyRotate"));
assert_eq!(anims.get_name_at_index(2), Some("fly"));
assert_eq!(anims.get_name_at_index(3), None);

pub fn get_duration_at_index(&self, index: i32) -> f32

Get the duration of the animation at given index

Returns -0.01 if the index is out of bounds. see also model_anim_get_duration

Examples

use stereokit_rust::model::{Model, Anims, AnimMode};

let model = Model::from_file("center.glb", None)
                             .expect("Could not load model").copy();
let mut anims = model.get_anims();
assert_eq!(anims.get_count(), 1);
assert_eq!(anims.get_duration_at_index(0), 2.5);
assert_eq!(anims.get_duration_at_index(1), -0.01);

pub fn step_anim(&mut self) -> &mut Self

Calling Draw will automatically step the Model’s animation, but if you don’t draw the Model, or need access to the animated nodes before drawing, then you can step the animation early manually via this method. Animation will only ever be stepped once per frame, so it’s okay to call this multiple times, or in addition to Draw. https://stereokit.net/Pages/StereoKit/Model/StepAnim.html

see also model_step_anim model_play_anim

Examples

use stereokit_rust::{maths::{Vec3, Matrix}, model::{Model, Anims, AnimMode}};

let model = Model::from_file("center.glb", None)
                             .expect("Could not load model").copy();
let mut anims = model.get_anims();
assert_eq!(anims.get_count(), 1);
anims.play_anim("SuzanneAction", AnimMode::Loop);

number_of_steps = 20;
test_steps!( // !!!! Get a proper main loop !!!!
    if iter % 10 < 5 {
        model.draw(token, Matrix::IDENTITY, None, None);
    } else {
        anims.step_anim();
    }
);

pub fn play_anim( &mut self, animation_name: impl AsRef<str>, mode: AnimMode, ) -> &mut Self

Searches for an animation with the given name, and if it’s found, sets it up as the active animation and begins laying it with the animation mode. https://stereokit.net/Pages/StereoKit/Model/PlayAnim.html

• name - The name of the animation to play. Case sensitive.
• mode - The animation mode to use.

see also model_play_anim Anims::play_anim_idx

Examples

use stereokit_rust::model::{Model, Anims, AnimMode};

let model = Model::from_file("center.glb", None)
                             .expect("Could not load model").copy();
let mut anims = model.get_anims();

anims.play_anim("SuzanneAction", AnimMode::Loop);
assert_eq!(anims.get_anim_mode(), AnimMode::Loop);

anims.play_anim("SuzanneAction", AnimMode::Once);
assert_eq!(anims.get_anim_mode(), AnimMode::Once);

anims.play_anim("SuzanneAction", AnimMode::Manual);
assert_eq!(anims.get_anim_mode(), AnimMode::Manual);

// If anim does not exist:
anims.play_anim("Not exist", AnimMode::Manual);
assert_eq!(anims.get_anim_mode(), AnimMode::Manual);

pub fn play_anim_idx(&mut self, idx: i32, mode: AnimMode) -> &mut Self

Sets it up the animation at index idx as the active animation and begins playing it with the animation mode. https://stereokit.net/Pages/StereoKit/Model/PlayAnim.html

• idx - index of the animation to play
• mode - animation mode to play the animation with

see also model_play_anim_idx Anims::play_anim

Examples

use stereokit_rust::model::{Model, Anims, AnimMode};

let model = Model::from_file("center.glb", None)
                             .expect("Could not load model").copy();
let mut anims = model.get_anims();

anims.play_anim_idx(0, AnimMode::Loop);
assert_eq!(anims.get_anim_mode(), AnimMode::Loop);

anims.play_anim_idx(0, AnimMode::Once);
assert_eq!(anims.get_anim_mode(), AnimMode::Once);

// If index does not exist:
anims.play_anim_idx(102, AnimMode::Manual);
assert_eq!(anims.get_anim_mode(), AnimMode::Once);

pub fn anim_time(&mut self, time: f32) -> &mut Self

Set the current time of the active animation in seconds, from the start of the animation. This may be a value superior to the animation’s Duration if the animation is a loop. For a percentage of completion, see anim_completion instead. https://stereokit.net/Pages/StereoKit/Model/AnimTime.html

see also model_set_anim_time Anims::anim_completion

Examples

use stereokit_rust::model::{Model, Anims, AnimMode};

let model = Model::from_file("center.glb", None)
                             .expect("Could not load model").copy();
let mut anims = model.get_anims();
anims.play_anim_idx(0, AnimMode::Manual);
assert_eq!(anims.get_duration_at_index(0), 2.5);

anims.anim_time(1.0);
assert_eq!(anims.get_anim_completion(), 0.4);

anims.anim_time(2.0);
assert_eq!(anims.get_anim_completion(), 0.8);

// if the asking for animation longer than the duration (AnimMode::Manual):
anims.anim_time(4.0);
assert_eq!(anims.get_anim_completion(), 1.0);

anims.play_anim_idx(0, AnimMode::Loop);
// if the asking for animation longer than the duration (AnimMode::Loop):
anims.anim_time(4.0);
assert_eq!(anims.get_anim_completion(), 0.6);

pub fn anim_completion(&mut self, percent: f32) -> &mut Self

This set the percentage of completion of the active animation. This may be a value superior to 1.0 if the animation is a loop. https://stereokit.net/Pages/StereoKit/Model/AnimCompletion.html

see also model_set_anim_completion Anims::anim_time

Examples

use stereokit_rust::model::{Model, Anims, AnimMode};

let model = Model::from_file("center.glb", None)
                             .expect("Could not load model").copy();
let mut anims = model.get_anims();
anims.play_anim_idx(0, AnimMode::Manual);
assert_eq!(anims.get_duration_at_index(0), 2.5);

anims.anim_completion(0.4);
assert_eq!(anims.get_anim_time(), 1.0);

anims.anim_completion(0.8);
assert_eq!(anims.get_anim_time(), 2.0);

// If asking for a completion over 100% (AnimMode::Manual):
anims.anim_completion(1.8);
assert_eq!(anims.get_anim_time(), 2.5);

anims.play_anim_idx(0, AnimMode::Loop);
// if the asking for a completion over 100% (AnimMode::Loop):
anims.anim_completion(1.8);
assert_eq!(anims.get_anim_time(), 2.0);

pub fn find_anim<S: AsRef<str>>(&self, name: S) -> Option<i32>

get anim by name https://stereokit.net/Pages/StereoKit/Model/FindAnim.html

see also model_anim_find Anims::play_anim `Anims::play_anim_idx

Examples

use stereokit_rust::model::{Model, Anims};
let model = Model::from_file("center.glb", None)
    .expect("Could not load model")
    .copy();

let anims = model.get_anims();

assert_eq!(anims.find_anim("SuzanneAction"), Some(0));
assert_eq!(anims.find_anim("Not exist"), None);

pub fn get_count(&self) -> i32

Get the number of animations https://stereokit.net/Pages/StereoKit/Model/ModelAnimCollection.html

see also model_anim_count

Examples

use stereokit_rust::model::{Model};

let model = Model::from_file("mobiles.gltf", None)
                            .expect("Could not load model").copy();

let count = model.get_anims().get_count();

assert_eq!(count, 3);

pub fn get_active_anim(&self) -> i32

Get the current animation https://stereokit.net/Pages/StereoKit/Model/ActiveAnim.html

see also model_anim_active Anims::play_anim Anims::play_anim_idx

Examples

use stereokit_rust::model::{Model, AnimMode};

let model = Model::from_file("mobiles.gltf", None)
                           .expect("Could not load model").copy();

let mut anims = model.get_anims();
assert_eq!(anims.get_active_anim(), -1);

anims.play_anim("flyRotate", AnimMode::Loop);
assert_eq!(anims.get_active_anim(), 1);

pub fn get_anim_mode(&self) -> AnimMode

Get the current animation, mode https://stereokit.net/Pages/StereoKit/Model/AnimMode.html

see also model_anim_active_mode Anims::play_anim Anims::play_anim_idx

Examples

use stereokit_rust::model::{Model, AnimMode};

let model = Model::from_file("mobiles.gltf", None)
                          .expect("Could not load model").copy();

let mut anims = model.get_anims();
assert_eq!(anims.get_anim_mode(), AnimMode::Loop);

anims.play_anim("flyRotate", AnimMode::Once);
assert_eq!(anims.get_anim_mode(), AnimMode::Once);

anims.play_anim("fly", AnimMode::Manual);
assert_eq!(anims.get_anim_mode(), AnimMode::Manual);

pub fn get_anim_time(&self) -> f32

Get the current animation duration https://stereokit.net/Pages/StereoKit/Model/AnimTime.html

see also model_anim_active_time Anims::anim_time Anims::anim_completion

Examples

use stereokit_rust::model::{Model, AnimMode};

let model = Model::from_file("center.glb", None)
                          .expect("Could not load model").copy();

let mut anims = model.get_anims();
assert_eq!(anims.get_anim_time(), 0.0);

anims.play_anim("SuzanneAction", AnimMode::Loop ).anim_completion(0.5);
assert_eq!(anims.get_anim_time(), 1.25);

pub fn get_anim_completion(&self) -> f32

Get the current animation completion % https://stereokit.net/Pages/StereoKit/Model/AnimCompletion.html

see also model_anim_active_completion Anims::anim_time Anims::anim_completion

Examples

use stereokit_rust::model::{Model, AnimMode};

let model = Model::from_file("center.glb", None)
                         .expect("Could not load model").copy();
let mut anims = model.get_anims();
assert_eq!(anims.get_anim_completion(), 0.0);

anims.play_anim("SuzanneAction", AnimMode::Loop);
anims.anim_time(0.5);
assert_eq!(anims.get_anim_completion(), 0.2);

Trait Implementations

impl Iterator for Anims<'_>

type Item = Anim

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(self, separator: Self::Item) -> Intersperse<Self>

where Self: Sized, Self::Item: Clone,

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

Creates a new iterator which places a copy of separator between adjacent items of the original iterator.

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,

Creates a “by reference” adapter for this instance of Iterator.

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<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, 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<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, 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,

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,

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