# 1.26.0[−][src]Struct core::ops::RangeInclusive

    #[lang = "RangeInclusive"]pub struct RangeInclusive<Idx> { /* fields omitted */ }

A range bounded inclusively below and above (`start..=end`).

The `RangeInclusive` `start..=end` contains all values with `x >= start` and `x <= end`. It is empty unless `start <= end`.

This iterator is fused, but the specific values of `start` and `end` after iteration has finished are unspecified other than that `.is_empty()` will return `true` once no more values will be produced.

# Examples

The `start..=end` syntax is a `RangeInclusive`:

    assert_eq!((3..=5), std::ops::RangeInclusive::new(3, 5));
    assert_eq!(3 + 4 + 5, (3..=5).sum());

Run

    let arr = [0, 1, 2, 3, 4];
    assert_eq!(arr[ ..  ], [0, 1, 2, 3, 4]);
    assert_eq!(arr[ .. 3], [0, 1, 2      ]);
    assert_eq!(arr[ ..=3], [0, 1, 2, 3   ]);
    assert_eq!(arr[1..  ], [   1, 2, 3, 4]);
    assert_eq!(arr[1.. 3], [   1, 2      ]);
    assert_eq!(arr[1..=3], [   1, 2, 3   ]); // This is a `RangeInclusive`

Run

## Implementations

### `impl<Idx> RangeInclusive<Idx>`[src]

#### `#[lang = "range_inclusive_new"]pub const fn new(start: Idx, end: Idx) -> Self` 1.27.0 (const: 1.32.0)[src]

Creates a new inclusive range. Equivalent to writing `start..=end`.

# Examples

    use std::ops::RangeInclusive;

    assert_eq!(3..=5, RangeInclusive::new(3, 5));

Run

#### `pub const fn start(&self) -> &Idx` 1.27.0 (const: 1.32.0)[src]

Returns the lower bound of the range (inclusive).

When using an inclusive range for iteration, the values of `start()` and `end()` are unspecified after the iteration ended. To determine whether the inclusive range is empty, use the `is_empty()` method instead of comparing `start() > end()`.

Note: the value returned by this method is unspecified after the range has been iterated to exhaustion.

# Examples

    assert_eq!((3..=5).start(), &3);

Run

#### `pub const fn end(&self) -> &Idx` 1.27.0 (const: 1.32.0)[src]

Returns the upper bound of the range (inclusive).

When using an inclusive range for iteration, the values of `start()` and `end()` are unspecified after the iteration ended. To determine whether the inclusive range is empty, use the `is_empty()` method instead of comparing `start() > end()`.

Note: the value returned by this method is unspecified after the range has been iterated to exhaustion.

# Examples

    assert_eq!((3..=5).end(), &5);

Run

#### `pub fn into_inner(self) -> (Idx, Idx)`1.27.0[src]

Destructures the `RangeInclusive` into (lower bound, upper (inclusive) bound).

Note: the value returned by this method is unspecified after the range has been iterated to exhaustion.

# Examples

    assert_eq!((3..=5).into_inner(), (3, 5));

Run

### `impl<Idx: PartialOrd<Idx>> RangeInclusive<Idx>`[src]

#### `pub fn contains<U: ?Sized>(&self, item: &U) -> bool where
Idx: PartialOrd<U>,
U: PartialOrd<Idx>,` 1.35.0[src]

Returns `true` if `item` is contained in the range.

# Examples

    assert!(!(3..=5).contains(&2));
    assert!( (3..=5).contains(&3));
    assert!( (3..=5).contains(&4));
    assert!( (3..=5).contains(&5));
    assert!(!(3..=5).contains(&6));

    assert!( (3..=3).contains(&3));
    assert!(!(3..=2).contains(&3));

    assert!( (0.0..=1.0).contains(&1.0));
    assert!(!(0.0..=1.0).contains(&f32::NAN));
    assert!(!(0.0..=f32::NAN).contains(&0.0));
    assert!(!(f32::NAN..=1.0).contains(&1.0));

Run

This method always returns `false` after iteration has finished:

    let mut r = 3..=5;
    assert!(r.contains(&3) && r.contains(&5));
    for _ in r.by_ref() {}
    // Precise field values are unspecified here
    assert!(!r.contains(&3) && !r.contains(&5));

Run

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

Returns `true` if the range contains no items.

# Examples

    assert!(!(3..=5).is_empty());
    assert!(!(3..=3).is_empty());
    assert!( (3..=2).is_empty());

Run

The range is empty if either side is incomparable:

    assert!(!(3.0..=5.0).is_empty());
    assert!( (3.0..=f32::NAN).is_empty());
    assert!( (f32::NAN..=5.0).is_empty());

Run

This method returns `true` after iteration has finished:

    let mut r = 3..=5;
    for _ in r.by_ref() {}
    // Precise field values are unspecified here
    assert!(r.is_empty());

Run

## Trait Implementations

### `impl<Idx: Clone> Clone for RangeInclusive<Idx>`[src]

#### `pub fn clone(&self) -> RangeInclusive<Idx>ⓘ

