# Struct std::collections::btree_map::Range [−] [src]

    pub struct Range<'a, K, V> where K: 'a, V: 'a {
        // some fields omitted
    }

Unstable (`collections` #27783)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

An iterator over a sub-range of BTreeMap's entries.

## Trait Implementations

### `impl<'a, K, V> Iterator for Range<'a, K, V>`

#### `type Item = (&'a K, &'a V)`

#### `fn next(&mut self) -> Option<(&'a K, &'a V)>`

#### `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 Self: ExactSizeIterator + DoubleEndedIterator, P: FnMut(Self::Item) -> bool`

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

### `impl<'a, K, V> DoubleEndedIterator for Range<'a, K, V>`

#### `fn next_back(&mut self) -> Option<(&'a K, &'a V)>`

### `impl<'a, K, V> Clone for Range<'a, K, V>`

#### `fn clone(&self) -> Range<'a, K, V>`

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