Struct collections::btree_map::Range
[−]
[src]
pub struct Range<'a, 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)
Unstable (
collections #27783): library is unlikely to be stabilized with the current layout and name, use std::collections instead
fn next(&mut self) -> Option<(&'a K, &'a V)>
Unstable (
collections #27783): library is unlikely to be stabilized with the current layout and name, use std::collections instead
fn size_hint(&self) -> (usize, Option<usize>)1.0.0
fn count(self) -> usize1.0.0
fn last(self) -> Option<Self::Item>1.0.0
fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0
fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0
fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0
fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0
fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0
fn enumerate(self) -> Enumerate<Self>1.0.0
fn peekable(self) -> Peekable<Self>1.0.0
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0
fn skip(self, n: usize) -> Skip<Self>1.0.0
fn take(self, n: usize) -> Take<Self>1.0.0
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0
fn fuse(self) -> Fuse<Self>1.0.0
fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0
fn by_ref(&mut self) -> &mut Self1.0.0
fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0
fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0
fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0
fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0
fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0
fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where Self: ExactSizeIterator + DoubleEndedIterator, P: FnMut(Self::Item) -> bool1.0.0
fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0
fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0
fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Iterator<Item=(A, B)>1.0.0
fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>1.0.0
fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0
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: Ord1.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<'a, K, V> DoubleEndedIterator for Range<'a, K, V>
fn next_back(&mut self) -> Option<(&'a K, &'a V)>
Unstable (
collections #27783): library is unlikely to be stabilized with the current layout and name, use std::collections instead
impl<'a, K, V> Clone for Range<'a, K, V>
fn clone(&self) -> Range<'a, K, V>
Unstable (
collections #27783): library is unlikely to be stabilized with the current layout and name, use std::collections instead