# Struct bitflags::__core::ops::Range [−] [src]

    pub struct Range<Idx> {
        pub start: Idx,
        pub end: Idx,
    }

1.0.0

A (half-open) range which is bounded at both ends: { x | start <= x < end }. Use `start..end` (two dots) for its shorthand.

See the `contains()` method for its characterization.

# Examples

    #![feature(iter_arith)]
    fn main() {
        assert_eq!((3..5), std::ops::Range{ start: 3, end: 5 });
        assert_eq!(3+4+5, (3..6).sum());

        let arr = [0, 1, 2, 3];
        assert_eq!(arr[ .. ], [0,1,2,3]);
        assert_eq!(arr[ ..3], [0,1,2  ]);
        assert_eq!(arr[1.. ], [  1,2,3]);
        assert_eq!(arr[1..3], [  1,2  ]);  // Range
    }

## Fields

`start` | The lower bound of the range (inclusive).
`end` | The upper bound of the range (exclusive).

## Methods

### `impl<A> Range<A> where A: Step`

#### `fn step_by(self, by: A) -> StepBy<A, Range<A>>`

Unstable (`step_by`)

: recent addition

Creates an iterator with the same range, but stepping by the given amount at each iteration.

The resulting iterator handles overflow by stopping.

# Examples

    #![feature(step_by)]

    for i in (0..10).step_by(2) {
        println!("{}", i);
    }

This prints:

    0
    2
    4
    6
    8

### `impl<Idx> Range<Idx> where Idx: PartialOrd<Idx>`

#### `fn contains(&self, item: Idx) -> bool`

Unstable (`range_contains`)

: recently added as per RFC

# Examples

    #![feature(range_contains)]
    fn main() {
        assert!( ! (3..5).contains(2));
        assert!(   (3..5).contains(3));
        assert!(   (3..5).contains(4));
        assert!( ! (3..5).contains(5));

        assert!( ! (3..3).contains(3));
        assert!( ! (3..2).contains(3));
    }

## Trait Implementations

### `impl<A> Iterator for Range<A> where A: One + Step, &'a A: Add<&'a A>, &'a A::Output == A`

#### `type Item = A`

#### `fn next(&mut self) -> Option<A>`

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

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

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

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

#### `fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>`

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

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

#### `fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool`

#### `fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>`

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

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

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

#### `fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool`

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

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

#### `fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>`

#### `fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator`

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

#### `fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()`

#### `fn by_ref(&mut self) -> &mut Self`

#### `fn collect<B>(self) -> B where B: FromIterator<Self::Item>`

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

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

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

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

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

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

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

#### `fn max(self) -> Option<Self::Item> where Self::Item: Ord`

#### `fn min(self) -> Option<Self::Item> where Self::Item: Ord`

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

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

#### `fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator`

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

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

#### `fn cycle(self) -> Cycle<Self> where Self: Clone`

#### `fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero`

#### `fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One`

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

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

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

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

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

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

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

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

### `impl ExactSizeIterator for Range<usize>`

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

### `impl ExactSizeIterator for Range<u8>`

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

### `impl ExactSizeIterator for Range<u16>`

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

### `impl ExactSizeIterator for Range<u32>`

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

### `impl ExactSizeIterator for Range<isize>`

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

### `impl ExactSizeIterator for Range<i8>`

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

### `impl ExactSizeIterator for Range<i16>`

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

### `impl ExactSizeIterator for Range<i32>`

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

### `impl<A> DoubleEndedIterator for Range<A> where A: Clone + Step + One, &'a A: Add<&'a A>, &'a A: Sub<&'a A>, &'a A::Output == A, &'a A::Output == A`

#### `fn next_back(&mut self) -> Option<A>`

### `impl<Idx> Debug for Range<Idx> where Idx: Debug`

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

### `impl<T> RangeArgument<T> for Range<T>`

#### `fn start(&self) -> Option<&T>`

Unstable (`collections_range`)

: waiting for dust to settle on inclusive ranges

#### `fn end(&self) -> Option<&T>`

Unstable (`collections_range`)

: waiting for dust to settle on inclusive ranges

### Derived Implementations

### `impl<Idx> Eq for Range<Idx> where Idx: Eq`

### `impl<Idx> PartialEq<Range<Idx>> for Range<Idx> where Idx: PartialEq<Idx>`

#### `fn eq(&self, __arg_0: &Range<Idx>) -> bool`

#### `fn ne(&self, __arg_0: &Range<Idx>) -> bool`

### `impl<Idx> Clone for Range<Idx> where Idx: Clone`

#### `fn clone(&self) -> Range<Idx>`

#### `fn clone_from(&mut self, source: &Self)`

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)