### Notable traits for RangeInclusive<A>

`impl<A: Step> Iterator for RangeInclusive<A> type Item = A;`
`[src]

Returns a copy of the value. Read more

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

Performs copy-assignment from `source`. Read more

### `impl<Idx: Debug> Debug for RangeInclusive<Idx>`[src]

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

Formats the value using the given formatter. Read more

### `impl<A: Step> DoubleEndedIterator for RangeInclusive<A>`[src]

#### `pub fn next_back(&mut self) -> Option<A>`[src]

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

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

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

#### `pub 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>,` [src]

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

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

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

#### `pub 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

#### `pub 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<Idx: Eq> Eq for RangeInclusive<Idx>`[src]

### `impl ExactSizeIterator for RangeInclusive<u8>`[src]

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

Returns the exact length of the iterator. Read more

#### `pub 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 ExactSizeIterator for RangeInclusive<i8>`[src]

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

Returns the exact length of the iterator. Read more

#### `pub 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 ExactSizeIterator for RangeInclusive<u16>`[src]

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

Returns the exact length of the iterator. Read more

#### `pub 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 ExactSizeIterator for RangeInclusive<i16>`[src]

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

Returns the exact length of the iterator. Read more

#### `pub 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<A: Step> FusedIterator for RangeInclusive<A>`[src]

### `impl<Idx: Hash> Hash for RangeInclusive<Idx>`[src]

#### `pub fn hash<__H: Hasher>(&self, state: &mut __H)`[src]

Feeds this value into the given `Hasher`. Read more

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

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

### `impl<A: Step> Iterator for RangeInclusive<A>`[src]

#### `type Item = A`

The type of the elements being iterated over.

#### `pub fn next(&mut self) -> Option<A>`[src]

Advances the iterator and returns the next value. Read more

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

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

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

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

#### `pub 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>,` [src]

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

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

An iterator method that applies a function, producing a single, final value. Read more

#### `pub fn last(self) -> Option<A>`[src]

Consumes the iterator, returning the last element. Read more

#### `pub fn min(self) -> Option<A>`[src]

Returns the minimum element of an iterator. Read more

#### `pub fn max(self) -> Option<A>`[src]

Returns the maximum element of an iterator. Read more

#### `pub fn count(self) -> usize where
Self: Sized,` 1.0.0[src]

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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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"]pub fn collect<B: FromIterator<Self::Item>>(self) -> B where
Self: Sized,` 1.0.0[src]

Transforms an iterator into a collection. Read more

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

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

