Struct scanner_rust::ScannerStr
source · pub struct ScannerStr<'a> { /* private fields */ }
Expand description
A simple text scanner which can in-memory-ly parse primitive types and strings using UTF-8 from a string slice.
Implementations§
source§impl<'a> ScannerStr<'a>
impl<'a> ScannerStr<'a>
source§impl<'a> ScannerStr<'a>
impl<'a> ScannerStr<'a>
sourcepub fn next_char(&mut self) -> Result<Option<char>, ScannerError>
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());
sourcepub fn next_line(&mut self) -> Result<Option<&'a str>, ScannerError>
pub fn next_line(&mut self) -> Result<Option<&'a str>, ScannerError>
Read the next line but not include the tailing line character (or line chracters 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());
source§impl<'a> ScannerStr<'a>
impl<'a> ScannerStr<'a>
sourcepub fn skip_whitespaces(&mut self) -> Result<bool, ScannerError>
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());
sourcepub fn next(&mut self) -> Result<Option<&'a str>, ScannerError>
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());
source§impl<'a> ScannerStr<'a>
impl<'a> ScannerStr<'a>
sourcepub fn next_str(
&mut self,
max_number_of_characters: usize
) -> Result<Option<&str>, ScannerError>
pub fn next_str( &mut self, max_number_of_characters: usize ) -> Result<Option<&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());
source§impl<'a> ScannerStr<'a>
impl<'a> ScannerStr<'a>
sourcepub fn next_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<&'a str>, ScannerError>
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());
source§impl<'a> ScannerStr<'a>
impl<'a> ScannerStr<'a>
sourcepub fn next_u8(&mut self) -> Result<Option<u8>, ScannerError>
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());
sourcepub fn next_u16(&mut self) -> Result<Option<u16>, ScannerError>
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());
sourcepub fn next_u32(&mut self) -> Result<Option<u32>, ScannerError>
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());
sourcepub fn next_u64(&mut self) -> Result<Option<u64>, ScannerError>
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());
sourcepub fn next_u128(&mut self) -> Result<Option<u128>, ScannerError>
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());
sourcepub fn next_usize(&mut self) -> Result<Option<usize>, ScannerError>
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());
sourcepub fn next_i8(&mut self) -> Result<Option<i8>, ScannerError>
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());
sourcepub fn next_i16(&mut self) -> Result<Option<i16>, ScannerError>
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());
sourcepub fn next_i32(&mut self) -> Result<Option<i32>, ScannerError>
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());
sourcepub fn next_i64(&mut self) -> Result<Option<i64>, ScannerError>
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());
sourcepub fn next_i128(&mut self) -> Result<Option<i128>, ScannerError>
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());
sourcepub fn next_isize(&mut self) -> Result<Option<isize>, ScannerError>
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());
sourcepub fn next_f32(&mut self) -> Result<Option<f32>, ScannerError>
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());
sourcepub fn next_f64(&mut self) -> Result<Option<f64>, ScannerError>
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());
source§impl<'a> ScannerStr<'a>
impl<'a> ScannerStr<'a>
sourcepub fn next_u8_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<u8>, ScannerError>
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());
sourcepub fn next_u16_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<u16>, ScannerError>
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());
sourcepub fn next_u32_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<u32>, ScannerError>
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());
sourcepub fn next_u64_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<u64>, ScannerError>
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());
sourcepub fn next_u128_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<u128>, ScannerError>
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());
sourcepub fn next_usize_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<usize>, ScannerError>
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());
sourcepub fn next_i8_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<i8>, ScannerError>
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());
sourcepub fn next_i16_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<i16>, ScannerError>
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());
sourcepub fn next_i32_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<i32>, ScannerError>
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());
sourcepub fn next_i64_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<i64>, ScannerError>
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());
sourcepub fn next_i128_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<i128>, ScannerError>
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());
sourcepub fn next_isize_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<isize>, ScannerError>
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());
sourcepub fn next_f32_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<f32>, ScannerError>
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());
sourcepub fn next_f64_until<S: AsRef<str>>(
&mut self,
boundary: S
) -> Result<Option<f64>, ScannerError>
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());
Trait Implementations§
source§impl<'a> Debug for ScannerStr<'a>
impl<'a> Debug for ScannerStr<'a>
source§impl<'a> Iterator for ScannerStr<'a>
impl<'a> Iterator for ScannerStr<'a>
source§fn next(&mut self) -> Option<Self::Item>
fn next(&mut self) -> Option<Self::Item>
source§fn next_chunk<const N: usize>(
&mut self
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
Self: Sized,
fn next_chunk<const N: usize>(
&mut self
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
Self: Sized,
iter_next_chunk
)N
values. Read more1.0.0 · source§fn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
1.0.0 · source§fn count(self) -> usizewhere
Self: Sized,
fn count(self) -> usizewhere
Self: Sized,
1.0.0 · source§fn last(self) -> Option<Self::Item>where
Self: Sized,
fn last(self) -> Option<Self::Item>where
Self: Sized,
source§fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>
fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>
iter_advance_by
)n
elements. Read more1.0.0 · source§fn nth(&mut self, n: usize) -> Option<Self::Item>
fn nth(&mut self, n: usize) -> Option<Self::Item>
n
th element of the iterator. Read more1.28.0 · source§fn step_by(self, step: usize) -> StepBy<Self>where
Self: Sized,
fn step_by(self, step: usize) -> StepBy<Self>where
Self: Sized,
1.0.0 · source§fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>
1.0.0 · source§fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where
Self: Sized,
U: IntoIterator,
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where
Self: Sized,
U: IntoIterator,
source§fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>
iter_intersperse
)separator
between adjacent items of the original iterator. Read more1.0.0 · source§fn map<B, F>(self, f: F) -> Map<Self, F>
fn map<B, F>(self, f: F) -> Map<Self, F>
1.0.0 · source§fn filter<P>(self, predicate: P) -> Filter<Self, P>
fn filter<P>(self, predicate: P) -> Filter<Self, P>
1.0.0 · source§fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
1.0.0 · source§fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
1.0.0 · source§fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
1.0.0 · source§fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
1.57.0 · source§fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>
1.0.0 · source§fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
n
elements. Read more1.0.0 · source§fn take(self, n: usize) -> Take<Self>where
Self: Sized,
fn take(self, n: usize) -> Take<Self>where
Self: Sized,
n
elements, or fewer
if the underlying iterator ends sooner. Read more1.0.0 · source§fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
source§fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>
fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>
iter_map_windows
)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. Read more1.0.0 · source§fn inspect<F>(self, f: F) -> Inspect<Self, F>
fn inspect<F>(self, f: F) -> Inspect<Self, F>
1.0.0 · source§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
source§fn collect_into<E>(self, collection: &mut E) -> &mut E
fn collect_into<E>(self, collection: &mut E) -> &mut E
iter_collect_into
)1.0.0 · source§fn partition<B, F>(self, f: F) -> (B, B)
fn partition<B, F>(self, f: F) -> (B, B)
source§fn is_partitioned<P>(self, predicate: P) -> bool
fn is_partitioned<P>(self, predicate: P) -> bool
iter_is_partitioned
)true
precede all those that return false
. Read more1.27.0 · source§fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
1.27.0 · source§fn try_for_each<F, R>(&mut self, f: F) -> R
fn try_for_each<F, R>(&mut self, f: F) -> R
1.0.0 · source§fn fold<B, F>(self, init: B, f: F) -> B
fn fold<B, F>(self, init: B, f: F) -> B
1.51.0 · source§fn reduce<F>(self, f: F) -> Option<Self::Item>
fn reduce<F>(self, f: F) -> Option<Self::Item>
source§fn try_reduce<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
fn try_reduce<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
iterator_try_reduce
)1.0.0 · source§fn all<F>(&mut self, f: F) -> bool
fn all<F>(&mut self, f: F) -> bool
1.0.0 · source§fn any<F>(&mut self, f: F) -> bool
fn any<F>(&mut self, f: F) -> bool
1.0.0 · source§fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
1.30.0 · source§fn find_map<B, F>(&mut self, f: F) -> Option<B>
fn find_map<B, F>(&mut self, f: F) -> Option<B>
source§fn try_find<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
fn try_find<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
try_find
)1.0.0 · source§fn position<P>(&mut self, predicate: P) -> Option<usize>
fn position<P>(&mut self, predicate: P) -> Option<usize>
1.6.0 · source§fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>
1.15.0 · source§fn max_by<F>(self, compare: F) -> Option<Self::Item>
fn max_by<F>(self, compare: F) -> Option<Self::Item>
1.6.0 · source§fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>
1.15.0 · source§fn min_by<F>(self, compare: F) -> Option<Self::Item>
fn min_by<F>(self, compare: F) -> Option<Self::Item>
1.0.0 · source§fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
1.36.0 · source§fn copied<'a, T>(self) -> Copied<Self>
fn copied<'a, T>(self) -> Copied<Self>
source§fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where
Self: Sized,
fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where
Self: Sized,
iter_array_chunks
)N
elements of the iterator at a time. Read more1.11.0 · source§fn product<P>(self) -> P
fn product<P>(self) -> P
source§fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
iter_order_by
)Iterator
with those
of another with respect to the specified comparison function. Read more1.5.0 · source§fn partial_cmp<I>(self, other: I) -> Option<Ordering>
fn partial_cmp<I>(self, other: I) -> Option<Ordering>
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. Read moresource§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>,
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>,
iter_order_by
)Iterator
with those
of another with respect to the specified comparison function. Read moresource§fn eq_by<I, F>(self, other: I, eq: F) -> bool
fn eq_by<I, F>(self, other: I, eq: F) -> bool
iter_order_by
)1.5.0 · source§fn lt<I>(self, other: I) -> bool
fn lt<I>(self, other: I) -> bool
Iterator
are lexicographically
less than those of another. Read more1.5.0 · source§fn le<I>(self, other: I) -> bool
fn le<I>(self, other: I) -> bool
Iterator
are lexicographically
less or equal to those of another. Read more1.5.0 · source§fn gt<I>(self, other: I) -> bool
fn gt<I>(self, other: I) -> bool
Iterator
are lexicographically
greater than those of another. Read more1.5.0 · source§fn ge<I>(self, other: I) -> bool
fn ge<I>(self, other: I) -> bool
Iterator
are lexicographically
greater than or equal to those of another. Read moresource§fn is_sorted_by<F>(self, compare: F) -> bool
fn is_sorted_by<F>(self, compare: F) -> bool
is_sorted
)source§fn is_sorted_by_key<F, K>(self, f: F) -> bool
fn is_sorted_by_key<F, K>(self, f: F) -> bool
is_sorted
)