Enum std::collections::Bound

pub enum Bound<T> {
    Included(T),
    Excluded(T),
    Unbounded,
}

An endpoint of a range of keys.

Examples

Bounds are range endpoints:

#![feature(collections_range)]

use std::collections::range::RangeArgument;
use std::collections::Bound::*;

assert_eq!((..100).start(), Unbounded);
assert_eq!((1..12).start(), Included(&1));
assert_eq!((1..12).end(), Excluded(&12));

Using a tuple of Bounds as an argument to BTreeMap::range. Note that in most cases, it's better to use range syntax (1..5) instead.

use std::collections::BTreeMap;
use std::collections::Bound::{Excluded, Included, Unbounded};

let mut map = BTreeMap::new();
map.insert(3, "a");
map.insert(5, "b");
map.insert(8, "c");

for (key, value) in map.range((Excluded(3), Included(8))) {
    println!("{}: {}", key, value);
}

assert_eq!(Some((&3, &"a")), map.range((Unbounded, Included(5))).next());

Variants

Included(T)

An inclusive bound.

Excluded(T)

An exclusive bound.

Unbounded

An infinite endpoint. Indicates that there is no bound in this direction.

Trait Implementations

impl<T> Copy for Bound<T> where
    T: Copy, 

impl<T> Clone for Bound<T> where
    T: Clone, 

fn clone(&self) -> Bound<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Hash for Bound<T> where
    T: Hash, 

fn hash<__HT>(&self, __arg_0: &mut __HT) where
    __HT: Hasher, 

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<T> PartialEq<Bound<T>> for Bound<T> where
    T: PartialEq<T>, 

fn eq(&self, __arg_0: &Bound<T>) -> bool

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

fn ne(&self, __arg_0: &Bound<T>) -> bool

This method tests for !=.

impl<T> Eq for Bound<T> where
    T: Eq, 

impl<T> Debug for Bound<T> where
    T: Debug, 

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

Formats the value using the given formatter.