pub struct RangeInclusive<Idx> {
pub start: Idx,
pub end: Idx,
}
An range bounded inclusively below and above (start..=end).
The RangeInclusive start..=end contains all values with x >= start and x <= end.
#![feature(inclusive_range,inclusive_range_syntax)]
assert_eq!((3..=5), std::ops::RangeInclusive { start: 3, end: 5 });
assert_eq!(3 + 4 + 5, (3..=5).sum());
let arr = [0, 1, 2, 3];
assert_eq!(arr[ ..=2], [0,1,2 ]);
assert_eq!(arr[1..=2], [ 1,2 ]); // RangeInclusive start: Idx The lower bound of the range (inclusive).
end: Idx The upper bound of the range (inclusive).
impl<Idx> RangeInclusive<Idx> where
    Idx: PartialOrd<Idx>,Â
[src]
fn contains(&self, item: Idx) -> bool
[src]
Returns true if item is contained in the range.
#![feature(range_contains,inclusive_range_syntax)] 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));
impl Index<RangeInclusive<usize>> for String
[src]
type Output = strThe returned type after indexing.
fn index(&self, index: RangeInclusive<usize>) -> &str
[src]
Performs the indexing (container[index]) operation.
impl<T> Index<RangeInclusive<usize>> for Vec<T>
[src]
type Output = [T]The returned type after indexing.
fn index(&self, index: RangeInclusive<usize>) -> &[T]
[src]
Performs the indexing (container[index]) operation.
impl<T> RangeArgument<T> for RangeInclusive<T>
[src]
fn start(&self) -> Bound<&T>
[src]
Start index bound. Read more
fn end(&self) -> Bound<&T>
[src]
End index bound. Read more
impl<T> IndexMut<RangeInclusive<usize>> for Vec<T>
[src]
fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut [T]
[src]
Performs the mutable indexing (container[index]) operation.
impl IndexMut<RangeInclusive<usize>> for String
[src]
fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut str
[src]
Performs the mutable indexing (container[index]) operation.
impl<Idx> Clone for RangeInclusive<Idx> where
    Idx: Clone,Â
[src]
fn clone(&self) -> RangeInclusive<Idx>
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
impl<Idx> Eq for RangeInclusive<Idx> where
    Idx: Eq,Â
[src]
impl<Idx> Hash for RangeInclusive<Idx> where
    Idx: Hash,Â
[src]
fn hash<__HIdx>(&self, __arg_0: &mut __HIdx) where
    __HIdx: Hasher,Â
[src]
Feeds this value into the given [Hasher]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher,Â
Feeds a slice of this type into the given [Hasher]. Read more
impl IndexMut<RangeInclusive<usize>> for str
[src]
fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut str
[src]
Performs the mutable indexing (container[index]) operation.
impl<A> DoubleEndedIterator for RangeInclusive<A> where
    A: Step,Â
[src]
fn next_back(&mut self) -> Option<A>
[src]
Removes and returns an element from the end of the iterator. Read more
fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    F: FnMut(B, Self::Item) -> R,
    R: Try<Ok = B>,Â
[src]
This is the reverse version of [try_fold()]: it takes elements starting from the back of the iterator. Read more
fn rfold<B, F>(self, accum: B, f: F) -> B where
    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
fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool,Â
[src]
Searches for an element of an iterator from the right that satisfies a predicate. Read more
impl<A> FusedIterator for RangeInclusive<A> where
    A: Step,Â
[src]
impl<Idx> PartialEq<RangeInclusive<Idx>> for RangeInclusive<Idx> where
    Idx: PartialEq<Idx>,Â
[src]
fn eq(&self, __arg_0: &RangeInclusive<Idx>) -> bool
[src]
This method tests for self and other values to be equal, and is used by ==. Read more
fn ne(&self, __arg_0: &RangeInclusive<Idx>) -> bool
[src]
This method tests for !=.
impl<A> Iterator for RangeInclusive<A> where
    A: Step,Â
