Struct ScannerStr 

pub struct ScannerStr<'a> { /* private fields */ }

A simple text scanner which can in-memory-ly parse primitive types and strings using UTF-8 from a string slice.

Implementations

impl<'a> ScannerStr<'a>

pub fn new<S: ?Sized + AsRef<str>>(text: &S) -> ScannerStr<'_>

Create a scanner from a string.

use std::io;

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("123 456");

impl<'a> ScannerStr<'a>

pub fn next_char(&mut self) -> Result<Option<char>, ScannerError>

Read the next char. If the data is not a correct char, it will return a Ok(Some(REPLACEMENT_CHARACTER)) which is �. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("5 c 中文");

assert_eq!(Some('5'), sc.next_char().unwrap());
assert_eq!(Some(' '), sc.next_char().unwrap());
assert_eq!(Some('c'), sc.next_char().unwrap());
assert_eq!(Some(' '), sc.next_char().unwrap());
assert_eq!(Some('中'), sc.next_char().unwrap());
assert_eq!(Some('文'), sc.next_char().unwrap());
assert_eq!(None, sc.next_char().unwrap());

pub fn next_line(&mut self) -> Result<Option<&'a str>, ScannerError>

Read the next line but not include the trailing line character (or line characters like CrLf(\r\n)). If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("123 456\r\n789 \n\n 中文 ");

assert_eq!(Some("123 456"), sc.next_line().unwrap());
assert_eq!(Some("789 "), sc.next_line().unwrap());
assert_eq!(Some(""), sc.next_line().unwrap());
assert_eq!(Some(" 中文 "), sc.next_line().unwrap());

impl<'a> ScannerStr<'a>

pub fn skip_whitespaces(&mut self) -> Result<bool, ScannerError>

Skip the next whitespaces (javaWhitespace). If there is nothing to read, it will return Ok(false).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2   c");

assert_eq!(Some('1'), sc.next_char().unwrap());
assert_eq!(Some(' '), sc.next_char().unwrap());
assert_eq!(Some('2'), sc.next_char().unwrap());
assert_eq!(true, sc.skip_whitespaces().unwrap());
assert_eq!(Some('c'), sc.next_char().unwrap());
assert_eq!(false, sc.skip_whitespaces().unwrap());

pub fn next(&mut self) -> Result<Option<&'a str>, ScannerError>

Read the next token separated by whitespaces. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("123 456\r\n789 \n\n 中文 ");

assert_eq!(Some("123"), sc.next().unwrap());
assert_eq!(Some("456"), sc.next().unwrap());
assert_eq!(Some("789"), sc.next().unwrap());
assert_eq!(Some("中文"), sc.next().unwrap());
assert_eq!(None, sc.next().unwrap());

impl<'a> ScannerStr<'a>

pub fn next_str( &mut self, max_number_of_characters: usize, ) -> Result<Option<&'a str>, ScannerError>

Read the next text (as a string slice) with a specific max number of characters. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("123 456\r\n789 \n\n 中文 ");

assert_eq!(Some("123"), sc.next_str(3).unwrap());
assert_eq!(Some(" 456"), sc.next_str(4).unwrap());
assert_eq!(Some("\r\n789 "), sc.next_str(6).unwrap());
assert_eq!(Some("\n\n 中"), sc.next_str(4).unwrap());
assert_eq!(Some("文"), sc.next().unwrap());
assert_eq!(Some(" "), sc.next_str(2).unwrap());
assert_eq!(None, sc.next_str(2).unwrap());

impl<'a> ScannerStr<'a>

pub fn next_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<&'a str>, ScannerError>

Read the next text until it reaches a specific boundary. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("123 456\r\n789 \n\n 中文 ");

assert_eq!(Some("123"), sc.next_until(" ").unwrap());
assert_eq!(Some("456\r"), sc.next_until("\n").unwrap());
assert_eq!(Some("78"), sc.next_until("9 ").unwrap());
assert_eq!(Some("\n\n 中文 "), sc.next_until("kk").unwrap());
assert_eq!(None, sc.next().unwrap());

impl<'a> ScannerStr<'a>

pub fn next_u8(&mut self) -> Result<Option<u8>, ScannerError>

