Struct `FindReverse`

struct FindReverse<'h, 'n> { ... }

An iterator over non-overlapping substring matches in reverse.

Matches are reported by the byte offset at which they begin.

'h is the lifetime of the haystack while 'n is the lifetime of the needle.

Implementations

`impl<'h, 'n> Clone for FindReverse<'h, 'n>`

fn clone(self: &Self) -> FindReverse<'h, 'n>

`impl<'h, 'n> Debug for FindReverse<'h, 'n>`

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

`impl<'h, 'n> Freeze for FindReverse<'h, 'n>`

`impl<'h, 'n> Iterator for FindReverse<'h, 'n>`

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

`impl<'h, 'n> RefUnwindSafe for FindReverse<'h, 'n>`

`impl<'h, 'n> Send for FindReverse<'h, 'n>`

`impl<'h, 'n> Sync for FindReverse<'h, 'n>`

`impl<'h, 'n> Unpin for FindReverse<'h, 'n>`

`impl<'h, 'n> UnsafeUnpin for FindReverse<'h, 'n>`

`impl<'h, 'n> UnwindSafe for FindReverse<'h, 'n>`

`impl<I> IntoIterator for FindReverse<'h, 'n>`

fn into_iter(self: Self) -> I

`impl<T> Any for FindReverse<'h, 'n>`

fn type_id(self: &Self) -> TypeId

`impl<T> Borrow for FindReverse<'h, 'n>`

fn borrow(self: &Self) -> &T

`impl<T> BorrowMut for FindReverse<'h, 'n>`

fn borrow_mut(self: &mut Self) -> &mut T

`impl<T> CloneToUninit for FindReverse<'h, 'n>`

unsafe fn clone_to_uninit(self: &Self, dest: *mut u8)

`impl<T> From for FindReverse<'h, 'n>`

fn from(t: T) -> T: Returns the argument unchanged.

`impl<T> ToOwned for FindReverse<'h, 'n>`

fn to_owned(self: &Self) -> T
fn clone_into(self: &Self, target: &mut T)

`impl<T, U> Into for FindReverse<'h, 'n>`

fn into(self: Self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

`impl<T, U> TryFrom for FindReverse<'h, 'n>`

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

`impl<T, U> TryInto for FindReverse<'h, 'n>`

fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>