Struct StringIter

pub struct StringIter<'t> { /* private fields */ }

A double ended, UTF-8 char based Iterator for &strs that supports iterating, looking ahead, trimming, pattern matching, splitting and other common string operations.

Also a drop in replacement for an AsRef<str> or a Borrow<str>.

Implementations

impl<'t> StringIter<'t>

pub fn drain(&mut self) -> &'t str

Obtain the contents of the StringIter, leaving it empty.

pub fn try_next_slice<P: Pattern>( &mut self, pat: P, ) -> Result<Option<&'t str>, P::Err>

Gets a slice out of a StringIter using a fallible pattern.

If Err is Never, you can use the infallible version instead.

The iterator will not be changed if the match fails.

Pattern

see supported patterns

Pattern Configuration

see SetSep

pub fn try_next_slice_back<P: Pattern>( &mut self, pat: P, ) -> Result<Option<&'t str>, P::Err>

Gets a slice from a StringIter in reverse, using a fallible pattern.

If Err is Never, you can use the infallible version instead.

The iterator will not be changed if the match fails.

See try_next_slice

pub fn next_slice<P: Pattern<Err = Never>>(&mut self, pat: P) -> Option<&'t str>

Gets a slice from a StringIter, using a non-fallible pattern.

See try_next_slice

pub fn next_slice_back<P: Pattern<Err = Never>>( &mut self, pat: P, ) -> Option<&'t str>

Gets a slice from a StringIter in reverse, using a non-fallible pattern.

See try_next_slice

impl<'t> StringIter<'t>

pub fn into_substrs( self, pat: impl Pattern<Err = Never>, ) -> SplitIter<'t, impl Pattern<Err = Never>>

Split the string into substrings by repeatedly calling next_slice() with a pattern, while ensuring at least one char is consumed each call.

This iterator does not attempt to remove empty strings, use filter() for that.

Explanation

If ran on the entire string, this can be viewed as:

Call pat.match() on each char

• Retain: separate if the next char returns true
• Yield: separate if this char returns true
• Split: separate if this char returns true, and remove this char.

Panics

If pat.sep_method() is Conjoin

Implementation Detail

For Retain patterns, match() is called on first char, but its output is ignored.

pub fn into_splits( self, pat: impl Pattern<Err = Never>, ) -> SplitIter<'t, impl Pattern<Err = Never>>

Convenient method for into_substrs using Sep::Split.

impl<'t> StringIter<'t>

