# Enum sp_runtime::Either

``````pub enum Either<L, R> {
Left(L),
Right(R),
}``````
Expand description

The enum `Either` with variants `Left` and `Right` is a general purpose sum type with two cases.

The `Either` type is symmetric and treats its variants the same way, without preference. (For representing success or error, use the regular `Result` enum instead.)

## Variants§

§

### Left(L)

A value of type `L`.

§

### Right(R)

A value of type `R`.

## Implementations§

source§

### impl<L, R> Either<L, R>

source

#### pub fn is_left(&self) -> bool

Return true if the value is the `Left` variant.

``````use either::*;

let values = [Left(1), Right("the right value")];
assert_eq!(values[0].is_left(), true);
assert_eq!(values[1].is_left(), false);``````
source

#### pub fn is_right(&self) -> bool

Return true if the value is the `Right` variant.

``````use either::*;

let values = [Left(1), Right("the right value")];
assert_eq!(values[0].is_right(), false);
assert_eq!(values[1].is_right(), true);``````
source

#### pub fn left(self) -> Option<L>

Convert the left side of `Either<L, R>` to an `Option<L>`.

``````use either::*;

let left: Either<_, ()> = Left("some value");
assert_eq!(left.left(),  Some("some value"));

let right: Either<(), _> = Right(321);
assert_eq!(right.left(), None);``````
source

#### pub fn right(self) -> Option<R>

Convert the right side of `Either<L, R>` to an `Option<R>`.

``````use either::*;

let left: Either<_, ()> = Left("some value");
assert_eq!(left.right(),  None);

let right: Either<(), _> = Right(321);
assert_eq!(right.right(), Some(321));``````
source

#### pub fn as_ref(&self) -> Either<&L, &R> ⓘ

Convert `&Either<L, R>` to `Either<&L, &R>`.

``````use either::*;

let left: Either<_, ()> = Left("some value");
assert_eq!(left.as_ref(), Left(&"some value"));

let right: Either<(), _> = Right("some value");
assert_eq!(right.as_ref(), Right(&"some value"));``````
source

#### pub fn as_mut(&mut self) -> Either<&mut L, &mut R> ⓘ

Convert `&mut Either<L, R>` to `Either<&mut L, &mut R>`.

``````use either::*;

fn mutate_left(value: &mut Either<u32, u32>) {
if let Some(l) = value.as_mut().left() {
*l = 999;
}
}

let mut left = Left(123);
let mut right = Right(123);
mutate_left(&mut left);
mutate_left(&mut right);
assert_eq!(left, Left(999));
assert_eq!(right, Right(123));``````
source

#### pub fn as_pin_ref(self: Pin<&Either<L, R>>) -> Either<Pin<&L>, Pin<&R>> ⓘ

Convert `Pin<&Either<L, R>>` to `Either<Pin<&L>, Pin<&R>>`, pinned projections of the inner variants.

source

#### pub fn as_pin_mut( self: Pin<&mut Either<L, R>> ) -> Either<Pin<&mut L>, Pin<&mut R>> ⓘ

Convert `Pin<&mut Either<L, R>>` to `Either<Pin<&mut L>, Pin<&mut R>>`, pinned projections of the inner variants.

source

#### pub fn flip(self) -> Either<R, L> ⓘ

Convert `Either<L, R>` to `Either<R, L>`.

``````use either::*;

let left: Either<_, ()> = Left(123);
assert_eq!(left.flip(), Right(123));

let right: Either<(), _> = Right("some value");
assert_eq!(right.flip(), Left("some value"));``````
source

#### pub fn map_left<F, M>(self, f: F) -> Either<M, R> ⓘwhere F: FnOnce(L) -> M,

Apply the function `f` on the value in the `Left` variant if it is present rewrapping the result in `Left`.

``````use either::*;

let left: Either<_, u32> = Left(123);
assert_eq!(left.map_left(|x| x * 2), Left(246));

let right: Either<u32, _> = Right(123);
assert_eq!(right.map_left(|x| x * 2), Right(123));``````
source

#### pub fn map_right<F, S>(self, f: F) -> Either<L, S> ⓘwhere F: FnOnce(R) -> S,

Apply the function `f` on the value in the `Right` variant if it is present rewrapping the result in `Right`.

``````use either::*;

let left: Either<_, u32> = Left(123);
assert_eq!(left.map_right(|x| x * 2), Left(123));

let right: Either<u32, _> = Right(123);
assert_eq!(right.map_right(|x| x * 2), Right(246));``````
source

#### pub fn map_either<F, G, M, S>(self, f: F, g: G) -> Either<M, S> ⓘwhere F: FnOnce(L) -> M, G: FnOnce(R) -> S,

Apply the functions `f` and `g` to the `Left` and `Right` variants respectively. This is equivalent to bimap in functional programming.

``````use either::*;

let f = |s: String| s.len();
let g = |u: u8| u.to_string();

let left: Either<String, u8> = Left("loopy".into());
assert_eq!(left.map_either(f, g), Left(5));

let right: Either<String, u8> = Right(42);
assert_eq!(right.map_either(f, g), Right("42".into()));``````
source

#### pub fn map_either_with<Ctx, F, G, M, S>( self, ctx: Ctx, f: F, g: G ) -> Either<M, S> ⓘwhere F: FnOnce(Ctx, L) -> M, G: FnOnce(Ctx, R) -> S,

Similar to [`map_either`], with an added context `ctx` accessible to both functions.

``````use either::*;

let mut sum = 0;

// Both closures want to update the same value, so pass it as context.
let mut f = |sum: &mut usize, s: String| { *sum += s.len(); s.to_uppercase() };
let mut g = |sum: &mut usize, u: usize| { *sum += u; u.to_string() };

let left: Either<String, usize> = Left("loopy".into());
assert_eq!(left.map_either_with(&mut sum, &mut f, &mut g), Left("LOOPY".into()));

let right: Either<String, usize> = Right(42);
assert_eq!(right.map_either_with(&mut sum, &mut f, &mut g), Right("42".into()));

assert_eq!(sum, 47);``````
source

#### pub fn either<F, G, T>(self, f: F, g: G) -> Twhere F: FnOnce(L) -> T, G: FnOnce(R) -> T,

Apply one of two functions depending on contents, unifying their result. If the value is `Left(L)` then the first function `f` is applied; if it is `Right(R)` then the second function `g` is applied.

``````use either::*;

fn square(n: u32) -> i32 { (n * n) as i32 }
fn negate(n: i32) -> i32 { -n }

let left: Either<u32, i32> = Left(4);
assert_eq!(left.either(square, negate), 16);

let right: Either<u32, i32> = Right(-4);
assert_eq!(right.either(square, negate), 4);``````
source

#### pub fn either_with<Ctx, F, G, T>(self, ctx: Ctx, f: F, g: G) -> Twhere F: FnOnce(Ctx, L) -> T, G: FnOnce(Ctx, R) -> T,

Like `either`, but provide some context to whichever of the functions ends up being called.

``````// In this example, the context is a mutable reference
use either::*;

let mut result = Vec::new();

let values = vec![Left(2), Right(2.7)];

for value in values {
value.either_with(&mut result,
|ctx, integer| ctx.push(integer),
|ctx, real| ctx.push(f64::round(real) as i32));
}

assert_eq!(result, vec![2, 3]);``````
source

#### pub fn left_and_then<F, S>(self, f: F) -> Either<S, R> ⓘwhere F: FnOnce(L) -> Either<S, R>,

Apply the function `f` on the value in the `Left` variant if it is present.

``````use either::*;

let left: Either<_, u32> = Left(123);
assert_eq!(left.left_and_then::<_,()>(|x| Right(x * 2)), Right(246));

let right: Either<u32, _> = Right(123);
assert_eq!(right.left_and_then(|x| Right::<(), _>(x * 2)), Right(123));``````
source

#### pub fn right_and_then<F, S>(self, f: F) -> Either<L, S> ⓘwhere F: FnOnce(R) -> Either<L, S>,

Apply the function `f` on the value in the `Right` variant if it is present.

``````use either::*;

let left: Either<_, u32> = Left(123);
assert_eq!(left.right_and_then(|x| Right(x * 2)), Left(123));

let right: Either<u32, _> = Right(123);
assert_eq!(right.right_and_then(|x| Right(x * 2)), Right(246));``````
source

#### pub fn into_iter( self ) -> Either<<L as IntoIterator>::IntoIter, <R as IntoIterator>::IntoIter> ⓘwhere L: IntoIterator, R: IntoIterator<Item = <L as IntoIterator>::Item>,

Convert the inner value to an iterator.

``````use either::*;

let left: Either<_, Vec<u32>> = Left(vec![1, 2, 3, 4, 5]);
let mut right: Either<Vec<u32>, _> = Right(vec![]);
right.extend(left.into_iter());
assert_eq!(right, Right(vec![1, 2, 3, 4, 5]));``````
source

#### pub fn left_or(self, other: L) -> L

Return left value or given value

Arguments passed to `left_or` are eagerly evaluated; if you are passing the result of a function call, it is recommended to use `left_or_else`, which is lazily evaluated.

##### §Examples
``````let left: Either<&str, &str> = Left("left");
assert_eq!(left.left_or("foo"), "left");

let right: Either<&str, &str> = Right("right");
assert_eq!(right.left_or("left"), "left");``````
source

#### pub fn left_or_default(self) -> Lwhere L: Default,

Return left or a default

##### §Examples
``````let left: Either<String, u32> = Left("left".to_string());
assert_eq!(left.left_or_default(), "left");

let right: Either<String, u32> = Right(42);
assert_eq!(right.left_or_default(), String::default());``````
source

#### pub fn left_or_else<F>(self, f: F) -> Lwhere F: FnOnce(R) -> L,

Returns left value or computes it from a closure

##### §Examples
``````let left: Either<String, u32> = Left("3".to_string());
assert_eq!(left.left_or_else(|_| unreachable!()), "3");

let right: Either<String, u32> = Right(3);
assert_eq!(right.left_or_else(|x| x.to_string()), "3");``````
source

#### pub fn right_or(self, other: R) -> R

Return right value or given value

Arguments passed to `right_or` are eagerly evaluated; if you are passing the result of a function call, it is recommended to use `right_or_else`, which is lazily evaluated.

##### §Examples
``````let right: Either<&str, &str> = Right("right");
assert_eq!(right.right_or("foo"), "right");

let left: Either<&str, &str> = Left("left");
assert_eq!(left.right_or("right"), "right");``````
source

#### pub fn right_or_default(self) -> Rwhere R: Default,

Return right or a default

##### §Examples
``````let left: Either<String, u32> = Left("left".to_string());
assert_eq!(left.right_or_default(), u32::default());

let right: Either<String, u32> = Right(42);
assert_eq!(right.right_or_default(), 42);``````
source

#### pub fn right_or_else<F>(self, f: F) -> Rwhere F: FnOnce(L) -> R,

Returns right value or computes it from a closure

##### §Examples
``````let left: Either<String, u32> = Left("3".to_string());
assert_eq!(left.right_or_else(|x| x.parse().unwrap()), 3);

let right: Either<String, u32> = Right(3);
assert_eq!(right.right_or_else(|_| unreachable!()), 3);``````
source

#### pub fn unwrap_left(self) -> Lwhere R: Debug,

Returns the left value

##### §Examples
``````let left: Either<_, ()> = Left(3);
assert_eq!(left.unwrap_left(), 3);``````
##### §Panics

When `Either` is a `Right` value

``````let right: Either<(), _> = Right(3);
right.unwrap_left();``````
source

#### pub fn unwrap_right(self) -> Rwhere L: Debug,

Returns the right value

##### §Examples
``````let right: Either<(), _> = Right(3);
assert_eq!(right.unwrap_right(), 3);``````
##### §Panics

When `Either` is a `Left` value

``````let left: Either<_, ()> = Left(3);
left.unwrap_right();``````
source

#### pub fn expect_left(self, msg: &str) -> Lwhere R: Debug,

Returns the left value

##### §Examples
``````let left: Either<_, ()> = Left(3);
assert_eq!(left.expect_left("value was Right"), 3);``````
##### §Panics

When `Either` is a `Right` value

``````let right: Either<(), _> = Right(3);
right.expect_left("value was Right");``````
source

#### pub fn expect_right(self, msg: &str) -> Rwhere L: Debug,

Returns the right value

##### §Examples
``````let right: Either<(), _> = Right(3);
assert_eq!(right.expect_right("value was Left"), 3);``````
##### §Panics

When `Either` is a `Left` value

``````let left: Either<_, ()> = Left(3);
left.expect_right("value was Right");``````
source

#### pub fn either_into<T>(self) -> Twhere L: Into<T>, R: Into<T>,

Convert the contained value into `T`

##### §Examples
``````// Both u16 and u32 can be converted to u64.
let left: Either<u16, u32> = Left(3u16);
assert_eq!(left.either_into::<u64>(), 3u64);
let right: Either<u16, u32> = Right(7u32);
assert_eq!(right.either_into::<u64>(), 7u64);``````
source§

### impl<L, R> Either<Option<L>, Option<R>>

source

#### pub fn factor_none(self) -> Option<Either<L, R>>

