Struct ShadowCountedIter 

pub struct ShadowCountedIter<'a, I: Iterator, S = ()> { /* private fields */ }

An iterator that counts every iteration and optionally commits the count to a parent iterator. Can carry supplemental data of type S through the iteration process.

Note that the ShadowCountedIter implements methods on its own. These can only be accessed while having the iterator itself available. Thus using a for loop is often not possible, instead a while let Some(item) = iterator.next() {...} loop is required to iterate over its elements.

Implementations

impl<'a, I: Iterator, S: Default> ShadowCountedIter<'a, I, S>

pub fn new(iter: I) -> Self

Creates a new ShadowCountedIter from an iterator.

Example

let mut iter = vec![1, 2, 3].into_iter().shadow_counted();
while let Some(_) = iter.next() {}
assert_eq!(iter.counter(), 3);

impl<'a, I: Iterator, S> ShadowCountedIter<'a, I, S>

pub fn new_with(iter: I, supplement: S) -> Self

Creates a new ShadowCountedIter from an iterator with specific supplemental data.

Example

#[derive(Clone, Default)]
struct MyData { value: u32 }
impl Commit for MyData {
    fn commit(&self, _from: Self) {}
}

let mut iter = vec![1, 2, 3].into_iter();
let mut iter = ShadowCountedIter::new_with(iter, MyData { value: 42 });
assert_eq!(iter.supplement().value, 42);
while let Some(_) = iter.next() {}
assert_eq!(iter.counter(), 3);

pub fn supplement(&self) -> &S

Get a reference to the supplemental data.

Example

#[derive(Clone, Default)]
struct MyData { value: u32 }
impl Commit for MyData {
    fn commit(&self, _from: Self) {}
}

let mut iter = ShadowCountedIter::new_with(vec![1, 2].into_iter(), MyData { value: 42 });
assert_eq!(iter.supplement().value, 42);

pub fn supplement_mut(&mut self) -> &mut S

Get a mutable reference to the supplemental data.

Example

#[derive(Clone, Default)]
struct MyData { value: u32 }
impl Commit for MyData {
    fn commit(&self, _from: Self) {}
}

let mut iter = ShadowCountedIter::new_with(vec![1, 2].into_iter(), MyData { value: 42 });
iter.supplement_mut().value = 100;
assert_eq!(iter.supplement().value, 100);

impl<'a, I: Iterator, S: Clone> ShadowCountedIter<'a, I, S>

pub fn new_nested<'b, T: Iterator>( iter: I, parent: &'a mut ShadowCountedIter<'b, T, S>, ) -> Self

Creates a new nested ShadowCountedIter with a reference to a parent iterator. Nested iterators must be either committed to propagate their count to the parent. The supplemental data is cloned from the parent.

Arguments

• parent - The parent iterator to commit the count to.

Example

let mut parent_iter = vec![1, 2, 3].into_iter().shadow_counted();
parent_iter.next();

let mut nested_iter = vec![4,5].into_iter().nested_shadow_counted(&mut parent_iter);
assert_eq!(nested_iter.counter(), 1);
while let Some(_) = nested_iter.next() {}
assert_eq!(nested_iter.counter(), 3);
// destroy the nested iter while committing the count to the parent
nested_iter.commit();

while let Some(_) = parent_iter.next() {}
assert_eq!(parent_iter.counter(), 5);

impl<'a, I: Iterator, S> ShadowCountedIter<'a, I, S>

pub fn new_nested_with<'b, T: Iterator>( iter: I, parent: &'a mut ShadowCountedIter<'b, T, S>, supplement: S, ) -> Self

where S: Clone,

Creates a new nested ShadowCountedIter with a reference to a parent iterator and custom supplemental data. Nested iterators must be either committed to propagate their count to the parent.

Arguments

• iter - The iterator to wrap
• parent - The parent iterator to commit the count to
• supplement - Custom supplemental data for this nested iterator

Example

use std::cell::Cell;

#[derive(Clone, Default, Debug)]
struct Counter { count: Cell<u32> }
impl Commit for Counter {
    fn commit(&self, from: Self) {
        self.count.set(self.count.get() + from.count.get());
    }
}

let mut parent = ShadowCountedIter::new_with(
    vec![1, 2].into_iter(),
    Counter { count: Cell::new(10) }
);
parent.next();

let mut nested = ShadowCountedIter::new_nested_with(
    vec![3, 4].into_iter(),
    &mut parent,
    Counter { count: Cell::new(100) }
);
assert_eq!(nested.supplement().count.get(), 100); // Custom data, not cloned from parent
while let Some(_) = nested.next() {}
nested.commit().unwrap();

impl<'a, I: Iterator, S: Commit> ShadowCountedIter<'a, I, S>

pub fn commit(self) -> Result<(), Self>

Commits the count of a nested iterator to the parent iterator. This destroys self while committing the count to the parent. Only one child can commit to a parent in case these children got cloned. Any further commit will result in an error. Committing to a non nested (top level) iterator will error too. On error the iterator is returned.

Example

let mut parent = vec![1, 2].into_iter().shadow_counted();
parent.next();
assert_eq!(parent.counter(), 1);

let mut nested = vec![3, 4].into_iter().nested_shadow_counted(&mut parent);
nested.next();
nested.next();
assert_eq!(nested.counter(), 3);

// Commit propagates count to parent
nested.commit().unwrap();
assert_eq!(parent.counter(), 3);

pub fn into_inner_iter(self) -> I

