Struct StridedIter 

pub struct StridedIter<'a, T> { /* private fields */ }

🔄 Iterates over a slice using an affine index progression.

---

^{📍 data/access/iter}

---

This is the immutable counterpart of StridedIterMut.

Elements are accessed according to:

index_k = front + k * stride

for increasing k, until the inclusive bound back is reached.

The iterator supports forward and backward traversal.

This type is dimension-agnostic and suitable for:

• Traversing rows, columns, or diagonals of a 2D layout.
• Projecting channels from interleaved buffers (e.g. RGBRGB…).
• Downsampling by stepping every stride elements.
• Iterating a collapsed axis of an n-dimensional layout.

Invariants

• stride > 0.
• front <= back, or the iterator is empty.
• All generated indices lie within storage.

If these conditions are violated, advancing or peeking may panic. No unsafe code is used.

Implementations

impl<'a, T> StridedIter<'a, T>

pub const fn from_count( slice: &'a [T], start: usize, remaining: usize, stride: usize, ) -> Self

Creates a strided iterator from a starting index, a number of elements, and a stride.

Generates indices: start + k * stride for k in 0..remaining.

Panics

Panics if stride == 0. May panic when advanced if indices are out of bounds.

pub const fn from_count_nz( slice: &'a [T], start: usize, remaining: usize, stride: NonZero<usize>, ) -> Self

Like from_count but takes a non-zero stride.

Panics

Panics in case of overflow.

pub const fn from_bounds( slice: &'a [T], front: usize, back: usize, stride: usize, ) -> Self

Creates a strided iterator from inclusive front and back limits and a stride.

Iteration proceeds from front toward back (inclusive limit) in steps of stride. The iterator is empty if front > back.

This constructor does not validate that generated indices lie within the slice. Violations will cause panics during iteration.

Panics

Panics if stride == 0. May panic when advanced if indices are out of bounds.

pub const fn from_parts( slice: &'a [T], front: usize, back: usize, stride: NonZero<usize>, ) -> Self

Creates a strided iterator from its structural components.

The iterator traverses the slice starting at index front, advancing by stride on each step, and stopping once back has been yielded. The range is inclusive: both front and back are considered valid positions.

The iterator is empty if front > back.

Panics

Panics if:

• front <= back and (back - front) is not a multiple of stride.
• back is not a valid index in the slice.

pub const fn from_parts_usize( slice: &'a [T], front: usize, back: usize, stride: NonZero<usize>, ) -> Self

Like from_parts but takes usize arguments.

Panics

Panics if:

• Any argument can’t fit in usize.
• front <= back and (back - front) is not a multiple of stride.
• back is not a valid index in the slice.

pub const fn into_parts(self) -> (&'a [T], usize, usize, NonZero<usize>)

Decomposes the iterator into its structural components.

Returns (slice, front, back, stride).

The returned values can be passed to from_parts to reconstruct an equivalent iterator, or used to transfer iteration state to another compatible type.

pub const fn into_parts_usize(self) -> (&'a [T], usize, usize, NonZeroUsize)

Like into_parts but returns usize elements.

pub const fn len(&self) -> usize

Returns the number of elements remaining in the iterator.

pub const fn len_usize(&self) -> usize

Returns the number of elements remaining in the iterator as a usize.

Panics

Will only panic if the value can’t fit in a usize.

pub const fn is_empty(&self) -> bool

Returns true if there are no remaining elements.

pub const fn next(&mut self) -> Option<&T>

Advances the iterator and returns a shared reference to the next value.

pub const fn peek(&self) -> Option<&T>

Returns a shared reference to the next value, without updating the iterator.

pub const fn next_back(&mut self) -> Option<&T>

Advances the iterator and returns a shared reference to the next value from the back.

pub const fn peek_back(&self) -> Option<&T>

Returns a shared reference to the next value from the back, without updating the iterator.

Trait Implementations

impl<'a, T: Debug> Debug for StridedIter<'a, T>

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

Formats the value using the given formatter.

impl<'a, T> DoubleEndedIterator for StridedIter<'a, T>

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<'a, T: Eq> Eq for StridedIter<'a, T>

impl<T> ExactSizeIterator for StridedIter<'_, T>

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<'a, T: Hash> Hash for StridedIter<'a, T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, T> Iterator for StridedIter<'a, T>

type Item = &'a T

The type of the elements being iterated over.

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

Advances the iterator and returns the next value.

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

Returns the bounds on the remaining length of the iterator.

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 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 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 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 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<'a, T> IteratorLending for StridedIter<'a, T>

type Item<'b> = &'b T where Self: 'b

The item yielded by this iterator.

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

Advances the iterator and returns the next item.

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

Returns a size hint for the remaining items.

fn count(&mut self) -> usize

Consumes the iterator, returning the number of remaining items.

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

Advances the iterator by n steps.

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

Advances the iterator by n items and returns the next one.

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

where F: FnMut(Self::Item<'_>),

Applies f to each remaining item.

fn inspect<F>(&mut self, f: F)

where F: FnMut(&Self::Item<'_>),

Calls f for each item before yielding it.

fn is_partitioned<P>(&mut self, pred: P) -> bool

where P: FnMut(&Self::Item<'_>) -> bool,

Returns true if the iterator is partitioned according to pred.

fn try_fold<B, E, F>(&mut self, acc: B, f: F) -> Result<B, E>

where F: FnMut(B, Self::Item<'_>) -> Result<B, E>,

Applies f to each item, accumulating results in acc.

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

where F: FnMut(Self::Item<'_>) -> Result<(), E>,

Applies f to each remaining item until an error occurs.

fn all<P>(&mut self, pred: P) -> bool

where P: FnMut(&Self::Item<'_>) -> bool,

Returns true if all items satisfy the predicate.

fn any<P>(&mut self, pred: P) -> bool

where P: FnMut(&Self::Item<'_>) -> bool,

Returns true if any item satisfies the predicate.

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

where P: FnMut(&Self::Item<'_>) -> bool,

Returns the index of the first item for which pred returns true, or None if no matching item is found.

impl<'a, T> IteratorLendingDoubleEnded for StridedIter<'a, T>

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

Returns the next item from the back of the iterator.

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

Skips n items from the back and returns the next one.

fn try_rfold<B, E, F>(&mut self, acc: B, f: F) -> Result<B, E>

where F: FnMut(B, Self::Item<'_>) -> Result<B, E>,

Reverse-direction equivalent of IteratorLending::try_fold.

impl<'a, T> IteratorLendingExactSize for StridedIter<'a, T>

fn len(&self) -> usize

Returns the exact number of items remaining.

fn is_empty(&self) -> bool

Returns true when no more items can be produced.

impl<'a, T> IteratorLendingPeek for StridedIter<'a, T>

fn peek<'b>(&'b mut self) -> Option<Self::Item<'b>>

Returns the next item without advancing the iterator.

fn next_if<F>(&mut self, pred: F) -> Option<Self::Item<'_>>

where for<'a> F: FnOnce(&Self::Item<'a>) -> bool,

Returns the next item if it matches the predicate.

fn next_if_eq<Q>(&mut self, expected: &Q) -> Option<Self::Item<'_>>

where for<'a> Self::Item<'a>: PartialEq<Q>, Q: ?Sized,

Returns the next item if it is equal to expected.

fn next_if_map<R, E, F>(&mut self, f: F) -> Result<Option<R>, E>

where F: FnOnce(&Self::Item<'_>) -> Result<R, E>,

Applies f to the next item without advancing the iterator unless f returns Ok.

impl<'a, T> IteratorLendingPeekDoubleEnded for StridedIter<'a, T>

fn peek_back<'b>(&'b mut self) -> Option<Self::Item<'b>>

Returns the next item from the back, without advancing the iterator.

fn next_back_if<F>(&mut self, pred: F) -> Option<Self::Item<'_>>

where for<'a> F: FnOnce(&Self::Item<'a>) -> bool,

Returns the next item from the back if it matches the predicate.

fn next_back_if_eq<Q>(&mut self, expected: &Q) -> Option<Self::Item<'_>>

where for<'a> Self::Item<'a>: PartialEq<Q>, Q: ?Sized,

Returns the next item from the back if it is equal to expected.

fn next_back_if_map<R, E, F>(&mut self, f: F) -> Result<Option<R>, E>

where F: FnOnce(&Self::Item<'_>) -> Result<R, E>,

Applies f to the next item from the back without advancing the iterator unless f returns Ok.

impl<'a, T: Ord> Ord for StridedIter<'a, T>

fn cmp(&self, other: &StridedIter<'a, T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'a, T: PartialEq> PartialEq for StridedIter<'a, T>

fn eq(&self, other: &StridedIter<'a, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<'a, T: PartialOrd> PartialOrd for StridedIter<'a, T>

fn partial_cmp(&self, other: &StridedIter<'a, T>) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<'a, T> StructuralPartialEq for StridedIter<'a, T>