Factors out `None` from an `Either` of `Option`.

``````use either::*;
let left: Either<_, Option<String>> = Left(Some(vec![0]));
assert_eq!(left.factor_none(), Some(Left(vec![0])));

let right: Either<Option<Vec<u8>>, _> = Right(Some(String::new()));
assert_eq!(right.factor_none(), Some(Right(String::new())));``````
source§

### impl<L, R, E> Either<Result<L, E>, Result<R, E>>

source

#### pub fn factor_err(self) -> Result<Either<L, R>, E>

Factors out a homogenous type from an `Either` of `Result`.

Here, the homogeneous type is the `Err` type of the `Result`.

``````use either::*;
let left: Either<_, Result<String, u32>> = Left(Ok(vec![0]));
assert_eq!(left.factor_err(), Ok(Left(vec![0])));

let right: Either<Result<Vec<u8>, u32>, _> = Right(Ok(String::new()));
assert_eq!(right.factor_err(), Ok(Right(String::new())));``````
source§

### impl<T, L, R> Either<Result<T, L>, Result<T, R>>

source

#### pub fn factor_ok(self) -> Result<T, Either<L, R>>

Factors out a homogenous type from an `Either` of `Result`.

Here, the homogeneous type is the `Ok` type of the `Result`.

``````use either::*;
let left: Either<_, Result<u32, String>> = Left(Err(vec![0]));
assert_eq!(left.factor_ok(), Err(Left(vec![0])));

let right: Either<Result<u32, Vec<u8>>, _> = Right(Err(String::new()));
assert_eq!(right.factor_ok(), Err(Right(String::new())));``````
source§

### impl<T, L, R> Either<(T, L), (T, R)>

source

#### pub fn factor_first(self) -> (T, Either<L, R>)

Factor out a homogeneous type from an either of pairs.

Here, the homogeneous type is the first element of the pairs.

``````use either::*;
let left: Either<_, (u32, String)> = Left((123, vec![0]));
assert_eq!(left.factor_first().0, 123);

let right: Either<(u32, Vec<u8>), _> = Right((123, String::new()));
assert_eq!(right.factor_first().0, 123);``````
source§

### impl<T, L, R> Either<(L, T), (R, T)>

source

#### pub fn factor_second(self) -> (Either<L, R>, T)

Factor out a homogeneous type from an either of pairs.

Here, the homogeneous type is the second element of the pairs.

``````use either::*;
let left: Either<_, (String, u32)> = Left((vec![0], 123));
assert_eq!(left.factor_second().1, 123);

let right: Either<(Vec<u8>, u32), _> = Right((String::new(), 123));
assert_eq!(right.factor_second().1, 123);``````
source§

### impl<T> Either<T, T>

source

#### pub fn into_inner(self) -> T

Extract the value of an either over two equivalent types.

``````use either::*;

let left: Either<_, u32> = Left(123);
assert_eq!(left.into_inner(), 123);

let right: Either<u32, _> = Right(123);
assert_eq!(right.into_inner(), 123);``````
source

#### pub fn map<F, M>(self, f: F) -> Either<M, M> ⓘwhere F: FnOnce(T) -> M,

Map `f` over the contained value and return the result in the corresponding variant.

``````use either::*;

let value: Either<_, i32> = Right(42);

let other = value.map(|x| x * 2);
assert_eq!(other, Right(84));``````

## Trait Implementations§

source§

### impl<L, R, Target> AsMut<[Target]> for Either<L, R>where L: AsMut<[Target]>, R: AsMut<[Target]>,

source§

#### fn as_mut(&mut self) -> &mut [Target]

Converts this type into a mutable reference of the (usually inferred) input type.
source§

### impl<L, R> AsMut<CStr> for Either<L, R>where L: AsMut<CStr>, R: AsMut<CStr>,

Requires crate feature `use_std`.

source§

#### fn as_mut(&mut self) -> &mut CStr

Converts this type into a mutable reference of the (usually inferred) input type.
source§

### impl<L, R> AsMut<OsStr> for Either<L, R>where L: AsMut<OsStr>, R: AsMut<OsStr>,

Requires crate feature `use_std`.

source§

#### fn as_mut(&mut self) -> &mut OsStr

Converts this type into a mutable reference of the (usually inferred) input type.
source§

### impl<L, R> AsMut<Path> for Either<L, R>where L: AsMut<Path>, R: AsMut<Path>,

Requires crate feature `use_std`.

source§

#### fn as_mut(&mut self) -> &mut Path

Converts this type into a mutable reference of the (usually inferred) input type.
source§

### impl<L, R, Target> AsMut<Target> for Either<L, R>where L: AsMut<Target>, R: AsMut<Target>,

source§

#### fn as_mut(&mut self) -> &mut Target

Converts this type into a mutable reference of the (usually inferred) input type.
source§

### impl<L, R> AsMut<str> for Either<L, R>where L: AsMut<str>, R: AsMut<str>,

source§

#### fn as_mut(&mut self) -> &mut str

Converts this type into a mutable reference of the (usually inferred) input type.
source§

### impl<L, R, Target> AsRef<[Target]> for Either<L, R>where L: AsRef<[Target]>, R: AsRef<[Target]>,

source§

#### fn as_ref(&self) -> &[Target]

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

### impl<L, R> AsRef<CStr> for Either<L, R>where L: AsRef<CStr>, R: AsRef<CStr>,

Requires crate feature `use_std`.

source§

#### fn as_ref(&self) -> &CStr

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

### impl<L, R> AsRef<OsStr> for Either<L, R>where L: AsRef<OsStr>, R: AsRef<OsStr>,

Requires crate feature `use_std`.

source§

#### fn as_ref(&self) -> &OsStr

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

### impl<L, R> AsRef<Path> for Either<L, R>where L: AsRef<Path>, R: AsRef<Path>,

Requires crate feature `use_std`.

source§

#### fn as_ref(&self) -> &Path

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

### impl<L, R, Target> AsRef<Target> for Either<L, R>where L: AsRef<Target>, R: AsRef<Target>,

source§

#### fn as_ref(&self) -> &Target

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

### impl<L, R> AsRef<str> for Either<L, R>where L: AsRef<str>, R: AsRef<str>,

source§

#### fn as_ref(&self) -> &str

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

Requires crate feature `"use_std"`

source§

#### fn fill_buf(&mut self) -> Result<&[u8], Error>

Returns the contents of the internal buffer, filling it with more data from the inner reader if it is empty. Read more
source§

#### fn consume(&mut self, amt: usize)

Tells this buffer that `amt` bytes have been consumed from the buffer, so they should no longer be returned in calls to `read`. Read more
source§

#### fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

Read all bytes into `buf` until the delimiter `byte` or EOF is reached. Read more
source§

#### fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

Read all bytes until a newline (the `0xA` byte) is reached, and append them to the provided `String` buffer. Read more
source§

#### fn has_data_left(&mut self) -> Result<bool, Error>

🔬This is a nightly-only experimental API. (`buf_read_has_data_left`)
Check if the underlying `Read` has any data left to be read. Read more
source§

#### fn skip_until(&mut self, byte: u8) -> Result<usize, Error>

🔬This is a nightly-only experimental API. (`bufread_skip_until`)
Skip all bytes until the delimiter `byte` or EOF is reached. Read more
1.0.0 · source§

#### fn split(self, byte: u8) -> Split<Self>where Self: Sized,

Returns an iterator over the contents of this reader split on the byte `byte`. Read more
1.0.0 · source§

source§

### impl<L, R> Clone for Either<L, R>where L: Clone, R: Clone,

source§

#### fn clone(&self) -> Either<L, R> ⓘ

Returns a copy of the value. Read more
source§

#### fn clone_from(&mut self, source: &Either<L, R>)

Performs copy-assignment from `source`. Read more
source§

### impl<L, R> Debug for Either<L, R>where L: Debug, R: Debug,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<L, R> Deref for Either<L, R>where L: Deref, R: Deref<Target = <L as Deref>::Target>,

§

#### type Target = <L as Deref>::Target

The resulting type after dereferencing.
source§

#### fn deref(&self) -> &<Either<L, R> as Deref>::Targetⓘ

Dereferences the value.
source§

### impl<L, R> DerefMut for Either<L, R>where L: DerefMut, R: DerefMut<Target = <L as Deref>::Target>,

source§

#### fn deref_mut(&mut self) -> &mut <Either<L, R> as Deref>::Targetⓘ

Mutably dereferences the value.
source§

### impl<L, R> Display for Either<L, R>where L: Display, R: Display,

source§

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

Formats the value using the given formatter. Read more
source§

### impl<L, R> DoubleEndedIterator for Either<L, R>where L: DoubleEndedIterator, R: DoubleEndedIterator<Item = <L as Iterator>::Item>,

source§

#### fn next_back(&mut self) -> Option<<Either<L, R> as Iterator>::Item>

Removes and returns an element from the end of the iterator. Read more
source§

#### fn rfold<Acc, G>(self, init: Acc, f: G) -> Accwhere G: FnMut(Acc, <Either<L, R> as Iterator>::Item) -> Acc,

An iterator method that reduces the iterator’s elements to a single, final value, starting from the back. Read more
source§

#### fn rfind<P>(&mut self, predicate: P) -> Option<<Either<L, R> as Iterator>::Item>where P: FnMut(&<Either<L, R> as Iterator>::Item) -> bool,

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

#### 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. Read more
1.37.0 · source§

#### fn nth_back(&mut self, n: usize) -> Option<Self::Item>

Returns the `n`th element from the end of the iterator. Read more
1.27.0 · source§

#### fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> Rwhere 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. Read more
source§

### impl<L, R> Error for Either<L, R>where L: Error, R: Error,

`Either` implements `Error` if both `L` and `R` implement it.

source§

#### fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
source§

#### fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
source§

#### fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

#### fn provide<'a>(&'a self, request: &mut Request<'a>)

🔬This is a nightly-only experimental API. (`error_generic_member_access`)
source§

### impl<L, R> ExactSizeIterator for Either<L, R>where L: ExactSizeIterator, R: ExactSizeIterator<Item = <L as Iterator>::Item>,

source§

#### fn len(&self) -> usize

Returns the exact remaining length of the iterator. Read more
source§

#### fn is_empty(&self) -> bool

🔬This is a nightly-only experimental API. (`exact_size_is_empty`)
Returns `true` if the iterator is empty. Read more
source§

### impl<L, R, A> Extend<A> for Either<L, R>where L: Extend<A>, R: Extend<A>,

source§

#### fn extend<T>(&mut self, iter: T)where T: IntoIterator<Item = A>,

Extends a collection with the contents of an iterator. Read more
source§

#### fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (`extend_one`)
Extends a collection with exactly one element.
source§

#### fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (`extend_one`)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

### impl<L, R> From<Result<R, L>> for Either<L, R>

Convert from `Result` to `Either` with `Ok => Right` and `Err => Left`.

source§

#### fn from(r: Result<R, L>) -> Either<L, R> ⓘ

Converts to this type from the input type.
source§

### impl<L, R> Future for Either<L, R>where L: Future, R: Future<Output = <L as Future>::Output>,

`Either<L, R>` is a future if both `L` and `R` are futures.

§

#### type Output = <L as Future>::Output

The type of value produced on completion.
source§

#### fn poll( self: Pin<&mut Either<L, R>>, cx: &mut Context<'_> ) -> Poll<<Either<L, R> as Future>::Output>

Attempt to resolve the future to a final value, registering the current task for wakeup if the value is not yet available. Read more
source§

### impl<L, R> Hash for Either<L, R>where L: Hash, R: Hash,

source§

#### fn hash<__H>(&self, state: &mut __H)where __H: Hasher,

Feeds this value into the given `Hasher`. Read more
1.3.0 · source§

#### fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given `Hasher`. Read more
§

### impl<L, R> IndexedParallelIterator for Either<L, R>where L: IndexedParallelIterator, R: IndexedParallelIterator<Item = <L as ParallelIterator>::Item>,

§

#### fn drive<C>( self, consumer: C ) -> <C as Consumer<<Either<L, R> as ParallelIterator>::Item>>::Resultwhere C: Consumer<<Either<L, R> as ParallelIterator>::Item>,

Internal method used to define the behavior of this parallel iterator. You should not need to call this directly. Read more
§

#### fn len(&self) -> usize

Produces an exact count of how many items this iterator will produce, presuming no panic occurs. Read more
§

#### fn with_producer<CB>( self, callback: CB ) -> <CB as ProducerCallback<<Either<L, R> as ParallelIterator>::Item>>::Outputwhere CB: ProducerCallback<<Either<L, R> as ParallelIterator>::Item>,

Internal method used to define the behavior of this parallel iterator. You should not need to call this directly. Read more
§

#### fn by_exponential_blocks(self) -> ExponentialBlocks<Self>

Divides an iterator into sequential blocks of exponentially-increasing size. Read more
§

#### fn by_uniform_blocks(self, block_size: usize) -> UniformBlocks<Self>

Divides an iterator into sequential blocks of the given size. Read more
§

#### fn collect_into_vec(self, target: &mut Vec<Self::Item>)

