# Struct core::slice::RChunks 1.31.0[−][src]

    pub struct RChunks<'a, T: 'a> { /* fields omitted */ }

An iterator over a slice in (non-overlapping) chunks (`chunk_size` elements at a time), starting at the end of the slice.

When the slice len is not evenly divided by the chunk size, the last slice of the iteration will be the remainder.

This struct is created by the `rchunks` method on slices.

# Example

    let slice = ['l', 'o', 'r', 'e', 'm'];
    let iter = slice.rchunks(2);

Run

## Trait Implementations

### `impl<T> Clone for RChunks<'_, T>`[src]

#### `fn clone(&self) -> Self`[src]

Returns a copy of the value. Read more

#### `fn clone_from(&mut self, source: &Self)`1.0.0[src]

Performs copy-assignment from `source`. Read more

### `impl<'a, T: Debug + 'a> Debug for RChunks<'a, T>`[src]

#### `fn fmt(&self, f: &mut Formatter<'_>) -> Result`[src]

Formats the value using the given formatter. Read more

### `impl<'a, T> DoubleEndedIterator for RChunks<'a, T>`[src]

#### `fn next_back(&mut self) -> Option<&'a [T]>`[src]

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

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

Returns the `n`th element from the end of the iterator. Read more

#### `fn advance_back_by(&mut self, n: usize) -> Result<(), usize>`[src]