This destructures the ShadowCountedIter and returns the iterator it wrapped. This is useful when the counter is no longer needed but the inner iterator is and one wants to shed the lifetime that comes with the ShadowCountedIter.

Example

let mut iter = vec![1, 2, 3, 4, 5].into_iter().shadow_counted();
iter.next(); // consume one

let inner = iter.into_inner_iter();
assert_eq!(inner.collect::<Vec<_>>(), vec![2, 3, 4, 5]);

impl<I: Iterator, S> ShadowCountedIter<'_, I, S>

pub fn add(&mut self, delta: isize)

Allows to adjust the counter. This is required when in recursive structures only leafs shall be counted. Takes an isize so that it can be used with negative values.

Arguments

• delta - The delta to adjust the counter by.

Example

let mut iter = vec![1, 2, 3].into_iter().shadow_counted();
iter.add(2);
assert_eq!(iter.counter(), 2);
iter.add(-1);
assert_eq!(iter.counter(), 1);

pub fn counter(&self) -> usize

Returns the iterators current count.

Example

let vec = vec![1, 2, 3];
let mut iter = vec.into_iter().shadow_counted();
while let Some(_) = iter.next() {}
assert_eq!(iter.counter(), 3);

Trait Implementations

impl<I: Iterator, S> AsRef<I> for ShadowCountedIter<'_, I, S>

fn as_ref(&self) -> &I

Converts this type into a shared reference of the (usually inferred) input type.

impl<'a, I: Clone + Iterator, S: Clone> Clone for ShadowCountedIter<'a, I, S>

fn clone(&self) -> ShadowCountedIter<'a, I, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, I: Debug + Iterator, S: Debug> Debug for ShadowCountedIter<'a, I, S>

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

Formats the value using the given formatter.

impl<I: DoubleEndedIterator, S> DoubleEndedIterator for ShadowCountedIter<'_, I, S>

Implements DoubleEndedIterator when the inner iterator does. Both forward and backward iteration increment the counter.

Example

let mut iter = vec![1, 2, 3, 4, 5].into_iter().shadow_counted();
assert_eq!(iter.next(), Some(1));
assert_eq!(iter.counter(), 1);
assert_eq!(iter.next_back(), Some(5));
assert_eq!(iter.counter(), 2);
assert_eq!(iter.next_back(), Some(4));
assert_eq!(iter.counter(), 3);

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

Removes and returns an element from the end of the iterator.

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

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

Advances the iterator from the back by n elements.

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

Returns the nth element from the end of the iterator.

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

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

This is the reverse version of Iterator::try_fold(): it takes elements starting from the back of the iterator.

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

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

An iterator method that reduces the iterator’s elements to a single, final value, starting from the back.

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

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

Searches for an element of an iterator from the back that satisfies a predicate.

impl<I: Iterator + ExactSizeIterator, S> ExactSizeIterator for ShadowCountedIter<'_, I, S>

Implements ExactSizeIterator when the inner iterator does. The length reflects the remaining items in the iterator.

Example

let mut iter = vec![1, 2, 3, 4, 5].into_iter().shadow_counted();
assert_eq!(iter.len(), 5);
iter.next();
assert_eq!(iter.len(), 4);
iter.next();
assert_eq!(iter.len(), 3);

fn len(&self) -> usize

Returns the exact remaining length of the iterator.

fn is_empty(&self) -> bool

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

Returns true if the iterator is empty.

impl<T: Iterator> From<T> for ShadowCountedIter<'_, T, ()>

When types can be inferred then From and Into can be used to convert an iterator into a ShadowCountedIter with default (unit) supplemental data.

fn from(iter: T) -> Self

Converts to this type from the input type.

impl<I: Iterator, S> Iterator for ShadowCountedIter<'_, I, S>

type Item = <I as Iterator>::Item

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 flatten(self) -> Flatten<Self>

where Self: Sized, Self::Item: IntoIterator,

Creates an iterator that 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 try_collect<B>( &mut self, ) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType

where Self: Sized, Self::Item: Try, <Self::Item as Try>::Residual: Residual<B>, B: FromIterator<<Self::Item as Try>::Output>,

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

Fallibly transforms an iterator into a collection, short circuiting if a failure is encountered.

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 partition_in_place<'a, T, P>(self, predicate: P) -> usize

where T: 'a, Self: Sized + DoubleEndedIterator<Item = &'a mut T>, P: FnMut(&T) -> bool,

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

Reorders the elements of this iterator in-place according to the given predicate, such that all those that return true precede all those that return false. Returns the number of true elements found.

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 rposition<P>(&mut self, predicate: P) -> Option<usize>

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

Searches for an element in an iterator from the right, returning its index.

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

where Self: Sized, Self::Item: Ord,

Returns the maximum element of an iterator.

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

where Self: Sized, Self::Item: Ord,

Returns the minimum element of an iterator.

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 rev(self) -> Rev<Self>

where Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction.

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: Copy + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

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

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

Creates an iterator which clones all of its elements.

fn cycle(self) -> Cycle<Self>

where Self: Sized + Clone,

Repeats an iterator endlessly.

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<I>(self, other: I) -> Ordering

where I: IntoIterator<Item = Self::Item>, Self::Item: Ord, Self: Sized,

Lexicographically compares the elements of this Iterator with those of another.

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(self) -> bool

where Self: Sized, Self::Item: PartialOrd,

Checks if the elements of this iterator are sorted.

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.

impl<I: Iterator + FusedIterator, S> FusedIterator for ShadowCountedIter<'_, I, S>