Collects the results of the iterator into the specified vector. The vector is always cleared before execution begins. If possible, reusing the vector across calls can lead to better performance since it reuses the same backing buffer. Read more
§

#### fn unzip_into_vecs<A, B>(self, left: &mut Vec<A>, right: &mut Vec<B>)where Self: IndexedParallelIterator<Item = (A, B)>, A: Send, B: Send,

Unzips the results of the iterator into the specified vectors. The vectors are always cleared before execution begins. If possible, reusing the vectors across calls can lead to better performance since they reuse the same backing buffer. Read more
§

#### fn zip<Z>(self, zip_op: Z) -> Zip<Self, <Z as IntoParallelIterator>::Iter>where Z: IntoParallelIterator, <Z as IntoParallelIterator>::Iter: IndexedParallelIterator,

Iterates over tuples `(A, B)`, where the items `A` are from this iterator and `B` are from the iterator given as argument. Like the `zip` method on ordinary iterators, if the two iterators are of unequal length, you only get the items they have in common. Read more
§

#### fn zip_eq<Z>(self, zip_op: Z) -> ZipEq<Self, <Z as IntoParallelIterator>::Iter>where Z: IntoParallelIterator, <Z as IntoParallelIterator>::Iter: IndexedParallelIterator,

The same as `Zip`, but requires that both iterators have the same length. Read more
§

#### fn interleave<I>( self, other: I ) -> Interleave<Self, <I as IntoParallelIterator>::Iter>where I: IntoParallelIterator<Item = Self::Item>, <I as IntoParallelIterator>::Iter: IndexedParallelIterator<Item = Self::Item>,

Interleaves elements of this iterator and the other given iterator. Alternately yields elements from this iterator and the given iterator, until both are exhausted. If one iterator is exhausted before the other, the last elements are provided from the other. Read more
§

#### fn interleave_shortest<I>( self, other: I ) -> InterleaveShortest<Self, <I as IntoParallelIterator>::Iter>where I: IntoParallelIterator<Item = Self::Item>, <I as IntoParallelIterator>::Iter: IndexedParallelIterator<Item = Self::Item>,

Interleaves elements of this iterator and the other given iterator, until one is exhausted. Read more
§

#### fn chunks(self, chunk_size: usize) -> Chunks<Self>

Splits an iterator up into fixed-size chunks. Read more
§

#### fn fold_chunks<T, ID, F>( self, chunk_size: usize, identity: ID, fold_op: F ) -> FoldChunks<Self, ID, F>where ID: Fn() -> T + Send + Sync, F: Fn(T, Self::Item) -> T + Send + Sync, T: Send,

Splits an iterator into fixed-size chunks, performing a sequential `fold()` on each chunk. Read more
§

#### fn fold_chunks_with<T, F>( self, chunk_size: usize, init: T, fold_op: F ) -> FoldChunksWith<Self, T, F>where T: Send + Clone, F: Fn(T, Self::Item) -> T + Send + Sync,

Splits an iterator into fixed-size chunks, performing a sequential `fold()` on each chunk. Read more
§

#### fn partial_cmp<I>(self, other: I) -> Option<Ordering>where I: IntoParallelIterator, <I as IntoParallelIterator>::Iter: IndexedParallelIterator, Self::Item: PartialOrd<<I as IntoParallelIterator>::Item>,

Lexicographically compares the elements of this `ParallelIterator` with those of another. Read more
§

#### fn eq<I>(self, other: I) -> boolwhere I: IntoParallelIterator, <I as IntoParallelIterator>::Iter: IndexedParallelIterator, Self::Item: PartialEq<<I as IntoParallelIterator>::Item>,

Determines if the elements of this `ParallelIterator` are equal to those of another
§

#### fn ne<I>(self, other: I) -> boolwhere I: IntoParallelIterator, <I as IntoParallelIterator>::Iter: IndexedParallelIterator, Self::Item: PartialEq<<I as IntoParallelIterator>::Item>,

Determines if the elements of this `ParallelIterator` are unequal to those of another
§

#### fn lt<I>(self, other: I) -> boolwhere I: IntoParallelIterator, <I as IntoParallelIterator>::Iter: IndexedParallelIterator, Self::Item: PartialOrd<<I as IntoParallelIterator>::Item>,

Determines if the elements of this `ParallelIterator` are lexicographically less than those of another.
§

#### fn le<I>(self, other: I) -> boolwhere I: IntoParallelIterator, <I as IntoParallelIterator>::Iter: IndexedParallelIterator, Self::Item: PartialOrd<<I as IntoParallelIterator>::Item>,

Determines if the elements of this `ParallelIterator` are less or equal to those of another.
§

#### fn gt<I>(self, other: I) -> boolwhere I: IntoParallelIterator, <I as IntoParallelIterator>::Iter: IndexedParallelIterator, Self::Item: PartialOrd<<I as IntoParallelIterator>::Item>,

Determines if the elements of this `ParallelIterator` are lexicographically greater than those of another.
§

#### fn ge<I>(self, other: I) -> boolwhere I: IntoParallelIterator, <I as IntoParallelIterator>::Iter: IndexedParallelIterator, Self::Item: PartialOrd<<I as IntoParallelIterator>::Item>,

Determines if the elements of this `ParallelIterator` are less or equal to those of another.
§

#### fn enumerate(self) -> Enumerate<Self>

Yields an index along with each item. Read more
§

#### fn step_by(self, step: usize) -> StepBy<Self>

Creates an iterator that steps by the given amount Read more
§

#### fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first `n` elements. Read more
§

#### fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields the first `n` elements. Read more
§

#### fn position_any<P>(self, predicate: P) -> Option<usize>where P: Fn(Self::Item) -> bool + Sync + Send,

Searches for some item in the parallel iterator that matches the given predicate, and returns its index. Like `ParallelIterator::find_any`, the parallel search will not necessarily find the first match, and once a match is found we’ll attempt to stop processing any more. Read more
§

#### fn position_first<P>(self, predicate: P) -> Option<usize>where P: Fn(Self::Item) -> bool + Sync + Send,

Searches for the sequentially first item in the parallel iterator that matches the given predicate, and returns its index. Read more
§

#### fn position_last<P>(self, predicate: P) -> Option<usize>where P: Fn(Self::Item) -> bool + Sync + Send,

Searches for the sequentially last item in the parallel iterator that matches the given predicate, and returns its index. Read more
§

#### fn positions<P>(self, predicate: P) -> Positions<Self, P>where P: Fn(Self::Item) -> bool + Sync + Send,

Searches for items in the parallel iterator that match the given predicate, and returns their indices. Read more
§

#### fn rev(self) -> Rev<Self>

Produces a new iterator with the elements of this iterator in reverse order. Read more
§

#### fn with_min_len(self, min: usize) -> MinLen<Self>

Sets the minimum length of iterators desired to process in each rayon job. Rayon will not split any smaller than this length, but of course an iterator could already be smaller to begin with. Read more
§

#### fn with_max_len(self, max: usize) -> MaxLen<Self>

Sets the maximum length of iterators desired to process in each rayon job. Rayon will try to split at least below this length, unless that would put it below the length from `with_min_len()`. For example, given min=10 and max=15, a length of 16 will not be split any further. Read more
source§

### impl<L, R> Into<Result<R, L>> for Either<L, R>

Convert from `Either` to `Result` with `Right => Ok` and `Left => Err`.

source§

#### fn into(self) -> Result<R, L>

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

### impl<L, R> Iterator for Either<L, R>where L: Iterator, R: Iterator<Item = <L as Iterator>::Item>,

`Either<L, R>` is an iterator if both `L` and `R` are iterators.

§

#### type Item = <L as Iterator>::Item

The type of the elements being iterated over.
source§

source§

#### fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more
source§

#### fn fold<Acc, G>(self, init: Acc, f: G) -> Accwhere G: FnMut(Acc, <Either<L, R> as Iterator>::Item) -> Acc,

Folds every element into an accumulator by applying an operation, returning the final result. Read more
source§

#### fn for_each<F>(self, f: F)where F: FnMut(<Either<L, R> as Iterator>::Item),

Calls a closure on each element of an iterator. Read more
source§

#### fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it. Read more
source§

#### fn last(self) -> Option<<Either<L, R> as Iterator>::Item>

Consumes the iterator, returning the last element. Read more
source§

#### fn nth(&mut self, n: usize) -> Option<<Either<L, R> as Iterator>::Item>

Returns the `n`th element of the iterator. Read more
source§

#### fn collect<B>(self) -> Bwhere B: FromIterator<<Either<L, R> as Iterator>::Item>,

Transforms an iterator into a collection. Read more
source§

#### fn partition<B, F>(self, f: F) -> (B, B)where B: Default + Extend<<Either<L, R> as Iterator>::Item>, F: FnMut(&<Either<L, R> as Iterator>::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more
source§

#### fn all<F>(&mut self, f: F) -> boolwhere F: FnMut(<Either<L, R> as Iterator>::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more
source§

#### fn any<F>(&mut self, f: F) -> boolwhere F: FnMut(<Either<L, R> as Iterator>::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more
source§

#### fn find<P>(&mut self, predicate: P) -> Option<<Either<L, R> as Iterator>::Item>where P: FnMut(&<Either<L, R> as Iterator>::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate. Read more
source§

#### fn find_map<B, F>(&mut self, f: F) -> Option<B>where F: FnMut(<Either<L, R> as Iterator>::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result. Read more
source§

#### fn position<P>(&mut self, predicate: P) -> Option<usize>where P: FnMut(<Either<L, R> as Iterator>::Item) -> bool,

Searches for an element in an iterator, returning its index. Read more
source§

#### 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. Read more
source§

#### 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. Read more
1.28.0 · source§

#### 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. Read more
1.0.0 · source§

#### 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. Read more
1.0.0 · source§

#### 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. Read more
source§

#### 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. Read more
1.0.0 · source§

#### 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. Read more
1.0.0 · source§

#### 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. Read more
1.0.0 · source§

#### 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. Read more
1.0.0 · source§

#### fn enumerate(self) -> Enumerate<Self>where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value. Read more
1.0.0 · source§

#### 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. Read more
1.0.0 · source§

#### fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that `skip`s elements based on a predicate. Read more
1.0.0 · source§

#### 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. Read more
1.57.0 · source§

#### 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. Read more
1.0.0 · source§

#### fn skip(self, n: usize) -> Skip<Self>where Self: Sized,

Creates an iterator that skips the first `n` elements. Read more
1.0.0 · source§

#### 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. Read more
1.0.0 · source§

#### 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. Read more
1.0.0 · source§

#### 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. Read more
source§

#### 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. Read more
1.0.0 · source§

#### fn fuse(self) -> Fuse<Self>where Self: Sized,

Creates an iterator which ends after the first `None`. Read more
1.0.0 · source§

#### 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. Read more
1.0.0 · source§

#### fn by_ref(&mut self) -> &mut Selfwhere Self: Sized,

Borrows an iterator, rather than consuming it. Read more
source§

#### fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere 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. Read more
source§

#### fn is_partitioned<P>(self, predicate: P) -> boolwhere 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`. Read more
1.27.0 · source§

#### fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere 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. Read more
1.27.0 · source§

#### fn try_for_each<F, R>(&mut self, f: F) -> Rwhere 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. Read more
1.51.0 · source§

#### 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. Read more
source§

#### fn try_reduce<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere Self: Sized, F: FnMut(Self::Item, Self::Item) -> R, 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. Read more
source§

#### fn try_find<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere Self: Sized, F: FnMut(&Self::Item) -> R, 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. Read more
1.6.0 · source§

#### 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. Read more
1.15.0 · source§

#### 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. Read more
1.6.0 · source§

#### 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. Read more
1.15.0 · source§

#### 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. Read more
1.0.0 · source§

#### 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. Read more
1.36.0 · source§

#### 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. Read more
1.0.0 · source§

#### fn cloned<'a, T>(self) -> Cloned<Self>where T: 'a + Clone, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which `clone`s all of its elements. Read more
source§

#### 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. Read more
1.11.0 · source§

#### fn sum<S>(self) -> Swhere Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator. Read more
1.11.0 · source§

#### fn product<P>(self) -> Pwhere Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more
source§

#### fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere 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. Read more
1.5.0 · source§

#### 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. Read more
source§

#### 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. Read more
1.5.0 · source§

#### fn eq<I>(self, other: I) -> boolwhere I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this `Iterator` are equal to those of another. Read more
source§

#### fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere 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. Read more
1.5.0 · source§

#### fn ne<I>(self, other: I) -> boolwhere 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. Read more
1.5.0 · source§

#### fn lt<I>(self, other: I) -> boolwhere 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. Read more
1.5.0 · source§

#### fn le<I>(self, other: I) -> boolwhere 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. Read more
1.5.0 · source§

#### fn gt<I>(self, other: I) -> boolwhere 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. Read more
1.5.0 · source§

#### fn ge<I>(self, other: I) -> boolwhere 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. Read more
source§

#### fn is_sorted_by<F>(self, compare: F) -> boolwhere Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬This is a nightly-only experimental API. (`is_sorted`)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

#### fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