Read the next token separated by whitespaces and parse it to a u8 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u8().unwrap());
assert_eq!(Some(2), sc.next_u8().unwrap());

pub fn next_u16(&mut self) -> Result<Option<u16>, ScannerError>

Read the next token separated by whitespaces and parse it to a u16 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u16().unwrap());
assert_eq!(Some(2), sc.next_u16().unwrap());

pub fn next_u32(&mut self) -> Result<Option<u32>, ScannerError>

Read the next token separated by whitespaces and parse it to a u32 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u32().unwrap());
assert_eq!(Some(2), sc.next_u32().unwrap());

pub fn next_u64(&mut self) -> Result<Option<u64>, ScannerError>

Read the next token separated by whitespaces and parse it to a u64 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u64().unwrap());
assert_eq!(Some(2), sc.next_u64().unwrap());

pub fn next_u128(&mut self) -> Result<Option<u128>, ScannerError>

Read the next token separated by whitespaces and parse it to a u128 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u128().unwrap());
assert_eq!(Some(2), sc.next_u128().unwrap());

pub fn next_usize(&mut self) -> Result<Option<usize>, ScannerError>

Read the next token separated by whitespaces and parse it to a usize value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_usize().unwrap());
assert_eq!(Some(2), sc.next_usize().unwrap());

pub fn next_i8(&mut self) -> Result<Option<i8>, ScannerError>

Read the next token separated by whitespaces and parse it to a i8 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i8().unwrap());
assert_eq!(Some(2), sc.next_i8().unwrap());

pub fn next_i16(&mut self) -> Result<Option<i16>, ScannerError>

Read the next token separated by whitespaces and parse it to a i16 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i16().unwrap());
assert_eq!(Some(2), sc.next_i16().unwrap());

pub fn next_i32(&mut self) -> Result<Option<i32>, ScannerError>

Read the next token separated by whitespaces and parse it to a i32 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i32().unwrap());
assert_eq!(Some(2), sc.next_i32().unwrap());

pub fn next_i64(&mut self) -> Result<Option<i64>, ScannerError>

Read the next token separated by whitespaces and parse it to a i64 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i64().unwrap());
assert_eq!(Some(2), sc.next_i64().unwrap());

pub fn next_i128(&mut self) -> Result<Option<i128>, ScannerError>

Read the next token separated by whitespaces and parse it to a i128 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i128().unwrap());
assert_eq!(Some(2), sc.next_i128().unwrap());

pub fn next_isize(&mut self) -> Result<Option<isize>, ScannerError>

Read the next token separated by whitespaces and parse it to a isize value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_isize().unwrap());
assert_eq!(Some(2), sc.next_isize().unwrap());

pub fn next_f32(&mut self) -> Result<Option<f32>, ScannerError>

Read the next token separated by whitespaces and parse it to a f32 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2.5");

assert_eq!(Some(1.0), sc.next_f32().unwrap());
assert_eq!(Some(2.5), sc.next_f32().unwrap());

pub fn next_f64(&mut self) -> Result<Option<f64>, ScannerError>

Read the next token separated by whitespaces and parse it to a f64 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2.5");

assert_eq!(Some(1.0), sc.next_f64().unwrap());
assert_eq!(Some(2.5), sc.next_f64().unwrap());

impl<'a> ScannerStr<'a>

pub fn next_u8_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<u8>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a u8 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u8_until(" ").unwrap());
assert_eq!(Some(2), sc.next_u8_until(" ").unwrap());

pub fn next_u16_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<u16>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a u16 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u16_until(" ").unwrap());
assert_eq!(Some(2), sc.next_u16_until(" ").unwrap());

pub fn next_u32_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<u32>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a u32 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u32_until(" ").unwrap());
assert_eq!(Some(2), sc.next_u32_until(" ").unwrap());

pub fn next_u64_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<u64>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a u64 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u64_until(" ").unwrap());
assert_eq!(Some(2), sc.next_u64_until(" ").unwrap());

pub fn next_u128_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<u128>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a u128 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_u128_until(" ").unwrap());
assert_eq!(Some(2), sc.next_u128_until(" ").unwrap());

