Struct Find
pub struct Find<'h, 'n> { /* private fields */ }An iterator over non-overlapping substring matches.
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.
Trait Implementations
impl<'h, 'n> Clone for Find<'h, 'n>
fn clone(&self) -> Self
impl<'h, 'n> Debug for Find<'h, 'n>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
impl<'h, 'n> Iterator for Find<'h, 'n>
type Item = usize;fn next(&mut self) -> Option<usize>
Auto Trait Implementations
impl<'h, 'n> Freeze for Find<'h, 'n>
impl<'h, 'n> RefUnwindSafe for Find<'h, 'n>
impl<'h, 'n> Send for Find<'h, 'n>
impl<'h, 'n> Sync for Find<'h, 'n>
impl<'h, 'n> Unpin for Find<'h, 'n>
impl<'h, 'n> UnsafeUnpin for Find<'h, 'n>
impl<'h, 'n> UnwindSafe for Find<'h, 'n>
Blanket Implementations
impl<I> IntoIterator for Find<'h, 'n>
where
I: Iterator,
type Item = <I as Iterator>::Item;type IntoIter = I;fn into_iter(self) -> I
impl<T> Any for Find<'h, 'n>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for Find<'h, 'n>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for Find<'h, 'n>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for Find<'h, 'n>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for Find<'h, 'n>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> ToOwned for Find<'h, 'n>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for Find<'h, 'n>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for Find<'h, 'n>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for Find<'h, 'n>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>