🔬This is a nightly-only experimental API. (`is_sorted`)
Checks if the elements of this iterator are sorted using the given key extraction function. Read more
source§

### impl<L, R> Ord for Either<L, R>where L: Ord, R: Ord,

source§

#### fn cmp(&self, other: &Either<L, R>) -> Ordering

This method returns an `Ordering` between `self` and `other`. Read more
1.21.0 · source§

#### fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

#### fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

#### fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
§

### impl<L, R, T> ParallelExtend<T> for Either<L, R>where L: ParallelExtend<T>, R: ParallelExtend<T>, T: Send,

`Either<L, R>` can be extended if both `L` and `R` are parallel extendable.

§

#### fn par_extend<I>(&mut self, par_iter: I)where I: IntoParallelIterator<Item = T>,

Extends an instance of the collection with the elements drawn from the parallel iterator `par_iter`. Read more
§

### impl<L, R> ParallelIterator for Either<L, R>where L: ParallelIterator, R: ParallelIterator<Item = <L as ParallelIterator>::Item>,

`Either<L, R>` is a parallel iterator if both `L` and `R` are parallel iterators.

§

#### type Item = <L as ParallelIterator>::Item

The type of item that this parallel iterator produces. For example, if you use the `for_each` method, this is the type of item that your closure will be invoked with.
§

#### fn drive_unindexed<C>( self, consumer: C ) -> <C as Consumer<<Either<L, R> as ParallelIterator>::Item>>::Resultwhere C: UnindexedConsumer<<Either<L, R> as ParallelIterator>::Item>,

Internal method used to define the behavior of this parallel iterator. You should not need to call this directly. Read more
§

#### fn opt_len(&self) -> Option<usize>

Internal method used to define the behavior of this parallel iterator. You should not need to call this directly. Read more
§

#### fn for_each<OP>(self, op: OP)where OP: Fn(Self::Item) + Sync + Send,

Executes `OP` on each item produced by the iterator, in parallel. Read more
§

#### fn for_each_with<OP, T>(self, init: T, op: OP)where OP: Fn(&mut T, Self::Item) + Sync + Send, T: Send + Clone,

Executes `OP` on the given `init` value with each item produced by the iterator, in parallel. Read more
§

#### fn for_each_init<OP, INIT, T>(self, init: INIT, op: OP)where OP: Fn(&mut T, Self::Item) + Sync + Send, INIT: Fn() -> T + Sync + Send,

Executes `OP` on a value returned by `init` with each item produced by the iterator, in parallel. Read more
§

#### fn try_for_each<OP, R>(self, op: OP) -> Rwhere OP: Fn(Self::Item) -> R + Sync + Send, R: Try<Output = ()> + Send,

Executes a fallible `OP` on each item produced by the iterator, in parallel. Read more
§

#### fn try_for_each_with<OP, T, R>(self, init: T, op: OP) -> Rwhere OP: Fn(&mut T, Self::Item) -> R + Sync + Send, T: Send + Clone, R: Try<Output = ()> + Send,

Executes a fallible `OP` on the given `init` value with each item produced by the iterator, in parallel. Read more
§

#### fn try_for_each_init<OP, INIT, T, R>(self, init: INIT, op: OP) -> Rwhere OP: Fn(&mut T, Self::Item) -> R + Sync + Send, INIT: Fn() -> T + Sync + Send, R: Try<Output = ()> + Send,

Executes a fallible `OP` on a value returned by `init` with each item produced by the iterator, in parallel. Read more
§

#### fn count(self) -> usize

Counts the number of items in this parallel iterator. Read more
§

#### fn map<F, R>(self, map_op: F) -> Map<Self, F>where F: Fn(Self::Item) -> R + Sync + Send, R: Send,

Applies `map_op` to each item of this iterator, producing a new iterator with the results. Read more
§

#### fn map_with<F, T, R>(self, init: T, map_op: F) -> MapWith<Self, T, F>where F: Fn(&mut T, Self::Item) -> R + Sync + Send, T: Send + Clone, R: Send,

Applies `map_op` to the given `init` value with each item of this iterator, producing a new iterator with the results. Read more
§

#### fn map_init<F, INIT, T, R>( self, init: INIT, map_op: F ) -> MapInit<Self, INIT, F>where F: Fn(&mut T, Self::Item) -> R + Sync + Send, INIT: Fn() -> T + Sync + Send, R: Send,

Applies `map_op` to a value returned by `init` with each item of this iterator, producing a new iterator with the results. Read more
§

#### fn cloned<'a, T>(self) -> Cloned<Self>where T: 'a + Clone + Send, Self: ParallelIterator<Item = &'a T>,

Creates an iterator which clones all of its elements. This may be useful when you have an iterator over `&T`, but you need `T`, and that type implements `Clone`. See also `copied()`. Read more
§

#### fn copied<'a, T>(self) -> Copied<Self>where T: 'a + Copy + Send, Self: ParallelIterator<Item = &'a T>,

Creates an iterator which copies all of its elements. This may be useful when you have an iterator over `&T`, but you need `T`, and that type implements `Copy`. See also `cloned()`. Read more
§

#### fn inspect<OP>(self, inspect_op: OP) -> Inspect<Self, OP>where OP: Fn(&Self::Item) + Sync + Send,

Applies `inspect_op` to a reference to each item of this iterator, producing a new iterator passing through the original items. This is often useful for debugging to see what’s happening in iterator stages. Read more
§

#### fn update<F>(self, update_op: F) -> Update<Self, F>where F: Fn(&mut Self::Item) + Sync + Send,

Mutates each item of this iterator before yielding it. Read more
§

#### fn filter<P>(self, filter_op: P) -> Filter<Self, P>where P: Fn(&Self::Item) -> bool + Sync + Send,

Applies `filter_op` to each item of this iterator, producing a new iterator with only the items that gave `true` results. Read more
§

#### fn filter_map<P, R>(self, filter_op: P) -> FilterMap<Self, P>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,

Applies `filter_op` to each item of this iterator to get an `Option`, producing a new iterator with only the items from `Some` results. Read more
§

#### fn flat_map<F, PI>(self, map_op: F) -> FlatMap<Self, F>where F: Fn(Self::Item) -> PI + Sync + Send, PI: IntoParallelIterator,

Applies `map_op` to each item of this iterator to get nested parallel iterators, producing a new parallel iterator that flattens these back into one. Read more
§

#### fn flat_map_iter<F, SI>(self, map_op: F) -> FlatMapIter<Self, F>where F: Fn(Self::Item) -> SI + Sync + Send, SI: IntoIterator, <SI as IntoIterator>::Item: Send,

Applies `map_op` to each item of this iterator to get nested serial iterators, producing a new parallel iterator that flattens these back into one. Read more
§

#### fn reduce<OP, ID>(self, identity: ID, op: OP) -> Self::Itemwhere OP: Fn(Self::Item, Self::Item) -> Self::Item + Sync + Send, ID: Fn() -> Self::Item + Sync + Send,

Reduces the items in the iterator into one item using `op`. The argument `identity` should be a closure that can produce “identity” value which may be inserted into the sequence as needed to create opportunities for parallel execution. So, for example, if you are doing a summation, then `identity()` ought to produce something that represents the zero for your type (but consider just calling `sum()` in that case). Read more
§

#### fn reduce_with<OP>(self, op: OP) -> Option<Self::Item>where OP: Fn(Self::Item, Self::Item) -> Self::Item + Sync + Send,

Reduces the items in the iterator into one item using `op`. If the iterator is empty, `None` is returned; otherwise, `Some` is returned. Read more
§

#### fn fold<T, ID, F>(self, identity: ID, fold_op: F) -> Fold<Self, ID, F>where F: Fn(T, Self::Item) -> T + Sync + Send, ID: Fn() -> T + Sync + Send, T: Send,