🔬 This is a nightly-only experimental API. (`iterator_fold_self` #68125)

The same as `fold()`, but uses the first element in the iterator as the initial value, folding every subsequent element into it. If the iterator is empty, return `None`; otherwise, return the result of the fold. Read more

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

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

Sums the elements of an iterator. Read more

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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

#### `pub 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<Idx: PartialEq> PartialEq<RangeInclusive<Idx>> for RangeInclusive<Idx>`[src]

#### `pub fn eq(&self, other: &RangeInclusive<Idx>) -> bool`[src]

This method tests for `self` and `other` values to be equal, and is used by `==`. Read more

#### `pub fn ne(&self, other: &RangeInclusive<Idx>) -> bool`[src]

This method tests for `!=`.

### `impl<T> RangeBounds<T> for RangeInclusive<T>`1.28.0[src]

#### `pub fn start_bound(&self) -> Bound<&T>`[src]

Start index bound. Read more

#### `pub fn end_bound(&self) -> Bound<&T>`[src]

End index bound. Read more

#### `pub fn assert_len(self, len: usize) -> Range<usize>ⓘ

### Notable traits for Range<A>

`impl<A: Step> Iterator for Range<A> type Item = A;`
where
Self: RangeBounds<usize>,` [src]

🔬 This is a nightly-only experimental API. (`range_bounds_assert_len` #76393)

Performs bounds-checking of this range. Read more

#### `pub fn contains<U: ?Sized>(&self, item: &U) -> bool where
T: PartialOrd<U>,
U: PartialOrd<T>,` 1.35.0[src]

Returns `true` if `item` is contained in the range. Read more

### `impl<T, '_> RangeBounds<T> for RangeInclusive<&'_ T>`1.28.0[src]

#### `pub fn start_bound(&self) -> Bound<&T>`[src]

Start index bound. Read more

#### `pub fn end_bound(&self) -> Bound<&T>`[src]

End index bound. Read more

#### `pub fn assert_len(self, len: usize) -> Range<usize>ⓘ

### Notable traits for Range<A>

`impl<A: Step> Iterator for Range<A> type Item = A;`
where
Self: RangeBounds<usize>,` [src]

🔬 This is a nightly-only experimental API. (`range_bounds_assert_len` #76393)

Performs bounds-checking of this range. Read more

#### `pub fn contains<U: ?Sized>(&self, item: &U) -> bool where
T: PartialOrd<U>,
U: PartialOrd<T>,` 1.35.0[src]

Returns `true` if `item` is contained in the range. Read more

### `impl<T> SliceIndex<[T]> for RangeInclusive<usize>`[src]

#### `type Output = [T]`

The output type returned by methods.

#### `pub fn get(self, slice: &[T]) -> Option<&[T]>`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a shared reference to the output at this location, if in bounds. Read more

#### `pub fn get_mut(self, slice: &mut [T]) -> Option<&mut [T]>`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a mutable reference to the output at this location, if in bounds. Read more

#### `pub unsafe fn get_unchecked(self, slice: *const [T]) -> *const [T]`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a shared reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling `slice` pointer is undefined behavior even if the resulting reference is not used. Read more

#### `pub unsafe fn get_unchecked_mut(self, slice: *mut [T]) -> *mut [T]`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a mutable reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling `slice` pointer is undefined behavior even if the resulting reference is not used. Read more

#### `pub fn index(self, slice: &[T]) -> &[T]`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a shared reference to the output at this location, panicking if out of bounds. Read more

#### `pub fn index_mut(self, slice: &mut [T]) -> &mut [T]`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a mutable reference to the output at this location, panicking if out of bounds. Read more

### `impl SliceIndex<str> for RangeInclusive<usize>`[src]

Implements substring slicing with syntax `&self[begin ..= end]` or `&mut self[begin ..= end]`.

Returns a slice of the given string from the byte range [`begin`, `end`]. Equivalent to `&self [begin .. end + 1]` or `&mut self[begin .. end + 1]`, except if `end` has the maximum value for `usize`.

This operation is O(1).

# Panics

Panics if `begin` does not point to the starting byte offset of a character (as defined by `is_char_boundary`), if `end` does not point to the ending byte offset of a character (`end + 1` is either a starting byte offset or equal to `len`), if `begin > end`, or if `end >= len`.

#### `type Output = str`

The output type returned by methods.

#### `pub fn get(self, slice: &str) -> Option<&Self::Output>`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a shared reference to the output at this location, if in bounds. Read more

#### `pub fn get_mut(self, slice: &mut str) -> Option<&mut Self::Output>`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a mutable reference to the output at this location, if in bounds. Read more

#### `pub unsafe fn get_unchecked(self, slice: *const str) -> *const Self::Output`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a shared reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling `slice` pointer is undefined behavior even if the resulting reference is not used. Read more

#### `pub unsafe fn get_unchecked_mut(self, slice: *mut str) -> *mut Self::Output`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a mutable reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling `slice` pointer is undefined behavior even if the resulting reference is not used. Read more

#### `pub fn index(self, slice: &str) -> &Self::Output`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a shared reference to the output at this location, panicking if out of bounds. Read more

#### `pub fn index_mut(self, slice: &mut str) -> &mut Self::Output`[src]

🔬 This is a nightly-only experimental API. (`slice_index_methods`)

Returns a mutable reference to the output at this location, panicking if out of bounds. Read more

### `impl<Idx> StructuralEq for RangeInclusive<Idx>`[src]

### `impl<Idx> StructuralPartialEq for RangeInclusive<Idx>`[src]

### `impl<A: Step> TrustedLen for RangeInclusive<A>`[src]

## Auto Trait Implementations

### `impl<Idx> Send for RangeInclusive<Idx> where
Idx: Send,`

### `impl<Idx> Sync for RangeInclusive<Idx> where
Idx: Sync,`

### `impl<Idx> Unpin for RangeInclusive<Idx> where
Idx: Unpin,`

## 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.