🔬 This is a nightly-only experimental API. (`iter_advance_by` #77404)

recently added

Advances the iterator from the back by `n` elements. Read more

#### `fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
Self: Sized,
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,` 1.27.0[src]

This is the reverse version of `Iterator::try_fold()`: it takes elements starting from the back of the iterator. Read more

#### `fn rfold<B, F>(self, init: B, f: F) -> B where
Self: Sized,
F: FnMut(B, Self::Item) -> B,` 1.27.0[src]

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

#### `fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
Self: Sized,
P: FnMut(&Self::Item) -> bool,` 1.27.0[src]

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

### `impl<T> ExactSizeIterator for RChunks<'_, T>`[src]

#### `fn len(&self) -> usize` 1.0.0[src]

Returns the exact length of the iterator. Read more

#### `fn is_empty(&self) -> bool`[src]

🔬 This is a nightly-only experimental API. (`exact_size_is_empty` #35428)

Returns `true` if the iterator is empty. Read more

### `impl<T> FusedIterator for RChunks<'_, T>`[src]

### `impl<'a, T> Iterator for RChunks<'a, T>`[src]

#### `type Item = &'a [T]`

The type of the elements being iterated over.

#### `fn next(&mut self) -> Option<&'a [T]>`[src]

Advances the iterator and returns the next value. Read more

#### `fn size_hint(&self) -> (usize, Option<usize>)`[src]

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

#### `fn count(self) -> usize`[src]

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

#### `fn nth(&mut self, n: usize) -> Option<Self::Item>`[src]

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

#### `fn last(self) -> Option<Self::Item>`[src]

Consumes the iterator, returning the last element. Read more

#### `fn advance_by(&mut self, n: usize) -> Result<(), usize>`[src]

🔬 This is a nightly-only experimental API. (`iter_advance_by` #77404)

recently added

Advances the iterator by `n` elements. Read more

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

### Notable traits for StepBy<I>

`impl<I> Iterator for StepBy<I> where
I: Iterator, type Item = I::Item;`
where
Self: Sized,` 1.28.0[src]

Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

#### `fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter>ⓘ

### Notable traits for Chain<A, B>

`impl<A, B> Iterator for Chain<A, B> where
A: Iterator,
B: Iterator<Item = A::Item>, type Item = A::Item;`
where
Self: Sized,
U: IntoIterator<Item = Self::Item>,` 1.0.0[src]

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

#### `fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter>ⓘ

### Notable traits for Zip<A, B>

`impl<A, B> Iterator for Zip<A, B> where
A: Iterator,
B: Iterator, type Item = (A::Item, B::Item);`
where
Self: Sized,
U: IntoIterator,` 1.0.0[src]

'Zips up' two iterators into a single iterator of pairs. Read more

#### `fn intersperse(self, separator: Self::Item) -> Intersperse<Self>ⓘ

### Notable traits for Intersperse<I>

`impl<I> Iterator for Intersperse<I> where
I: Iterator,
I::Item: Clone, type Item = I::Item;`
where
Self: Sized,
Self::Item: Clone,` [src]

🔬 This is a nightly-only experimental API. (`iter_intersperse` #79524)

recently added

Creates a new iterator which places a copy of `separator` between adjacent items of the original iterator. Read more

#### `fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>ⓘ

### Notable traits for IntersperseWith<I, G>

`impl<I, G> Iterator for IntersperseWith<I, G> where
I: Iterator,
G: FnMut() -> I::Item, type Item = I::Item;`
where
Self: Sized,
G: FnMut() -> Self::Item,` [src]

🔬 This is a nightly-only experimental API. (`iter_intersperse` #79524)

recently added

Creates a new iterator which places an item generated by `separator` between adjacent items of the original iterator. Read more

#### `fn map<B, F>(self, f: F) -> Map<Self, F>ⓘ

### Notable traits for Map<I, F>

`impl<B, I: Iterator, F> Iterator for Map<I, F> where
F: FnMut(I::Item) -> B, type Item = B;`
where
Self: Sized,
F: FnMut(Self::Item) -> B,` 1.0.0[src]

Takes a closure and creates an iterator which calls that closure on each element. Read more

#### `fn for_each<F>(self, f: F) where
Self: Sized,
F: FnMut(Self::Item),` 1.21.0[src]

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

#### `fn filter<P>(self, predicate: P) -> Filter<Self, P>ⓘ

### Notable traits for Filter<I, P>

`impl<I: Iterator, P> Iterator for Filter<I, P> where
P: FnMut(&I::Item) -> bool, type Item = I::Item;`
where
Self: Sized,
P: FnMut(&Self::Item) -> bool,` 1.0.0[src]

Creates an iterator which uses a closure to determine if an element should be yielded. Read more

#### `fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>ⓘ

### Notable traits for FilterMap<I, F>

`impl<B, I: Iterator, F> Iterator for FilterMap<I, F> where
F: FnMut(I::Item) -> Option<B>, type Item = B;`
where
Self: Sized,
F: FnMut(Self::Item) -> Option<B>,` 1.0.0[src]

Creates an iterator that both filters and maps. Read more

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

### Notable traits for Enumerate<I>

`impl<I> Iterator for Enumerate<I> where
I: Iterator, type Item = (usize, <I as Iterator>::Item);`
where
Self: Sized,` 1.0.0[src]

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

#### `fn peekable(self) -> Peekable<Self>ⓘ

### Notable traits for Peekable<I>

`impl<I: Iterator> Iterator for Peekable<I> type Item = I::Item;`
where
Self: Sized,` 1.0.0[src]

Creates an iterator which can use `peek` to look at the next element of the iterator without consuming it. Read more

#### `fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>ⓘ

### Notable traits for SkipWhile<I, P>

`impl<I: Iterator, P> Iterator for SkipWhile<I, P> where
P: FnMut(&I::Item) -> bool, type Item = I::Item;`
where
Self: Sized,
P: FnMut(&Self::Item) -> bool,` 1.0.0[src]

Creates an iterator that `skip`s elements based on a predicate. Read more

#### `fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>ⓘ

### Notable traits for TakeWhile<I, P>

`impl<I: Iterator, P> Iterator for TakeWhile<I, P> where
P: FnMut(&I::Item) -> bool, type Item = I::Item;`
where
Self: Sized,
P: FnMut(&Self::Item) -> bool,` 1.0.0[src]

Creates an iterator that yields elements based on a predicate. Read more

#### `fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>ⓘ

### Notable traits for MapWhile<I, P>

`impl<B, I: Iterator, P> Iterator for MapWhile<I, P> where
P: FnMut(I::Item) -> Option<B>, type Item = B;`
where
Self: Sized,
P: FnMut(Self::Item) -> Option<B>,` [src]

🔬 This is a nightly-only experimental API. (`iter_map_while` #68537)

recently added

Creates an iterator that both yields elements based on a predicate and maps. Read more

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

### Notable traits for Skip<I>

`impl<I> Iterator for Skip<I> where
I: Iterator, type Item = <I as Iterator>::Item;`
where
Self: Sized,` 1.0.0[src]

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

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

### Notable traits for Take<I>

`impl<I> Iterator for Take<I> where
I: Iterator, type Item = <I as Iterator>::Item;`
where
Self: Sized,` 1.0.0[src]

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

#### `fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>ⓘ

### Notable traits for Scan<I, St, F>

`impl<B, I, St, F> Iterator for Scan<I, St, F> where
I: Iterator,
F: FnMut(&mut St, I::Item) -> Option<B>, type Item = B;`
where
Self: Sized,
F: FnMut(&mut St, Self::Item) -> Option<B>,` 1.0.0[src]

An iterator adaptor similar to `fold` that holds internal state and produces a new iterator. Read more

#### `fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>ⓘ

### Notable traits for FlatMap<I, U, F>

`impl<I: Iterator, U: IntoIterator, F> Iterator for FlatMap<I, U, F> where
F: FnMut(I::Item) -> U, type Item = U::Item;`
where
Self: Sized,
U: IntoIterator,
F: FnMut(Self::Item) -> U,` 1.0.0[src]

Creates an iterator that works like map, but flattens nested structure. Read more

#### `fn flatten(self) -> Flatten<Self>ⓘ

### Notable traits for Flatten<I>

`impl<I, U> Iterator for Flatten<I> where
I: Iterator<Item: IntoIterator<IntoIter = U, Item = U::Item>>,
U: Iterator, type Item = U::Item;`
where
Self: Sized,
Self::Item: IntoIterator,` 1.29.0[src]

Creates an iterator that flattens nested structure. Read more

#### `fn fuse(self) -> Fuse<Self>ⓘ

### Notable traits for Fuse<I>

`impl<I> Iterator for Fuse<I> where
I: Iterator, type Item = <I as Iterator>::Item;`
where
Self: Sized,` 1.0.0[src]

Creates an iterator which ends after the first `None`. Read more

#### `fn inspect<F>(self, f: F) -> Inspect<Self, F>ⓘ

### Notable traits for Inspect<I, F>

`impl<I: Iterator, F> Iterator for Inspect<I, F> where
F: FnMut(&I::Item), type Item = I::Item;`
where
Self: Sized,
F: FnMut(&Self::Item),` 1.0.0[src]

Does something with each element of an iterator, passing the value on. Read more

#### `fn by_ref(&mut self) -> &mut Self where
Self: Sized,` 1.0.0[src]

Borrows an iterator, rather than consuming it. Read more

#### `#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]fn collect<B: FromIterator<Self::Item>>(self) -> B where
Self: Sized,` 1.0.0[src]

Transforms an iterator into a collection. Read more

#### `fn partition<B, F>(self, f: F) -> (B, B) where
Self: Sized,
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,` 1.0.0[src]

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

#### `fn partition_in_place<'a, T: 'a, P>(self, predicate: P) -> usize where
Self: Sized + DoubleEndedIterator<Item = &'a mut T>,
P: FnMut(&T) -> bool,` [src]

🔬 This is a nightly-only experimental API. (`iter_partition_in_place` #62543)

new API

Reorders the elements of this iterator in-place according to the given predicate, such that all those that return `true` precede all those that return `false`. Returns the number of `true` elements found. Read more

#### `fn is_partitioned<P>(self, predicate: P) -> bool where
Self: Sized,
P: FnMut(Self::Item) -> bool,` [src]

🔬 This is a nightly-only experimental API. (`iter_is_partitioned` #62544)

new API

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

#### `fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
Self: Sized,
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,` 1.27.0[src]

An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more

#### `fn try_for_each<F, R>(&mut self, f: F) -> R where
Self: Sized,
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,` 1.27.0[src]

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

#### `fn fold<B, F>(self, init: B, f: F) -> B where
Self: Sized,
F: FnMut(B, Self::Item) -> B,` 1.0.0[src]

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

#### `fn reduce<F>(self, f: F) -> Option<Self::Item> where
Self: Sized,
F: FnMut(Self::Item, Self::Item) -> Self::Item,` 1.51.0[src]

Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more

#### `fn all<F>(&mut self, f: F) -> bool where
Self: Sized,
F: FnMut(Self::Item) -> bool,` 1.0.0[src]

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

#### `fn any<F>(&mut self, f: F) -> bool where
Self: Sized,
F: FnMut(Self::Item) -> bool,` 1.0.0[src]

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

#### `fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
Self: Sized,
P: FnMut(&Self::Item) -> bool,` 1.0.0[src]

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

#### `fn find_map<B, F>(&mut self, f: F) -> Option<B> where
Self: Sized,
F: FnMut(Self::Item) -> Option<B>,` 1.30.0[src]

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

#### `fn try_find<F, R>(&mut self, f: F) -> Result<Option<Self::Item>, R::Error> where
Self: Sized,
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool>,` [src]

🔬 This is a nightly-only experimental API. (`try_find` #63178)

new API

Applies function to the elements of iterator and returns the first true result or the first error. Read more

#### `fn position<P>(&mut self, predicate: P) -> Option<usize> where
Self: Sized,
P: FnMut(Self::Item) -> bool,` 1.0.0[src]

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

#### `fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: Sized + ExactSizeIterator + DoubleEndedIterator,` 1.0.0[src]

Searches for an element in an iterator from the right, returning its index. Read more

#### `fn max(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord,` 1.0.0[src]

Returns the maximum element of an iterator. Read more

#### `fn min(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord,` 1.0.0[src]

Returns the minimum element of an iterator. Read more

#### `fn max_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item> where
Self: Sized,
F: FnMut(&Self::Item) -> B,` 1.6.0[src]

Returns the element that gives the maximum value from the specified function. Read more

#### `fn max_by<F>(self, compare: F) -> Option<Self::Item> where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,` 1.15.0[src]

Returns the element that gives the maximum value with respect to the specified comparison function. Read more

#### `fn min_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item> where
Self: Sized,
F: FnMut(&Self::Item) -> B,` 1.6.0[src]

Returns the element that gives the minimum value from the specified function. Read more

#### `fn min_by<F>(self, compare: F) -> Option<Self::Item> where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,` 1.15.0[src]

Returns the element that gives the minimum value with respect to the specified comparison function. Read more

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

### Notable traits for Rev<I>

`impl<I> Iterator for Rev<I> where
I: DoubleEndedIterator, type Item = <I as Iterator>::Item;`
where
Self: Sized + DoubleEndedIterator,` 1.0.0[src]

Reverses an iterator's direction. Read more

#### `fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Sized + Iterator<Item = (A, B)>,` 1.0.0[src]

Converts an iterator of pairs into a pair of containers. Read more

#### `fn copied<'a, T: 'a>(self) -> Copied<Self>ⓘ

### Notable traits for Copied<I>

`impl<'a, I, T: 'a> Iterator for Copied<I> where
I: Iterator<Item = &'a T>,
T: Copy, type Item = T;`
where
Self: Sized + Iterator<Item = &'a T>,
T: Copy,` 1.36.0[src]

Creates an iterator which copies all of its elements. Read more

#### `fn cloned<'a, T: 'a>(self) -> Cloned<Self>ⓘ

### Notable traits for Cloned<I>

`impl<'a, I, T: 'a> Iterator for Cloned<I> where
I: Iterator<Item = &'a T>,
T: Clone, type Item = T;`
where
Self: Sized + Iterator<Item = &'a T>,
T: Clone,` 1.0.0[src]

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

#### `fn cycle(self) -> Cycle<Self>ⓘ

### Notable traits for Cycle<I>

`impl<I> Iterator for Cycle<I> where
I: Clone + Iterator, type Item = <I as Iterator>::Item;`
where
Self: Sized + Clone,` 1.0.0[src]

Repeats an iterator endlessly. Read more

#### `fn sum<S>(self) -> S where
Self: Sized,
S: Sum<Self::Item>,` 1.11.0[src]

Sums the elements of an iterator. Read more

#### `fn product<P>(self) -> P where
Self: Sized,
P: Product<Self::Item>,` 1.11.0[src]

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

#### `fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Self: Sized,` 1.5.0[src]

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

#### `fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
Self: Sized,
I: IntoIterator,
F: FnMut(Self::Item, I::Item) -> Ordering,` [src]

🔬 This is a nightly-only experimental API. (`iter_order_by` #64295)

Lexicographically compares the elements of this `Iterator` with those of another with respect to the specified comparison function. Read more

#### `fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized,` 1.5.0[src]

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

#### `fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
Self: Sized,
I: IntoIterator,
F: FnMut(Self::Item, I::Item) -> Option<Ordering>,` [src]

🔬 This is a nightly-only experimental API. (`iter_order_by` #64295)

Lexicographically compares the elements of this `Iterator` with those of another with respect to the specified comparison function. Read more

#### `fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<I::Item>,
Self: Sized,` 1.5.0[src]

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

#### `fn eq_by<I, F>(self, other: I, eq: F) -> bool where
Self: Sized,
I: IntoIterator,
F: FnMut(Self::Item, I::Item) -> bool,` [src]

🔬 This is a nightly-only experimental API. (`iter_order_by` #64295)

Determines if the elements of this `Iterator` are equal to those of another with respect to the specified equality function. Read more

#### `fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<I::Item>,
Self: Sized,` 1.5.0[src]

Determines if the elements of this `Iterator` are unequal to those of another. Read more

#### `fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized,` 1.5.0[src]

Determines if the elements of this `Iterator` are lexicographically less than those of another. Read more

#### `fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized,` 1.5.0[src]

Determines if the elements of this `Iterator` are lexicographically less or equal to those of another. Read more

#### `fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized,` 1.5.0[src]

Determines if the elements of this `Iterator` are lexicographically greater than those of another. Read more

#### `fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized,` 1.5.0[src]

Determines if the elements of this `Iterator` are lexicographically greater than or equal to those of another. Read more

#### `fn is_sorted(self) -> bool where
Self: Sized,
Self::Item: PartialOrd,` [src]

🔬 This is a nightly-only experimental API. (`is_sorted` #53485)

new API

Checks if the elements of this iterator are sorted. Read more

#### `fn is_sorted_by<F>(self, compare: F) -> bool where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,` [src]

🔬 This is a nightly-only experimental API. (`is_sorted` #53485)

new API

Checks if the elements of this iterator are sorted using the given comparator function. Read more

#### `fn is_sorted_by_key<F, K>(self, f: F) -> bool where
Self: Sized,
F: FnMut(Self::Item) -> K,
K: PartialOrd,` [src]

🔬 This is a nightly-only experimental API. (`is_sorted` #53485)

new API

Checks if the elements of this iterator are sorted using the given key extraction function. Read more

### `impl<T> TrustedLen for RChunks<'_, T>`[src]

## Auto Trait Implementations

### `impl<'a, T> Send for RChunks<'a, T> where
T: Sync,` [src]

### `impl<'a, T> Sync for RChunks<'a, T> where
T: Sync,` [src]

### `impl<'a, T> Unpin for RChunks<'a, T>`[src]

## Blanket Implementations

### `impl<T> Any for T where
T: 'static + ?Sized,` [src]

#### `pub fn type_id(&Self) -> TypeId`[src]

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

### `impl<T> Borrow<T> for T where
T: ?Sized,` [src]

#### `pub fn borrow(&Self) -> &T`[src]

Immutably borrows from an owned value. Read more

### `impl<T> BorrowMut<T> for T where
T: ?Sized,` [src]

#### `pub fn borrow_mut(&mut Self) -> &mut T`[src]

Mutably borrows from an owned value. Read more

### `impl<T> From<T> for T`[src]

#### `pub fn from(T) -> T`[src]

Performs the conversion.

### `impl<T, U> Into<U> for T where
U: From<T>,` [src]

#### `pub fn into(Self) -> U`[src]

Performs the conversion.

### `impl<T, U> TryFrom<U> for T where
U: Into<T>,` [src]

#### `type Error = Infallible`

The type returned in the event of a conversion error.

#### `pub fn try_from(U) -> Result<T, <T as TryFrom<U>>::Error>`[src]

Performs the conversion.

### `impl<T, U> TryInto<U> for T where
U: TryFrom<T>,` [src]

#### `type Error = <U as TryFrom<T>>::Error`

The type returned in the event of a conversion error.

#### `pub fn try_into(Self) -> Result<U, <U as TryFrom<T>>::Error>`[src]

Performs the conversion.