Parallel fold is similar to sequential fold except that the sequence of items may be subdivided before it is folded. Consider a list of numbers like `22 3 77 89 46`. If you used sequential fold to add them (`fold(0, |a,b| a+b)`, you would wind up first adding 0 + 22, then 22 + 3, then 25 + 77, and so forth. The parallel fold works similarly except that it first breaks up your list into sublists, and hence instead of yielding up a single sum at the end, it yields up multiple sums. The number of results is nondeterministic, as is the point where the breaks occur. Read more
§

#### fn fold_with<F, T>(self, init: T, fold_op: F) -> FoldWith<Self, T, F>where F: Fn(T, Self::Item) -> T + Sync + Send, T: Send + Clone,

Applies `fold_op` to the given `init` value with each item of this iterator, finally producing the value for further use. Read more
§

#### fn try_fold<T, R, ID, F>( self, identity: ID, fold_op: F ) -> TryFold<Self, R, ID, F>where F: Fn(T, Self::Item) -> R + Sync + Send, ID: Fn() -> T + Sync + Send, R: Try<Output = T> + Send,

Performs a fallible parallel fold. Read more
§

#### fn try_fold_with<F, T, R>(self, init: T, fold_op: F) -> TryFoldWith<Self, R, F>where F: Fn(T, Self::Item) -> R + Sync + Send, R: Try<Output = T> + Send, T: Clone + Send,

Performs a fallible parallel fold with a cloneable `init` value. Read more
§

#### fn sum<S>(self) -> Swhere S: Send + Sum<Self::Item> + Sum,

Sums up the items in the iterator. Read more
§

#### fn product<P>(self) -> Pwhere P: Send + Product<Self::Item> + Product,

Multiplies all the items in the iterator. Read more
§

#### fn min_by<F>(self, f: F) -> Option<Self::Item>where F: Sync + Send + Fn(&Self::Item, &Self::Item) -> Ordering,

Computes the minimum of all the items in the iterator with respect to the given comparison function. If the iterator is empty, `None` is returned; otherwise, `Some(min)` is returned. Read more
§

#### fn min_by_key<K, F>(self, f: F) -> Option<Self::Item>where K: Ord + Send, F: Sync + Send + Fn(&Self::Item) -> K,

Computes the item that yields the minimum value for the given function. If the iterator is empty, `None` is returned; otherwise, `Some(item)` is returned. Read more
§

#### fn max_by<F>(self, f: F) -> Option<Self::Item>where F: Sync + Send + Fn(&Self::Item, &Self::Item) -> Ordering,

Computes the maximum of all the items in the iterator with respect to the given comparison function. If the iterator is empty, `None` is returned; otherwise, `Some(max)` is returned. Read more
§

#### fn max_by_key<K, F>(self, f: F) -> Option<Self::Item>where K: Ord + Send, F: Sync + Send + Fn(&Self::Item) -> K,

Computes the item that yields the maximum value for the given function. If the iterator is empty, `None` is returned; otherwise, `Some(item)` is returned. Read more
§

#### fn chain<C>(self, chain: C) -> Chain<Self, <C as IntoParallelIterator>::Iter>where C: IntoParallelIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both. Read more
§

#### fn find_any<P>(self, predicate: P) -> Option<Self::Item>where P: Fn(&Self::Item) -> bool + Sync + Send,

Searches for some item in the parallel iterator that matches the given predicate and returns it. This operation is similar to `find` on sequential iterators but the item returned may not be the first one in the parallel sequence which matches, since we search the entire sequence in parallel. Read more
§

#### fn find_first<P>(self, predicate: P) -> Option<Self::Item>where P: Fn(&Self::Item) -> bool + Sync + Send,

Searches for the sequentially first item in the parallel iterator that matches the given predicate and returns it. Read more
§

#### fn find_last<P>(self, predicate: P) -> Option<Self::Item>where P: Fn(&Self::Item) -> bool + Sync + Send,

Searches for the sequentially last item in the parallel iterator that matches the given predicate and returns it. Read more
§

#### fn find_map_any<P, R>(self, predicate: P) -> Option<R>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,

Applies the given predicate to the items in the parallel iterator and returns any non-None result of the map operation. Read more
§

#### fn find_map_first<P, R>(self, predicate: P) -> Option<R>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,

Applies the given predicate to the items in the parallel iterator and returns the sequentially first non-None result of the map operation. Read more
§

#### fn find_map_last<P, R>(self, predicate: P) -> Option<R>where P: Fn(Self::Item) -> Option<R> + Sync + Send, R: Send,

Applies the given predicate to the items in the parallel iterator and returns the sequentially last non-None result of the map operation. Read more
§

#### fn any<P>(self, predicate: P) -> boolwhere P: Fn(Self::Item) -> bool + Sync + Send,

Searches for some item in the parallel iterator that matches the given predicate, and if so returns true. Once a match is found, we’ll attempt to stop process the rest of the items. Proving that there’s no match, returning false, does require visiting every item. Read more
§

#### fn all<P>(self, predicate: P) -> boolwhere P: Fn(Self::Item) -> bool + Sync + Send,

Tests that every item in the parallel iterator matches the given predicate, and if so returns true. If a counter-example is found, we’ll attempt to stop processing more items, then return false. Read more
§

#### fn while_some<T>(self) -> WhileSome<Self>where Self: ParallelIterator<Item = Option<T>>, T: Send,

Creates an iterator over the `Some` items of this iterator, halting as soon as any `None` is found. Read more
§

#### fn panic_fuse(self) -> PanicFuse<Self>

Wraps an iterator with a fuse in case of panics, to halt all threads as soon as possible. Read more
§

#### fn collect<C>(self) -> Cwhere C: FromParallelIterator<Self::Item>,

Creates a fresh collection containing all the elements produced by this parallel iterator. Read more
§

#### fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where Self: ParallelIterator<Item = (A, B)>, FromA: Default + Send + ParallelExtend<A>, FromB: Default + Send + ParallelExtend<B>, A: Send, B: Send,

Unzips the items of a parallel iterator into a pair of arbitrary `ParallelExtend` containers. Read more
§

#### fn partition<A, B, P>(self, predicate: P) -> (A, B)where A: Default + Send + ParallelExtend<Self::Item>, B: Default + Send + ParallelExtend<Self::Item>, P: Fn(&Self::Item) -> bool + Sync + Send,

Partitions the items of a parallel iterator into a pair of arbitrary `ParallelExtend` containers. Items for which the `predicate` returns true go into the first container, and the rest go into the second. Read more
§

#### fn partition_map<A, B, P, L, R>(self, predicate: P) -> (A, B)where A: Default + Send + ParallelExtend<L>, B: Default + Send + ParallelExtend<R>, P: Fn(Self::Item) -> Either<L, R> + Sync + Send, L: Send, R: Send,

Partitions and maps the items of a parallel iterator into a pair of arbitrary `ParallelExtend` containers. `Either::Left` items go into the first container, and `Either::Right` items go into the second. Read more
§

#### fn take_any(self, n: usize) -> TakeAny<Self>

Creates an iterator that yields `n` elements from anywhere in the original iterator. Read more
§

#### fn skip_any(self, n: usize) -> SkipAny<Self>

Creates an iterator that skips `n` elements from anywhere in the original iterator. Read more
§

#### fn take_any_while<P>(self, predicate: P) -> TakeAnyWhile<Self, P>where P: Fn(&Self::Item) -> bool + Sync + Send,

Creates an iterator that takes elements from anywhere in the original iterator until the given `predicate` returns `false`. Read more
§

#### fn skip_any_while<P>(self, predicate: P) -> SkipAnyWhile<Self, P>where P: Fn(&Self::Item) -> bool + Sync + Send,

Creates an iterator that skips elements from anywhere in the original iterator until the given `predicate` returns `false`. Read more
§

source§

### impl<L, R> PartialEq for Either<L, R>where L: PartialEq, R: PartialEq,

source§

#### fn eq(&self, other: &Either<L, R>) -> bool

This method tests for `self` and `other` values to be equal, and is used by `==`.
1.0.0 · source§

#### fn ne(&self, other: &Rhs) -> bool

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

### impl<L, R> PartialOrd for Either<L, R>where L: PartialOrd, R: PartialOrd,

source§

#### fn partial_cmp(&self, other: &Either<L, R>) -> Option<Ordering>

This method returns an ordering between `self` and `other` values if one exists. Read more
1.0.0 · source§

#### fn lt(&self, other: &Rhs) -> bool

This method tests less than (for `self` and `other`) and is used by the `<` operator. Read more
1.0.0 · source§

#### fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for `self` and `other`) and is used by the `<=` operator. Read more
1.0.0 · source§

#### fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for `self` and `other`) and is used by the `>` operator. Read more
1.0.0 · source§

#### fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for `self` and `other`) and is used by the `>=` operator. Read more
source§

`Either<L, R>` implements `Read` if both `L` and `R` do.

Requires crate feature `"use_std"`

source§

#### fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

Pull some bytes from this source into the specified buffer, returning how many bytes were read. Read more
source§

#### fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>

Read the exact number of bytes required to fill `buf`. Read more
source§

#### fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

Read all bytes until EOF in this source, placing them into `buf`. Read more
source§

#### fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

Read all bytes until EOF in this source, appending them to `buf`. Read more
1.36.0 · source§

#### fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>

Like `read`, except that it reads into a slice of buffers. Read more
source§

🔬This is a nightly-only experimental API. (`can_vector`)
Determines if this `Read`er has an efficient `read_vectored` implementation. Read more
source§

#### fn read_buf(&mut self, buf: BorrowedCursor<'_>) -> Result<(), Error>

🔬This is a nightly-only experimental API. (`read_buf`)
Pull some bytes from this source into the specified buffer. Read more
source§

#### fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>

🔬This is a nightly-only experimental API. (`read_buf`)
Read the exact number of bytes required to fill `cursor`. Read more
1.0.0 · source§

#### fn by_ref(&mut self) -> &mut Selfwhere Self: Sized,

Creates a “by reference” adaptor for this instance of `Read`. Read more
1.0.0 · source§

#### fn bytes(self) -> Bytes<Self>where Self: Sized,

Transforms this `Read` instance to an `Iterator` over its bytes. Read more
1.0.0 · source§

#### fn chain<R>(self, next: R) -> Chain<Self, R>where R: Read, Self: Sized,

Creates an adapter which will chain this stream with another. Read more
1.0.0 · source§

#### fn take(self, limit: u64) -> Take<Self>where Self: Sized,

Creates an adapter which will read at most `limit` bytes from it. Read more
source§

### impl<L, R> Seek for Either<L, R>where L: Seek, R: Seek,

`Either<L, R>` implements `Seek` if both `L` and `R` do.

Requires crate feature `"use_std"`

source§

#### fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

Seek to an offset, in bytes, in a stream. Read more
1.55.0 · source§

#### fn rewind(&mut self) -> Result<(), Error>

Rewind to the beginning of a stream. Read more
source§

#### fn stream_len(&mut self) -> Result<u64, Error>

🔬This is a nightly-only experimental API. (`seek_stream_len`)
Returns the length of this stream (in bytes). Read more
1.51.0 · source§

#### fn stream_position(&mut self) -> Result<u64, Error>

Returns the current seek position from the start of the stream. Read more
source§

#### fn seek_relative(&mut self, offset: i64) -> Result<(), Error>

🔬This is a nightly-only experimental API. (`seek_seek_relative`)
Seeks relative to the current position. Read more
source§

### impl<L, R> Write for Either<L, R>where L: Write, R: Write,

`Either<L, R>` implements `Write` if both `L` and `R` do.

Requires crate feature `"use_std"`

source§

#### fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

Write a buffer into this writer, returning how many bytes were written. Read more
source§

#### fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

Attempts to write an entire buffer into this writer. Read more
source§

#### fn write_fmt(&mut self, fmt: Arguments<'_>) -> Result<(), Error>

Writes a formatted string into this writer, returning any error encountered. Read more
source§

#### fn flush(&mut self) -> Result<(), Error>

Flush this output stream, ensuring that all intermediately buffered contents reach their destination. Read more
1.36.0 · source§

#### fn write_vectored(&mut self, bufs: &[IoSlice<'_>]) -> Result<usize, Error>

Like `write`, except that it writes from a slice of buffers. Read more
source§

#### fn is_write_vectored(&self) -> bool

🔬This is a nightly-only experimental API. (`can_vector`)
Determines if this `Write`r has an efficient `write_vectored` implementation. Read more
source§

#### fn write_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>

🔬This is a nightly-only experimental API. (`write_all_vectored`)
Attempts to write multiple buffers into this writer. Read more
1.0.0 · source§

#### fn by_ref(&mut self) -> &mut Selfwhere Self: Sized,

Creates a “by reference” adapter for this instance of `Write`. Read more
source§

source§

source§

source§

§

§

§

§

§

## Blanket Implementations§

source§

### impl<T> Any for Twhere T: 'static + ?Sized,

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
§

### impl<A, T> AsBits<T> for Awhere A: AsRef<[T]>, T: BitStore,

§

#### fn as_bits<O>(&self) -> &BitSlice<T, O> ⓘwhere O: BitOrder,

Views `self` as an immutable bit-slice region with the `O` ordering.
§

#### fn try_as_bits<O>(&self) -> Result<&BitSlice<T, O>, BitSpanError<T>>where O: BitOrder,

Attempts to view `self` as an immutable bit-slice region with the `O` ordering. Read more
§

§

§

### impl<A, T> AsMutBits<T> for Awhere A: AsMut<[T]>, T: BitStore,

§

#### fn as_mut_bits<O>(&mut self) -> &mut BitSlice<T, O> ⓘwhere O: BitOrder,

Views `self` as a mutable bit-slice region with the `O` ordering.
§

#### fn try_as_mut_bits<O>(&mut self) -> Result<&mut BitSlice<T, O>, BitSpanError<T>>where O: BitOrder,

Attempts to view `self` as a mutable bit-slice region with the `O` ordering. Read more
§

§

§

§

§

§

source§

### impl<T> Borrow<T> for Twhere T: ?Sized,

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

§

source§

### impl<T> CheckedConversion for T

source§

#### fn checked_from<T>(t: T) -> Option<Self>where Self: TryFrom<T>,

Convert from a value of `T` into an equivalent instance of `Option<Self>`. Read more
source§

#### fn checked_into<T>(self) -> Option<T>where Self: TryInto<T>,

Consume self to return `Some` equivalent value of `Option<T>`. Read more
§

### impl<Q, K> Comparable<K> for Qwhere Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

§

#### fn compare(&self, key: &K) -> Ordering

Compare self to `key` and return their ordering.
§

### impl<T> Conv for T

§

#### fn conv<T>(self) -> Twhere Self: Into<T>,

Converts `self` into `T` using `Into<T>`. Read more
source§

source§

source§

### impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

#### fn equivalent(&self, key: &K) -> bool

Compare self to `key` and return `true` if they are equal.
§

### impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

#### fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

### impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

#### fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

### impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

#### fn equivalent(&self, key: &K) -> bool

Compare self to `key` and return `true` if they are equal.
§

### impl<T> FmtForward for T

§

#### fn fmt_binary(self) -> FmtBinary<Self>where Self: Binary,

Causes `self` to use its `Binary` implementation when `Debug`-formatted.
§

#### fn fmt_display(self) -> FmtDisplay<Self>where Self: Display,

Causes `self` to use its `Display` implementation when `Debug`-formatted.
§

#### fn fmt_lower_exp(self) -> FmtLowerExp<Self>where Self: LowerExp,

Causes `self` to use its `LowerExp` implementation when `Debug`-formatted.
§

#### fn fmt_lower_hex(self) -> FmtLowerHex<Self>where Self: LowerHex,

Causes `self` to use its `LowerHex` implementation when `Debug`-formatted.
§

#### fn fmt_octal(self) -> FmtOctal<Self>where Self: Octal,

Causes `self` to use its `Octal` implementation when `Debug`-formatted.
§

#### fn fmt_pointer(self) -> FmtPointer<Self>where Self: Pointer,

Causes `self` to use its `Pointer` implementation when `Debug`-formatted.
§

#### fn fmt_upper_exp(self) -> FmtUpperExp<Self>where Self: UpperExp,

Causes `self` to use its `UpperExp` implementation when `Debug`-formatted.
§

#### fn fmt_upper_hex(self) -> FmtUpperHex<Self>where Self: UpperHex,

Causes `self` to use its `UpperHex` implementation when `Debug`-formatted.
§

#### fn fmt_list(self) -> FmtList<Self>where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

§

### impl<T> FutureExt for Twhere T: Future + ?Sized,

§

#### fn map<U, F>(self, f: F) -> Map<Self, F>where F: FnOnce(Self::Output) -> U, Self: Sized,

Map this future’s output to a different type, returning a new future of the resulting type. Read more
§

#### fn map_into<U>(self) -> MapInto<Self, U>where Self::Output: Into<U>, Self: Sized,

Map this future’s output to a different type, returning a new future of the resulting type. Read more
§

#### fn then<Fut, F>(self, f: F) -> Then<Self, Fut, F>where F: FnOnce(Self::Output) -> Fut, Fut: Future, Self: Sized,

Chain on a computation for when a future finished, passing the result of the future to the provided closure `f`. Read more
§

#### fn left_future<B>(self) -> Either<Self, B>where B: Future<Output = Self::Output>, Self: Sized,

Wrap this future in an `Either` future, making it the left-hand variant of that `Either`. Read more
§

#### fn right_future<A>(self) -> Either<A, Self>where A: Future<Output = Self::Output>, Self: Sized,

Wrap this future in an `Either` future, making it the right-hand variant of that `Either`. Read more
§

#### fn into_stream(self) -> IntoStream<Self>where Self: Sized,

Convert this future into a single element stream. Read more
§

#### fn flatten(self) -> Flatten<Self>where Self::Output: Future, Self: Sized,

Flatten the execution of this future when the output of this future is itself another future. Read more
§

#### fn flatten_stream(self) -> FlattenStream<Self>where Self::Output: Stream, Self: Sized,

Flatten the execution of this future when the successful result of this future is a stream. Read more
§

#### fn fuse(self) -> Fuse<Self>where Self: Sized,

Fuse a future such that `poll` will never again be called once it has completed. This method can be used to turn any `Future` into a `FusedFuture`. Read more
§

#### fn inspect<F>(self, f: F) -> Inspect<Self, F>where F: FnOnce(&Self::Output), Self: Sized,

Do something with the output of a future before passing it on. Read more
§

#### fn catch_unwind(self) -> CatchUnwind<Self>where Self: Sized + UnwindSafe,

Catches unwinding panics while polling the future. Read more
§

#### fn shared(self) -> Shared<Self>where Self: Sized, Self::Output: Clone,

Create a cloneable handle to this future where all handles will resolve to the same result. Read more
§

#### fn remote_handle(self) -> (Remote<Self>, RemoteHandle<Self::Output>)where Self: Sized,

Turn this future into a future that yields `()` on completion and sends its output to another future on a separate task. Read more
§

#### fn boxed<'a>(self) -> Pin<Box<dyn Future<Output = Self::Output> + Send + 'a>>where Self: Sized + Send + 'a,

Wrap the future in a Box, pinning it. Read more
§

#### fn boxed_local<'a>(self) -> Pin<Box<dyn Future<Output = Self::Output> + 'a>>where Self: Sized + 'a,

Wrap the future in a Box, pinning it. Read more
§

§

§

#### fn poll_unpin(&mut self, cx: &mut Context<'_>) -> Poll<Self::Output>where Self: Unpin,

A convenience for calling `Future::poll` on `Unpin` future types.
§

#### fn now_or_never(self) -> Option<Self::Output>where Self: Sized,

Evaluates and consumes the future, returning the resulting output if the future is ready after the first call to `Future::poll`. Read more
§

### impl<T> Instrument for T

§

#### fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [`Span`], returning an `Instrumented` wrapper. Read more
§

#### fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current `Span`, returning an `Instrumented` wrapper. Read more
source§

### impl<T, U> Into<U> for Twhere U: From<T>,

source§

#### fn into(self) -> U

Calls `U::from(self)`.

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

source§

### impl<F> IntoFuture for Fwhere F: Future,

§

#### type Output = <F as Future>::Output

The output that the future will produce on completion.
§

#### type IntoFuture = F

Which kind of future are we turning this into?
source§

#### fn into_future(self) -> <F as IntoFuture>::IntoFuture

Creates a future from a value. Read more
source§

### impl<I> IntoIterator for Iwhere I: Iterator,

§

#### type Item = <I as Iterator>::Item

The type of the elements being iterated over.
§

#### type IntoIter = I

Which kind of iterator are we turning this into?
const: unstable · source§

#### fn into_iter(self) -> I

Creates an iterator from a value. Read more
§

### impl<T> IntoParallelIterator for Twhere T: ParallelIterator,

§

#### type Iter = T

The parallel iterator type that will be created.
§

#### type Item = <T as ParallelIterator>::Item

The type of item that the parallel iterator will produce.
§

#### fn into_par_iter(self) -> T

Converts `self` into a parallel iterator. Read more
§

### impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,

§

#### fn from_ref(outer: &Outer) -> &T

Get a reference to the inner from the outer.

§

#### fn from_mut(outer: &mut Outer) -> &mut T

Get a mutable reference to the inner from the outer.

source§

### impl<I> IteratorRandom for Iwhere I: Iterator,

source§

#### fn choose<R>(self, rng: &mut R) -> Option<Self::Item>where R: Rng + ?Sized,

Choose one element at random from the iterator. Read more
source§

#### fn choose_stable<R>(self, rng: &mut R) -> Option<Self::Item>where R: Rng + ?Sized,

Choose one element at random from the iterator. Read more
source§

#### fn choose_multiple_fill<R>(self, rng: &mut R, buf: &mut [Self::Item]) -> usizewhere R: Rng + ?Sized,

Collects values at random from the iterator into a supplied buffer until that buffer is filled. Read more
source§

#### fn choose_multiple<R>(self, rng: &mut R, amount: usize) -> Vec<Self::Item>where R: Rng + ?Sized,

Collects `amount` values at random from the iterator into a vector. Read more
source§

### impl<T> Itertools for Twhere T: Iterator + ?Sized,

source§

#### fn interleave<J>( self, other: J ) -> Interleave<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

#### fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, Self: Sized,

Alternate elements from two iterators until at least one of them has run out. Read more
source§

#### fn intersperse( self, element: Self::Item ) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where Self: Sized, Self::Item: Clone,

An iterator adaptor to insert a particular value between each element of the adapted iterator. Read more
source§

#### fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where Self: Sized, F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function between each element of the adapted iterator. Read more
source§

#### fn zip_longest<J>( self, other: J ) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of two optional elements. Read more
source§

#### fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of elements. Read more
source§

#### fn batching<B, F>(self, f: F) -> Batching<Self, F>where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the next iterator element. Read more
source§

#### fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned to the same group. Read more
source§

#### fn chunks(self, size: usize) -> IntoChunks<Self>where Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

#### fn tuple_windows<T>(self) -> TupleWindows<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple, <T as TupleCollect>::Item: Clone,

Return an iterator over all contiguous windows producing tuples of a specific size (up to 12). Read more
source§

#### fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator, T: TupleCollect + Clone, <T as TupleCollect>::Item: Clone,

Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the iterator, producing tuples of a specific size (up to 12). Read more
source§

#### fn tuples<T>(self) -> Tuples<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Return an iterator that groups the items in tuples of a specific size (up to 12). Read more
source§

#### fn tee(self) -> (Tee<Self>, Tee<Self>)where Self: Sized, Self::Item: Clone,

Split into an iterator pair that both yield all elements from the original iterator. Read more
source§

#### fn step(self, n: usize) -> Step<Self>where Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps `n` elements in the base iterator for each iteration. Read more
source§

#### fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where Self: Sized, Self::Item: Into<R>,

Convert each item of the iterator using the `Into` trait. Read more
source§

#### fn map_results<F, T, U, E>( self, f: F ) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
source§

#### fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

Return an iterator adaptor that applies the provided closure to every `Result::Ok` value. `Result::Err` values are unchanged. Read more
source§

#### fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every `Result::Ok` value with the provided closure. `Result::Err` values are unchanged. Read more
source§

#### fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every `Result::Ok` value with the provided closure. `Result::Err` values are unchanged. Read more
source§

#### fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

Return an iterator adaptor that flattens every `Result::Ok` value into a series of `Result::Ok` values. `Result::Err` values are unchanged. Read more
source§

#### fn merge<J>( self, other: J ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the result is sorted. Read more
source§

#### fn merge_by<J, F>( self, other: J, is_first: F ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

Return an iterator adaptor that merges the two base iterators in order. This is much like `.merge()` but allows for a custom ordering. Read more
source§

#### fn merge_join_by<J, F>( self, other: J, cmp_fn: F ) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where J: IntoIterator, F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering, Self: Sized,

Create an iterator that merges items from both this and the specified iterator in ascending order. Read more
source§

#### fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

Return an iterator adaptor that flattens an iterator of iterators by merging them in ascending order. Read more
source§

#### fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

Return an iterator adaptor that flattens an iterator of iterators by merging them according to the given closure. Read more
source§

#### fn cartesian_product<J>( self, other: J ) -> Product<Self, <J as IntoIterator>::IntoIter>where Self: Sized, Self::Item: Clone, J: IntoIterator, <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of the element sets of two iterators `self` and `J`. Read more
source§

#### fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

Return an iterator adaptor that iterates over the cartesian product of all subiterators returned by meta-iterator `self`. Read more
source§

#### fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

Return an iterator adaptor that uses the passed-in closure to optionally merge together consecutive elements. Read more
source§

#### fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where Self: Sized, Self::Item: PartialEq,

Remove duplicates from sections of consecutive identical elements. If the iterator is sorted, all elements will be unique. Read more
source§

#### fn dedup_by<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. If the iterator is sorted, all elements will be unique. Read more
source§

#### fn dedup_with_count( self ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. If the iterator is sorted, all elements will be unique. Read more
source§

#### fn dedup_by_with_count<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. If the iterator is sorted, all elements will be unique. Read more
source§

#### fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where Self: Sized, Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the iteration. Duplicates are detected using hash and equality. Read more
source§

#### fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the iteration. Duplicates are detected using hash and equality. Read more
source§

#### fn unique(self) -> Unique<Self>where Self: Sized, Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates are detected using hash and equality. Read more
source§

#### fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Read more
source§

#### fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and takes items while the closure `accept` returns `true`. Read more
source§

#### fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where Self: Clone, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a `Clone`-able iterator to only pick off elements while the predicate `accept` returns `true`. Read more
source§

#### fn while_some<A>(self) -> WhileSome<Self>where Self: Sized + Iterator<Item = Option<A>>,

Return an iterator adaptor that filters `Option<A>` iterator elements and produces `A`. Stops on the first `None` encountered. Read more
source§

#### fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

Return an iterator adaptor that iterates over the combinations of the elements from an iterator. Read more
source§

#### fn combinations(self, k: usize) -> Combinations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over the `k`-length combinations of the elements from an iterator. Read more
source§

#### fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates over the `k`-length combinations of the elements from an iterator, with replacement. Read more
source§

#### fn permutations(self, k: usize) -> Permutations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the elements from an iterator. Read more
source§

#### fn powerset(self) -> Powerset<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates through the powerset of the elements from an iterator. Read more
source§

#### fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where Self: Sized, F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of `min` by filling missing elements using a closure `f`. Read more
source§

#### fn with_position(self) -> WithPosition<Self>where Self: Sized,

Return an iterator adaptor that wraps each element in a `Position` to ease special-case handling of the first or last elements. Read more
source§

#### fn positions<P>(self, predicate: P) -> Positions<Self, P>where Self: Sized, P: FnMut(Self::Item) -> bool,

Return an iterator adaptor that yields the indices of all elements satisfying a predicate, counted from the start of the iterator. Read more
source§

#### fn update<F>(self, updater: F) -> Update<Self, F>where Self: Sized, F: FnMut(&mut Self::Item),

Return an iterator adaptor that applies a mutating function to each element before yielding it. Read more
source§

#### fn next_tuple<T>(&mut self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Advances the iterator and returns the next items grouped in a tuple of a specific size (up to 12). Read more
source§

#### fn collect_tuple<T>(self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Collects all items from the iterator into a tuple of a specific size (up to 12). Read more
source§

#### fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

#### fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

#### fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

#### fn contains<Q>(&mut self, query: &Q) -> boolwhere Self: Sized, Self::Item: Borrow<Q>, Q: PartialEq,

Returns `true` if the given item is present in this iterator. Read more
source§

#### fn all_equal(&mut self) -> boolwhere Self: Sized, Self::Item: PartialEq,

Check whether all elements compare equal. Read more
source§

#### fn all_unique(&mut self) -> boolwhere Self: Sized, Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

#### fn dropping(self, n: usize) -> Selfwhere Self: Sized,

Consume the first `n` elements from the iterator eagerly, and return the same iterator again. Read more
source§

#### fn dropping_back(self, n: usize) -> Selfwhere Self: Sized + DoubleEndedIterator,

Consume the last `n` elements from the iterator eagerly, and return the same iterator again. Read more
source§

#### fn foreach<F>(self, f: F)where F: FnMut(Self::Item), Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure `f` eagerly on each element of the iterator. Read more
source§

#### fn concat(self) -> Self::Itemwhere Self: Sized, Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using `Extend`. Read more
source§

#### fn collect_vec(self) -> Vec<Self::Item>where Self: Sized,

`.collect_vec()` is simply a type specialization of `Iterator::collect`, for convenience.
source§

#### fn try_collect<T, U, E>(self) -> Result<U, E>where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

`.try_collect()` is more convenient way of writing `.collect::<Result<_, _>>()` Read more
source§

#### fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere A: 'a, Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

Assign to each reference in `self` from the `from` iterator, stopping at the shortest of the two iterators. Read more
source§

#### fn join(&mut self, sep: &str) -> Stringwhere Self::Item: Display,

Combine all iterator elements into one String, separated by `sep`. Read more
source§

#### fn format(self, sep: &str) -> Format<'_, Self>where Self: Sized,

Format all iterator elements, separated by `sep`. Read more
source§

#### fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where Self: Sized, F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by `sep`. Read more
source§

#### fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
source§

#### fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, F: FnMut(B, A) -> B,

Fold `Result` values from an iterator. Read more
source§

#### fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where Self: Iterator<Item = Option<A>>, F: FnMut(B, A) -> B,

Fold `Option` values from an iterator. Read more
source§

#### fn fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, Self: Sized,

👎Deprecated since 0.10.2: Use `Iterator::reduce` instead
Accumulator of the elements in the iterator. Read more
source§

#### fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

#### fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where Self: Sized, F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

#### fn sum1<S>(self) -> Option<S>where Self: Sized, S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

#### fn product1<P>(self) -> Option<P>where Self: Sized, P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

#### fn sorted_unstable(self) -> IntoIter<Self::Item>where Self: Sized, Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted(self) -> IntoIter<Self::Item>where Self: Sized, Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. The key function is called exactly once per key. Read more
source§

#### fn k_smallest(self, k: usize) -> IntoIter<Self::Item>where Self: Sized, Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

#### fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

Collect all iterator elements into one of two partitions. Unlike `Iterator::partition`, each partition may have a distinct type. Read more
source§

#### fn partition_result<A, B, T, E>(self) -> (A, B)where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

Partition a sequence of `Result`s into one list of all the `Ok` elements and another list of all the `Err` elements. Read more
source§

#### fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

Return a `HashMap` of keys mapped to `Vec`s of values. Keys and values are taken from `(Key, Value)` tuple pairs yielded by the input iterator. Read more
source§

#### fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: Fn(&V) -> K,

Return an `Iterator` on a `HashMap`. Keys mapped to `Vec`s of values. The key is specified in the closure. Read more
source§

#### fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

Constructs a `GroupingMap` to be used later with one of the efficient group-and-fold operations it allows to perform. Read more
source§

#### fn into_grouping_map_by<K, V, F>( self, key_mapper: F ) -> GroupingMap<MapForGrouping<Self, F>>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

Constructs a `GroupingMap` to be used later with one of the efficient group-and-fold operations it allows to perform. Read more
source§

#### fn min_set(self) -> Vec<Self::Item>where Self: Sized, Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

#### fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all minimum elements of an iterator, as determined by the specified function. Read more
source§

#### fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by the specified function. Read more
source§

#### fn max_set(self) -> Vec<Self::Item>where Self: Sized, Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

#### fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all maximum elements of an iterator, as determined by the specified function. Read more
source§

#### fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by the specified function. Read more
source§

#### fn minmax(self) -> MinMaxResult<Self::Item>where Self: Sized, Self::Item: PartialOrd,

Return the minimum and maximum elements in the iterator. Read more
source§

#### fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

Return the minimum and maximum element of an iterator, as determined by the specified function. Read more
source§

#### fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the minimum and maximum element of an iterator, as determined by the specified comparison function. Read more
source§

#### fn position_max(self) -> Option<usize>where Self: Sized, Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

#### fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the maximum element in the iterator, as determined by the specified function. Read more
source§

#### fn position_max_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the maximum element in the iterator, as determined by the specified comparison function. Read more
source§

#### fn position_min(self) -> Option<usize>where Self: Sized, Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

#### fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the minimum element in the iterator, as determined by the specified function. Read more
source§

#### fn position_min_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the minimum element in the iterator, as determined by the specified comparison function. Read more
source§

#### fn position_minmax(self) -> MinMaxResult<usize>where Self: Sized, Self::Item: PartialOrd,

Return the positions of the minimum and maximum elements in the iterator. Read more
source§

#### fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

Return the postions of the minimum and maximum elements of an iterator, as determined by the specified function. Read more
source§

#### fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the postions of the minimum and maximum elements of an iterator, as determined by the specified comparison function. Read more
source§

#### fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input iterator. Read more
source§

#### fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input iterator. Read more
source§

#### fn multipeek(self) -> MultiPeek<Self>where Self: Sized,

An iterator adaptor that allows the user to peek at multiple `.next()` values without advancing the base iterator. Read more
source§

#### fn counts(self) -> HashMap<Self::Item, usize>where Self: Sized, Self::Item: Eq + Hash,

Collect the items in this iterator and return a `HashMap` which contains each item that appears in the iterator and the number of times it appears. Read more
source§

#### fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a `HashMap` which contains each item that appears in the iterator and the number of times it appears, determining identity using a keying function. Read more
source§

#### fn multiunzip<FromI>(self) -> FromIwhere Self: Sized + MultiUnzip<FromI>,

Converts an iterator of tuples into a tuple of containers. Read more
source§

### impl<T> Itertools for Twhere T: Iterator + ?Sized,

source§

#### fn interleave<J>( self, other: J ) -> Interleave<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, Self: Sized,

Alternate elements from two iterators until both have run out. Read more
source§

#### fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator<Item = Self::Item>, Self: Sized,

Alternate elements from two iterators until at least one of them has run out. Read more
source§

#### fn intersperse( self, element: Self::Item ) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where Self: Sized, Self::Item: Clone,

An iterator adaptor to insert a particular value between each element of the adapted iterator. Read more
source§

#### fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where Self: Sized, F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function between each element of the adapted iterator. Read more
source§

#### fn zip_longest<J>( self, other: J ) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of two optional elements. Read more
source§

#### fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,

Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of elements. Read more
source§

#### fn batching<B, F>(self, f: F) -> Batching<Self, F>where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the next iterator element. Read more
source§

#### fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned to the same group. Read more
source§

#### fn chunks(self, size: usize) -> IntoChunks<Self>where Self: Sized,

Return an iterable that can chunk the iterator. Read more
source§

#### fn tuple_windows<T>(self) -> TupleWindows<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple, <T as TupleCollect>::Item: Clone,

Return an iterator over all contiguous windows producing tuples of a specific size (up to 12). Read more
source§

#### fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator, T: TupleCollect + Clone, <T as TupleCollect>::Item: Clone,

Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the iterator, producing tuples of a specific size (up to 12). Read more
source§

#### fn tuples<T>(self) -> Tuples<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Return an iterator that groups the items in tuples of a specific size (up to 12). Read more
source§

#### fn tee(self) -> (Tee<Self>, Tee<Self>)where Self: Sized, Self::Item: Clone,

Split into an iterator pair that both yield all elements from the original iterator. Read more
source§

#### fn step(self, n: usize) -> Step<Self>where Self: Sized,

👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps `n` elements in the base iterator for each iteration. Read more
source§

#### fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where Self: Sized, Self::Item: Into<R>,

Convert each item of the iterator using the `Into` trait. Read more
source§

#### fn map_results<F, T, U, E>( self, f: F ) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

👎Deprecated since 0.10.0: Use .map_ok() instead
source§

#### fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

Return an iterator adaptor that applies the provided closure to every `Result::Ok` value. `Result::Err` values are unchanged. Read more
source§

#### fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every `Result::Ok` value with the provided closure. `Result::Err` values are unchanged. Read more
source§

#### fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

Return an iterator adaptor that filters and transforms every `Result::Ok` value with the provided closure. `Result::Err` values are unchanged. Read more
source§

#### fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

Return an iterator adaptor that flattens every `Result::Ok` value into a series of `Result::Ok` values. `Result::Err` values are unchanged. Read more
source§

#### fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

“Lift” a function of the values of the current iterator so as to process an iterator of `Result` values instead. Read more
source§

#### fn merge<J>( self, other: J ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the result is sorted. Read more
source§

#### fn merge_by<J, F>( self, other: J, is_first: F ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

Return an iterator adaptor that merges the two base iterators in order. This is much like `.merge()` but allows for a custom ordering. Read more
source§

#### fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F ) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where J: IntoIterator, F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>, Self: Sized,

Create an iterator that merges items from both this and the specified iterator in ascending order. Read more
source§

#### fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

Return an iterator adaptor that flattens an iterator of iterators by merging them in ascending order. Read more
source§

#### fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

Return an iterator adaptor that flattens an iterator of iterators by merging them according to the given closure. Read more
source§

#### fn cartesian_product<J>( self, other: J ) -> Product<Self, <J as IntoIterator>::IntoIter>where Self: Sized, Self::Item: Clone, J: IntoIterator, <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of the element sets of two iterators `self` and `J`. Read more
source§

#### fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

Return an iterator adaptor that iterates over the cartesian product of all subiterators returned by meta-iterator `self`. Read more
source§

#### fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

Return an iterator adaptor that uses the passed-in closure to optionally merge together consecutive elements. Read more
source§

#### fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where Self: Sized, Self::Item: PartialEq,

Remove duplicates from sections of consecutive identical elements. If the iterator is sorted, all elements will be unique. Read more
source§

#### fn dedup_by<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. If the iterator is sorted, all elements will be unique. Read more
source§

#### fn dedup_with_count( self ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where Self: Sized,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. If the iterator is sorted, all elements will be unique. Read more
source§

#### fn dedup_by_with_count<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. If the iterator is sorted, all elements will be unique. Read more
source§

#### fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where Self: Sized, Self::Item: Eq + Hash,

Return an iterator adaptor that produces elements that appear more than once during the iteration. Duplicates are detected using hash and equality. Read more
source§

#### fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the iteration. Duplicates are detected using hash and equality. Read more
source§

#### fn unique(self) -> Unique<Self>where Self: Sized, Self::Item: Clone + Eq + Hash,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates are detected using hash and equality. Read more
source§

#### fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Read more
source§

#### fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and takes items while the closure `accept` returns `true`. Read more
source§

#### fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where Self: Clone, F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a `Clone`-able iterator to only pick off elements while the predicate `accept` returns `true`. Read more
source§

#### fn take_while_inclusive<F>( &mut self, accept: F ) -> TakeWhileInclusive<'_, Self, F>where Self: Sized, F: FnMut(&Self::Item) -> bool,

Returns an iterator adaptor that consumes elements while the given predicate is `true`, including the element for which the predicate first returned `false`. Read more
source§

#### fn while_some<A>(self) -> WhileSome<Self>where Self: Sized + Iterator<Item = Option<A>>,

Return an iterator adaptor that filters `Option<A>` iterator elements and produces `A`. Stops on the first `None` encountered. Read more
source§

#### fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

Return an iterator adaptor that iterates over the combinations of the elements from an iterator. Read more
source§

#### fn combinations(self, k: usize) -> Combinations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over the `k`-length combinations of the elements from an iterator. Read more
source§

#### fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates over the `k`-length combinations of the elements from an iterator, with replacement. Read more
source§

#### fn permutations(self, k: usize) -> Permutations<Self>where Self: Sized, Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the elements from an iterator. Read more
source§

#### fn powerset(self) -> Powerset<Self>where Self: Sized, Self::Item: Clone,

Return an iterator that iterates through the powerset of the elements from an iterator. Read more
source§

#### fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where Self: Sized, F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of `min` by filling missing elements using a closure `f`. Read more
source§

#### fn with_position(self) -> WithPosition<Self>where Self: Sized,

Return an iterator adaptor that combines each element with a `Position` to ease special-case handling of the first or last elements. Read more
source§

#### fn positions<P>(self, predicate: P) -> Positions<Self, P>where Self: Sized, P: FnMut(Self::Item) -> bool,

Return an iterator adaptor that yields the indices of all elements satisfying a predicate, counted from the start of the iterator. Read more
source§

#### fn update<F>(self, updater: F) -> Update<Self, F>where Self: Sized, F: FnMut(&mut Self::Item),

Return an iterator adaptor that applies a mutating function to each element before yielding it. Read more
source§

#### fn next_tuple<T>(&mut self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Advances the iterator and returns the next items grouped in a tuple of a specific size (up to 12). Read more
source§

#### fn collect_tuple<T>(self) -> Option<T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,

Collects all items from the iterator into a tuple of a specific size (up to 12). Read more
source§

#### fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more
source§

#### fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§

#### fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where Self: Sized, P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§

#### fn contains<Q>(&mut self, query: &Q) -> boolwhere Self: Sized, Self::Item: Borrow<Q>, Q: PartialEq,

Returns `true` if the given item is present in this iterator. Read more
source§

#### fn all_equal(&mut self) -> boolwhere Self: Sized, Self::Item: PartialEq,

Check whether all elements compare equal. Read more
source§

#### fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where Self: Sized, Self::Item: PartialEq,

If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first two non-equal elements found. Read more
source§

#### fn all_unique(&mut self) -> boolwhere Self: Sized, Self::Item: Eq + Hash,

Check whether all elements are unique (non equal). Read more
source§

#### fn dropping(self, n: usize) -> Selfwhere Self: Sized,

Consume the first `n` elements from the iterator eagerly, and return the same iterator again. Read more
source§

#### fn dropping_back(self, n: usize) -> Selfwhere Self: Sized + DoubleEndedIterator,

Consume the last `n` elements from the iterator eagerly, and return the same iterator again. Read more
source§

#### fn foreach<F>(self, f: F)where F: FnMut(Self::Item), Self: Sized,

👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure `f` eagerly on each element of the iterator. Read more
source§

#### fn concat(self) -> Self::Itemwhere Self: Sized, Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,

Combine all an iterator’s elements into one element by using `Extend`. Read more
source§

#### fn collect_vec(self) -> Vec<Self::Item>where Self: Sized,

`.collect_vec()` is simply a type specialization of `Iterator::collect`, for convenience.
source§

#### fn try_collect<T, U, E>(self) -> Result<U, E>where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

`.try_collect()` is more convenient way of writing `.collect::<Result<_, _>>()` Read more
source§

#### fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere A: 'a, Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

Assign to each reference in `self` from the `from` iterator, stopping at the shortest of the two iterators. Read more
source§

#### fn join(&mut self, sep: &str) -> Stringwhere Self::Item: Display,

Combine all iterator elements into one String, separated by `sep`. Read more
source§

#### fn format(self, sep: &str) -> Format<'_, Self>where Self: Sized,

Format all iterator elements, separated by `sep`. Read more
source§

#### fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where Self: Sized, F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,

Format all iterator elements, separated by `sep`. Read more
source§

#### fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0: Use .fold_ok() instead
source§

#### fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where Self: Iterator<Item = Result<A, E>>, F: FnMut(B, A) -> B,

Fold `Result` values from an iterator. Read more
source§

#### fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where Self: Iterator<Item = Option<A>>, F: FnMut(B, A) -> B,

Fold `Option` values from an iterator. Read more
source§

#### fn fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, Self: Sized,

👎Deprecated since 0.10.2: Use `Iterator::reduce` instead
Accumulator of the elements in the iterator. Read more
source§

#### fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where F: FnMut(Self::Item, Self::Item) -> Self::Item, Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more
source§

#### fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where Self: Sized, F: FnMut(B, Self::Item) -> FoldWhile<B>,

An iterator method that applies a function, producing a single, final value. Read more
source§

#### fn sum1<S>(self) -> Option<S>where Self: Sized, S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more
source§

#### fn product1<P>(self) -> Option<P>where Self: Sized, P: Product<Self::Item>,

Iterate over the entire iterator and multiply all the elements. Read more
source§

#### fn sorted_unstable(self) -> IntoIter<Self::Item>where Self: Sized, Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted(self) -> IntoIter<Self::Item>where Self: Sized, Self::Item: Ord,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. Read more
source§

#### fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Sort all iterator elements into a new iterator in ascending order. The key function is called exactly once per key. Read more
source§

#### fn k_smallest(self, k: usize) -> IntoIter<Self::Item>where Self: Sized, Self::Item: Ord,

Sort the k smallest elements into a new iterator, in ascending order. Read more
source§

#### fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

Collect all iterator elements into one of two partitions. Unlike `Iterator::partition`, each partition may have a distinct type. Read more
source§

#### fn partition_result<A, B, T, E>(self) -> (A, B)where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

Partition a sequence of `Result`s into one list of all the `Ok` elements and another list of all the `Err` elements. Read more
source§

#### fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

Return a `HashMap` of keys mapped to `Vec`s of values. Keys and values are taken from `(Key, Value)` tuple pairs yielded by the input iterator. Read more
source§

#### fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: Fn(&V) -> K,

Return an `Iterator` on a `HashMap`. Keys mapped to `Vec`s of values. The key is specified in the closure. Read more
source§

#### fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

Constructs a `GroupingMap` to be used later with one of the efficient group-and-fold operations it allows to perform. Read more
source§

#### fn into_grouping_map_by<K, V, F>( self, key_mapper: F ) -> GroupingMap<MapForGrouping<Self, F>>where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

Constructs a `GroupingMap` to be used later with one of the efficient group-and-fold operations it allows to perform. Read more
source§

#### fn min_set(self) -> Vec<Self::Item>where Self: Sized, Self::Item: Ord,

Return all minimum elements of an iterator. Read more
source§

#### fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all minimum elements of an iterator, as determined by the specified function. Read more
source§

#### fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return all minimum elements of an iterator, as determined by the specified function. Read more
source§

#### fn max_set(self) -> Vec<Self::Item>where Self: Sized, Self::Item: Ord,

Return all maximum elements of an iterator. Read more
source§

#### fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return all maximum elements of an iterator, as determined by the specified function. Read more
source§

#### fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return all maximum elements of an iterator, as determined by the specified function. Read more
source§

#### fn minmax(self) -> MinMaxResult<Self::Item>where Self: Sized, Self::Item: PartialOrd,

Return the minimum and maximum elements in the iterator. Read more
source§

#### fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

Return the minimum and maximum element of an iterator, as determined by the specified function. Read more
source§

#### fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the minimum and maximum element of an iterator, as determined by the specified comparison function. Read more
source§

#### fn position_max(self) -> Option<usize>where Self: Sized, Self::Item: Ord,

Return the position of the maximum element in the iterator. Read more
source§

#### fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the maximum element in the iterator, as determined by the specified function. Read more
source§

#### fn position_max_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the maximum element in the iterator, as determined by the specified comparison function. Read more
source§

#### fn position_min(self) -> Option<usize>where Self: Sized, Self::Item: Ord,

Return the position of the minimum element in the iterator. Read more
source§

#### fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

Return the position of the minimum element in the iterator, as determined by the specified function. Read more
source§

#### fn position_min_by<F>(self, compare: F) -> Option<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the position of the minimum element in the iterator, as determined by the specified comparison function. Read more
source§

#### fn position_minmax(self) -> MinMaxResult<usize>where Self: Sized, Self::Item: PartialOrd,

Return the positions of the minimum and maximum elements in the iterator. Read more
source§

#### fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

Return the postions of the minimum and maximum elements of an iterator, as determined by the specified function. Read more
source§

#### fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Return the postions of the minimum and maximum elements of an iterator, as determined by the specified comparison function. Read more
source§

#### fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input iterator. Read more
source§

#### fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where Self: Sized,

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input iterator. Read more
source§

#### fn multipeek(self) -> MultiPeek<Self>where Self: Sized,

An iterator adaptor that allows the user to peek at multiple `.next()` values without advancing the base iterator. Read more
source§

#### fn counts(self) -> HashMap<Self::Item, usize>where Self: Sized, Self::Item: Eq + Hash,

Collect the items in this iterator and return a `HashMap` which contains each item that appears in the iterator and the number of times it appears. Read more
source§

#### fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

Collect the items in this iterator and return a `HashMap` which contains each item that appears in the iterator and the number of times it appears, determining identity using a keying function. Read more
source§

#### fn multiunzip<FromI>(self) -> FromIwhere Self: Sized + MultiUnzip<FromI>,

Converts an iterator of tuples into a tuple of containers. Read more
§

### impl<T> Joiner for Twhere T: for<'a> Extend<&'a u8>,

§

#### fn and<V>(self, value: &V) -> Twhere V: Codec,

Append encoding of value to `Self`.
source§

### impl<IT> MultiUnzip<()> for ITwhere IT: Iterator<Item = ()>,

source§

#### fn multiunzip(self)

Unzip this iterator into multiple collections.
source§

### impl<IT> MultiUnzip<()> for ITwhere IT: Iterator<Item = ()>,

source§

#### fn multiunzip(self)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA> MultiUnzip<(FromA,)> for ITwhere IT: Iterator<Item = (A,)>, FromA: Default + Extend<A>,

source§

#### fn multiunzip(self) -> (FromA,)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA> MultiUnzip<(FromA,)> for ITwhere IT: Iterator<Item = (A,)>, FromA: Default + Extend<A>,

source§

#### fn multiunzip(self) -> (FromA,)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for ITwhere IT: Iterator<Item = (A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>,

source§

#### fn multiunzip(self) -> (FromA, FromB)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for ITwhere IT: Iterator<Item = (A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>,

source§

#### fn multiunzip(self) -> (FromA, FromB)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC> MultiUnzip<(FromA, FromB, FromC)> for ITwhere IT: Iterator<Item = (A, B, C)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC> MultiUnzip<(FromA, FromB, FromC)> for ITwhere IT: Iterator<Item = (A, B, C)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD> MultiUnzip<(FromA, FromB, FromC, FromD)> for ITwhere IT: Iterator<Item = (A, B, C, D)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD> MultiUnzip<(FromA, FromB, FromC, FromD)> for ITwhere IT: Iterator<Item = (A, B, C, D)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE> MultiUnzip<(FromA, FromB, FromC, FromD, FromE)> for ITwhere IT: Iterator<Item = (A, B, C, D, E)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE> MultiUnzip<(FromA, FromB, FromC, FromD, FromE)> for ITwhere IT: Iterator<Item = (A, B, C, D, E)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>,

source§

#### fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H, I)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>, FromI: Default + Extend<I>,

source§

#### fn multiunzip( self ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H, I)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>, FromI: Default + Extend<I>,

source§

#### fn multiunzip( self ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>, FromI: Default + Extend<I>, FromJ: Default + Extend<J>,

source§

#### fn multiunzip( self ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>, FromI: Default + Extend<I>, FromJ: Default + Extend<J>,

source§

#### fn multiunzip( self ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>, FromI: Default + Extend<I>, FromJ: Default + Extend<J>, FromK: Default + Extend<K>,

source§

#### fn multiunzip( self ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>, FromI: Default + Extend<I>, FromJ: Default + Extend<J>, FromK: Default + Extend<K>,

source§

#### fn multiunzip( self ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK, L, FromL> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>, FromI: Default + Extend<I>, FromJ: Default + Extend<J>, FromK: Default + Extend<K>, FromL: Default + Extend<L>,

source§

#### fn multiunzip( self ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

Unzip this iterator into multiple collections.
source§

### impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK, L, FromL> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)> for ITwhere IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>, FromC: Default + Extend<C>, FromD: Default + Extend<D>, FromE: Default + Extend<E>, FromF: Default + Extend<F>, FromG: Default + Extend<G>, FromH: Default + Extend<H>, FromI: Default + Extend<I>, FromJ: Default + Extend<J>, FromK: Default + Extend<K>, FromL: Default + Extend<L>,

source§

#### fn multiunzip( self ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

Unzip this iterator into multiple collections.
§

### impl<W> Output for Wwhere W: Write,

§

#### fn write(&mut self, bytes: &[u8])

Write to the output.
§

#### fn push_byte(&mut self, byte: u8)

Write a single byte to the output.
source§

### impl<S> ParseFormatted for Swhere S: AsRef<str>,

source§

#### fn parse_formatted<F, N>(&self, format: &F) -> Result<N, Error>where F: Format, N: FromFormattedStr,

Converts `self` (typically a formatted string) into a number (see Examples above).
§

### impl<T> Pipe for Twhere T: ?Sized,

§

#### fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
§

#### fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere R: 'a,

Borrows `self` and passes that borrow into the pipe function. Read more
§

#### fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere R: 'a,

Mutably borrows `self` and passes that borrow into the pipe function. Read more
§

#### fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows `self`, then passes `self.borrow()` into the pipe function. Read more
§

#### fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> Rwhere Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows `self`, then passes `self.borrow_mut()` into the pipe function. Read more
§

#### fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows `self`, then passes `self.as_ref()` into the pipe function.
§

#### fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows `self`, then passes `self.as_mut()` into the pipe function.
§

#### fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> Rwhere Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows `self`, then passes `self.deref()` into the pipe function.
§

#### fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R ) -> Rwhere Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows `self`, then passes `self.deref_mut()` into the pipe function.
§

### impl<T> Pointable for T

§

#### const ALIGN: usize = _

The alignment of pointer.
§

#### type Init = T

The type for initializers.
§

#### unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

#### unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

#### unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

#### unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

§

#### fn read_f32_into<T>(&mut self, dst: &mut [f32]) -> Result<(), Error>where T: ByteOrder,

Reads a sequence of IEEE754 single-precision (4 bytes) floating point numbers from the underlying reader. Read more
§

#### fn read_f32_into_unchecked<T>(&mut self, dst: &mut [f32]) -> Result<(), Error>where T: ByteOrder,

👎Deprecated since 1.2.0: please use `read_f32_into` instead
§

#### fn read_f64_into<T>(&mut self, dst: &mut [f64]) -> Result<(), Error>where T: ByteOrder,

Reads a sequence of IEEE754 double-precision (8 bytes) floating point numbers from the underlying reader. Read more
§

#### fn read_f64_into_unchecked<T>(&mut self, dst: &mut [f64]) -> Result<(), Error>where T: ByteOrder,

👎Deprecated since 1.2.0: please use `read_f64_into` instead
source§

### impl<T> Same for T

§

#### type Output = T

Should always be `Self`
§

### impl<T> SaturatedConversion for T

§

#### fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,

Convert from a value of `T` into an equivalent instance of `Self`. Read more
§

#### fn saturated_into<T>(self) -> Twhere Self: UniqueSaturatedInto<T>,

Consume self to return an equivalent value of `T`. Read more
§

### impl<T> Tap for T

§

§

§

#### fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,

Immutable access to the `Borrow<B>` of a value. Read more
§

#### fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,

Mutable access to the `BorrowMut<B>` of a value. Read more
§

#### fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,

Immutable access to the `AsRef<R>` view of a value. Read more
§

#### fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,

Mutable access to the `AsMut<R>` view of a value. Read more
§

#### fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,

Immutable access to the `Deref::Target` of a value. Read more
§

#### fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the `Deref::Target` of a value. Read more
§

#### fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls `.tap()` only in debug builds, and is erased in release builds.
§

#### fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls `.tap_mut()` only in debug builds, and is erased in release builds.
§

#### fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,

Calls `.tap_borrow()` only in debug builds, and is erased in release builds.
§

#### fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,

Calls `.tap_borrow_mut()` only in debug builds, and is erased in release builds.
§

#### fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,

Calls `.tap_ref()` only in debug builds, and is erased in release builds.
§

#### fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,

Calls `.tap_ref_mut()` only in debug builds, and is erased in release builds.
§

#### fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,

Calls `.tap_deref()` only in debug builds, and is erased in release builds.
§

#### fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls `.tap_deref_mut()` only in debug builds, and is erased in release builds.
source§

### impl<T> ToHex for Twhere T: AsRef<[u8]>,

source§

#### fn encode_hex<U>(&self) -> Uwhere U: FromIterator<char>,

Encode the hex strict representing `self` into the result. Lower case letters are used (e.g. `f9b4ca`)
source§

#### fn encode_hex_upper<U>(&self) -> Uwhere U: FromIterator<char>,

Encode the hex strict representing `self` into the result. Upper case letters are used (e.g. `F9B4CA`)
source§