pub fn next_char(&mut self) -> Option<(char, &'t str)>

Returns a leading char and its &str representation from the StringIter and advances it.

This is the same as StringIter::next(), but available to mapped versions of StringIter.

pub fn next_char_back(&mut self) -> Option<(char, &'t str)>

Returns a trailing char and its &str representation from the StringIter and advances it.

This is the same as StringIter::next_back(), but available to mapped versions of StringIter.

pub fn peek(&self) -> Option<(char, &'t str)>

Returns a leading char and its &str representation from the StringIter without advancing it.

pub fn peek_back(&self) -> Option<(char, &'t str)>

Returns a trailing char and its &str representation from the StringIter without advancing it.

pub fn peekn(&self, n: usize) -> Result<&'t str, &'t str>

Returns leading &strs with maximum count n from the StringIter without advancing it.

Returns OK if n chars found, Err if less than n chars found.

pub fn peekn_back(&self, n: usize) -> Result<&'t str, &'t str>

Returns trailing &strs with maximum count n from the StringIter without advancing it.

Returns OK if n chars found, Err if less than n chars found.

pub fn trim_by(&mut self, f: impl Pattern<Err = Never> + Clone)

Removes leading and trailing chars that matches a Pattern from the StringIter.

pub fn trim_start_by(&mut self, f: impl Pattern<Err = Never>)

Removes leading chars that matches a Pattern from the StringIter.

pub fn trim_end_by(&mut self, f: impl Pattern<Err = Never>)

Removes trailing chars that matches a Pattern from the StringIter.

impl<'t> StringIter<'t>

pub fn chars(self) -> CharIter<'t>

Map the iterator into an Iterator<Item = char>.

Discarding the str output

pub fn strs(self) -> StrIter<'t>

Map the iterator into an Iterator<Item = &str>.

Discarding the char output

pub fn ascii(self) -> AsciiIter<'t>

Map the iterator into an Iterator<Item = u8>.

where u8 is the first byte of the &str.

pub fn ascii_str(self) -> AsciiStrIter<'t>

Map the iterator into an Iterator<Item = (u8, &str)>.

where u8 is the first byte of the &str.

pub fn look_ahead(self, len: usize) -> LookAhead<'t>

Make the iterator peek for len.

impl<'t> StringIter<'t>

pub const fn new(s: &'t str) -> Self

Construct a new StringIter from a &str

pub const fn len(&self) -> usize

Returns the length of the underlying str in bytes.

pub const fn is_empty(&self) -> bool

Returns true if the underlying str has a length of zero bytes.

pub const fn as_str(&self) -> &'t str

Returns the underlying str of this StringIter

pub const fn as_bytes(&self) -> &'t [u8]

Returns the underlying [u8] of this StringIter

pub fn startswith(&self, s: &str) -> bool

Returns true if the given &str matches the prefix of the underlying str

Returns false if it does not.

pub fn endswith(&self, s: &str) -> bool

Returns true if the given &str matches the suffix of the underlying str

Returns false if it does not.

pub fn trim(&mut self)

Removes leading and trailing whitespaces from this StringIter

pub fn trim_start(&mut self)

Removes leading whitespaces from this StringIter

pub fn trim_end(&mut self)

Removes trailing whitespaces from this StringIter

pub fn skip_front(&mut self, n: usize) -> bool

Skip n leading chars from this StringIter, returns true if the string is empty afterwards.

pub fn skip_back(&mut self, n: usize) -> bool

Skip n trailing chars from this StringIter, returns true if the string is empty afterwards.

Trait Implementations

impl AsRef<str> for StringIter<'_>

fn as_ref(&self) -> &str

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

impl Borrow<str> for StringIter<'_>

fn borrow(&self) -> &str

Immutably borrows from an owned value.

impl<'t> Clone for StringIter<'t>

fn clone(&self) -> StringIter<'t>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'t> Debug for StringIter<'t>

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

Formats the value using the given formatter.

impl<'t> Display for StringIter<'t>

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

Formats the value using the given formatter.

impl<'t> DoubleEndedIterator for StringIter<'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<'t> From<&'t Arc<str>> for StringIter<'t>

fn from(s: &'t Arc<str>) -> Self

Converts to this type from the input type.

impl<'t> From<&'t Box<str>> for StringIter<'t>

fn from(s: &'t Box<str>) -> Self

Converts to this type from the input type.

impl<'a, 't: 'a> From<&'t Cow<'a, str>> for StringIter<'t>

fn from(s: &'t Cow<'a, str>) -> Self

Converts to this type from the input type.

impl<'t> From<&'t Rc<str>> for StringIter<'t>

fn from(s: &'t Rc<str>) -> Self

Converts to this type from the input type.

impl<'t> From<&'t String> for StringIter<'t>

fn from(s: &'t String) -> Self

Converts to this type from the input type.

impl<'t> From<&'t str> for StringIter<'t>

fn from(value: &'t str) -> Self

Converts to this type from the input type.

impl<'t> Into<&'t str> for StringIter<'t>

fn into(self) -> &'t str

Converts this type into the (usually inferred) input type.

impl<'t> Into<Arc<str>> for StringIter<'t>

fn into(self) -> Arc<str>

Converts this type into the (usually inferred) input type.

impl<'t> Into<Box<str>> for StringIter<'t>

fn into(self) -> Box<str>

Converts this type into the (usually inferred) input type.

impl<'t> Into<Cow<'t, str>> for StringIter<'t>

fn into(self) -> Cow<'t, str>

Converts this type into the (usually inferred) input type.

impl<'t> Into<Rc<str>> for StringIter<'t>

fn into(self) -> Rc<str>

Converts this type into the (usually inferred) input type.

impl<'t> Into<String> for StringIter<'t>

fn into(self) -> String

Converts this type into the (usually inferred) input type.

impl<'t> Iterator for StringIter<'t>

type Item = (char, &'t str)

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 count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

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 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 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: '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 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 PartialEq<&str> for StringIter<'_>

fn eq(&self, other: &&str) -> 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 PartialEq<str> for StringIter<'_>

fn eq(&self, other: &str) -> 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 PartialOrd<&str> for StringIter<'_>

fn partial_cmp(&self, other: &&str) -> 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 PartialOrd<str> for StringIter<'_>

fn partial_cmp(&self, other: &str) -> 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<'t> TryFrom<Cow<'t, str>> for StringIter<'t>

This conversion only works if the Cow is Borrowed

type Error = ()

The type returned in the event of a conversion error.

fn try_from(cow: Cow<'t, str>) -> Result<Self, ()>

Performs the conversion.

impl<'t> FusedIterator for StringIter<'t>