pub fn next_usize_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<usize>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a usize value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_usize_until(" ").unwrap());
assert_eq!(Some(2), sc.next_usize_until(" ").unwrap());

pub fn next_i8_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<i8>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a i8 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i8_until(" ").unwrap());
assert_eq!(Some(2), sc.next_i8_until(" ").unwrap());

pub fn next_i16_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<i16>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a i16 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i16_until(" ").unwrap());
assert_eq!(Some(2), sc.next_i16_until(" ").unwrap());

pub fn next_i32_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<i32>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a i32 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i32_until(" ").unwrap());
assert_eq!(Some(2), sc.next_i32_until(" ").unwrap());

pub fn next_i64_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<i64>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a i64 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i64_until(" ").unwrap());
assert_eq!(Some(2), sc.next_i64_until(" ").unwrap());

pub fn next_i128_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<i128>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a i128 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_i128_until(" ").unwrap());
assert_eq!(Some(2), sc.next_i128_until(" ").unwrap());

pub fn next_isize_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<isize>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a isize value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2");

assert_eq!(Some(1), sc.next_isize_until(" ").unwrap());
assert_eq!(Some(2), sc.next_isize_until(" ").unwrap());

pub fn next_f32_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<f32>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a f32 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2.5");

assert_eq!(Some(1.0), sc.next_f32_until(" ").unwrap());
assert_eq!(Some(2.5), sc.next_f32_until(" ").unwrap());

pub fn next_f64_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<f64>, ScannerError>

Read the next text until it reaches a specific boundary and parse it to a f64 value. If there is nothing to read, it will return Ok(None).

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("1 2.5");

assert_eq!(Some(1.0), sc.next_f64_until(" ").unwrap());
assert_eq!(Some(2.5), sc.next_f64_until(" ").unwrap());

impl<'a> ScannerStr<'a>

pub fn drop_next_line(&mut self) -> Result<Option<usize>, ScannerError>

Drop the next line but not include the trailing line character (or line characters like CrLf(\r\n)). If there is nothing to read, it will return Ok(None). If there is something to read, it will return Ok(Some(i)). The i is the length (in bytes) of the dropped line.

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("123 456\r\n789 \n\n 中文 ");

assert_eq!(Some(7), sc.drop_next_line().unwrap());
assert_eq!(Some("789 "), sc.next_line().unwrap());
assert_eq!(Some(0), sc.drop_next_line().unwrap());
assert_eq!(Some(" 中文 "), sc.next_line().unwrap());
assert_eq!(None, sc.drop_next_line().unwrap());

pub fn drop_next(&mut self) -> Result<Option<usize>, ScannerError>

Drop the next token separated by whitespaces. If there is nothing to read, it will return Ok(None). If there is something to read, it will return Ok(Some(i)). The i is the length (in bytes) of the dropped token.

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("123 456\r\n789 \n\n 中文 ");

assert_eq!(Some(3), sc.drop_next().unwrap());
assert_eq!(Some("456"), sc.next().unwrap());
assert_eq!(Some(3), sc.drop_next().unwrap());
assert_eq!(Some("中文"), sc.next().unwrap());
assert_eq!(None, sc.drop_next().unwrap());

pub fn drop_next_until<S: AsRef<str>>( &mut self, boundary: S, ) -> Result<Option<usize>, ScannerError>

Drop the next text until it reaches a specific boundary. If there is nothing to read, it will return Ok(None). If there is something to read, it will return Ok(Some(i)). The i is the length (in bytes) of the dropped text, excluding the boundary.

use scanner_rust::ScannerStr;

let mut sc = ScannerStr::new("123 456\r\n789 \n\n 中文 ");

assert_eq!(Some(7), sc.drop_next_until("\r\n").unwrap());
assert_eq!(Some("789 "), sc.next_line().unwrap());
assert_eq!(Some(0), sc.drop_next_until("\n").unwrap());
assert_eq!(Some(" 中文 "), sc.next_line().unwrap());
assert_eq!(None, sc.drop_next_until("").unwrap());

Trait Implementations

impl<'a> Debug for ScannerStr<'a>

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

Formats the value using the given formatter.

impl<'a> Iterator for ScannerStr<'a>

type Item = &'a 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 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 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 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 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.