[src]
type Item = AThe type of the elements being iterated over.
fn next(&mut self) -> Option<A>
[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 nth(&mut self, n: usize) -> Option<A>
[src]
Returns the nth element of the iterator. Read more
fn count(self) -> usize
Consumes the iterator, counting the number of iterations and returning it. Read more
fn last(self) -> Option<Self::Item>
Consumes the iterator, returning the last element. Read more
fn step_by(self, step: usize) -> StepBy<Self>
[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 as IntoIterator>::IntoIter> where
    U: IntoIterator<Item = Self::Item>,Â
Takes two iterators and creates a new iterator over both in sequence. Read more
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator,Â
'Zips up' two iterators into a single iterator of pairs. Read more
fn map<B, F>(self, f: F) -> Map<Self, F> where
    F: FnMut(Self::Item) -> B,Â
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn for_each<F>(self, f: F) where
    F: FnMut(Self::Item) -> (),Â
Calls a closure on each element of an iterator. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
    P: FnMut(&Self::Item) -> bool,Â
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> where
    F: FnMut(Self::Item) -> Option<B>,Â
Creates an iterator that both filters and maps. Read more
fn enumerate(self) -> Enumerate<Self>
Creates an iterator which gives the current iteration count as well as the next value. Read more
fn peekable(self) -> Peekable<Self>
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> where
    P: FnMut(&Self::Item) -> bool,Â
Creates an iterator that [skip]s elements based on a predicate. Read more
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool,Â
Creates an iterator that yields elements based on a predicate. 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 its first n elements. Read more
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
    F: FnMut(&mut St, Self::Item) -> Option<B>,Â
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> where
    F: FnMut(Self::Item) -> U,
    U: IntoIterator,Â
Creates an iterator that works like map, but flattens nested structure. Read more
fn fuse(self) -> Fuse<Self>
Creates an iterator which ends after the first [None]. Read more
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
    F: FnMut(&Self::Item) -> (),Â
Do something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self
Borrows an iterator, rather than consuming it. Read more
fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>,Â
Transforms an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where
    B: Default + Extend<Self::Item>,
    F: FnMut(&Self::Item) -> bool,Â
Consumes an iterator, creating two collections from it. Read more
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
    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
fn fold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B,Â
An iterator method that applies a function, producing a single, final value. Read more
fn all<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool,Â
Tests if every element of the iterator matches a predicate. Read more
fn any<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool,Â
Tests if any element of the iterator matches a predicate. Read more
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool,Â
Searches for an element of an iterator that satisfies a predicate. Read more
fn position<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool,Â
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: ExactSizeIterator + DoubleEndedIterator,Â
Searches for an element in an iterator from the right, returning its index. Read more
fn max(self) -> Option<Self::Item> where
    Self::Item: Ord,Â
Returns the maximum element of an iterator. Read more
fn min(self) -> Option<Self::Item> where
    Self::Item: Ord,Â
Returns the minimum element of an iterator. Read more
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B,Â
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
    F: FnMut(&Self::Item, &Self::Item) -> Ordering,Â
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B,Â
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
    F: FnMut(&Self::Item, &Self::Item) -> Ordering,Â
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
fn rev(self) -> Rev<Self> where
    Self: DoubleEndedIterator,Â
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: Iterator<Item = (A, B)>,Â
Converts an iterator of pairs into a pair of containers. Read more
fn cloned<'a, T>(self) -> Cloned<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Clone,Â
Creates an iterator which [clone]s all of its elements. Read more
fn cycle(self) -> Cycle<Self> where
    Self: Clone,Â
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
    S: Sum<Self::Item>,Â
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where
    P: Product<Self::Item>,Â
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,Â
Lexicographically compares the elements of this Iterator with those of another. Read more
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>,Â
Lexicographically compares the elements of this Iterator with those of another. Read more
fn eq<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>,Â
Determines if the elements of this Iterator are equal to those of another. Read more
fn ne<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>,Â
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 as IntoIterator>::Item>,Â
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 as IntoIterator>::Item>,Â
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 as IntoIterator>::Item>,Â
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 as IntoIterator>::Item>,Â
Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more
impl ExactSizeIterator for RangeInclusive<i8>
[src]
fn len(&self) -> usize
Returns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool
[src]
Returns whether the iterator is empty. Read more
impl ExactSizeIterator for RangeInclusive<i16>
[src]
fn len(&self) -> usize
Returns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool
[src]
Returns whether the iterator is empty. Read more
impl ExactSizeIterator for RangeInclusive<u16>
[src]
fn len(&self) -> usize
Returns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool
[src]
Returns whether the iterator is empty. Read more
impl ExactSizeIterator for RangeInclusive<u8>
[src]
fn len(&self) -> usize
Returns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool
[src]
Returns whether the iterator is empty. Read more
impl Index<RangeInclusive<usize>> for str
[src]
type Output = strThe returned type after indexing.
fn index(&self, index: RangeInclusive<usize>) -> &str
[src]
Performs the indexing (container[index]) operation.
impl TrustedLen for RangeInclusive<u64>
[src]
impl TrustedLen for RangeInclusive<i32>
[src]
impl TrustedLen for RangeInclusive<i8>
[src]
impl TrustedLen for RangeInclusive<isize>
[src]
impl TrustedLen for RangeInclusive<u32>
[src]
impl TrustedLen for RangeInclusive<u16>
[src]
impl TrustedLen for RangeInclusive<u8>
[src]
impl TrustedLen for RangeInclusive<i16>
[src]
impl TrustedLen for RangeInclusive<i64>
[src]
impl TrustedLen for RangeInclusive<usize>
[src]
impl<T> SliceIndex<[T]> for RangeInclusive<usize>
[src]
type Output = [T]The output type returned by methods.
fn get(self, slice: &[T]) -> Option<&[T]>
[src]
Returns a shared reference to the output at this location, if in bounds. Read more
fn get_mut(self, slice: &mut [T]) -> Option<&mut [T]>
[src]
Returns a mutable reference to the output at this location, if in bounds. Read more
unsafe fn get_unchecked(self, slice: &[T]) -> &[T]
[src]
Returns a shared reference to the output at this location, without performing any bounds checking. Read more
unsafe fn get_unchecked_mut(self, slice: &mut [T]) -> &mut [T]
[src]
Returns a mutable reference to the output at this location, without performing any bounds checking. Read more
fn index(self, slice: &[T]) -> &[T]
[src]
Returns a shared reference to the output at this location, panicking if out of bounds. Read more
fn index_mut(self, slice: &mut [T]) -> &mut [T]
[src]
Returns a mutable reference to the output at this location, panicking if out of bounds. Read more
impl SliceIndex<str> for RangeInclusive<usize>
type Output = strThe output type returned by methods.
fn get(
    self,
    slice: &str
) -> Option<&<RangeInclusive<usize> as SliceIndex<str>>::Output>
[src]
Returns a shared reference to the output at this location, if in bounds. Read more
fn get_mut(
    self,
    slice: &mut str
) -> Option<&mut <RangeInclusive<usize> as SliceIndex<str>>::Output>
[src]
Returns a mutable reference to the output at this location, if in bounds. Read more
unsafe fn get_unchecked(
    self,
    slice: &str
) -> &<RangeInclusive<usize> as SliceIndex<str>>::Output
[src]
Returns a shared reference to the output at this location, without performing any bounds checking. Read more
unsafe fn get_unchecked_mut(
    self,
    slice: &mut str
) -> &mut <RangeInclusive<usize> as SliceIndex<str>>::Output
[src]
Returns a mutable reference to the output at this location, without performing any bounds checking. Read more
fn index(
    self,
    slice: &str
) -> &<RangeInclusive<usize> as SliceIndex<str>>::Output
[src]
Returns a shared reference to the output at this location, panicking if out of bounds. Read more
fn index_mut(
    self,
    slice: &mut str
) -> &mut <RangeInclusive<usize> as SliceIndex<str>>::Output
[src]
Returns a mutable reference to the output at this location, panicking if out of bounds. Read more
impl<Idx> Debug for RangeInclusive<Idx> where
    Idx: Debug,Â
[src]
fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>
[src]
Formats the value using the given formatter. Read more
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/ops/struct.RangeInclusive.html