Struct interval_map::interval_map::IntervalMap

pub struct IntervalMap<K, V> { /* fields omitted */ }

Methods

impl<K, V> IntervalMap<K, V>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn capacity(&self) -> usize

pub fn keys(&self) -> Keys<K, V>

pub fn values(&self) -> Values<K, V>

pub fn values_mut(&mut self) -> ValuesMut<K, V>

pub fn iter(&self) -> Iter<K, V>

pub fn iter_mut(&mut self) -> IterMut<K, V>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn drain(&mut self) -> Drain<K, V>

pub fn clear(&mut self)

pub fn reserve(&mut self, additional: usize)

pub fn shrink_to_fit(&mut self)

pub fn get<Q: ?Sized>(&self, key: &Q) -> Option<&V> where
    K: Borrow<Q>,
    Q: Ord, 

pub fn get_key_value<Q: ?Sized>(&self, key: &Q) -> Option<(&Interval<K>, &V)> where
    K: Borrow<Q>,
    Q: Ord, 

pub fn contains_key<Q: ?Sized>(&self, key: &Q) -> bool where
    K: Borrow<Q>,
    Q: Ord, 

pub fn get_mut<Q: ?Sized>(&mut self, key: &Q) -> Option<&mut V> where
    K: Borrow<Q>,
    Q: Ord, 

pub fn range<T, R>(&self, r: R) -> Iter<K, V> where
    K: Borrow<T>,
    R: Into<Interval<T>>,
    T: Ord, 

pub fn range_mut<T, R>(&mut self, r: R) -> IterMut<K, V> where
    K: Borrow<T>,
    R: Into<Interval<T>>,
    T: Ord, 

pub fn entry(&mut self, key: K) -> Entry<K, V> where
    K: Ord + Clone, 

impl<K, V> IntervalMap<K, V> where
    K: Ord + Clone,
    V: Clone, 

pub fn insert<T: Into<Interval<K>>>(&mut self, key: T, val: V)

pub fn overwrite<T: Into<Interval<K>>>(&mut self, key: T, val: V)

pub fn remove<T: Into<Interval<K>>>(&mut self, key: T)

pub fn append(&mut self, other: &mut Self) where
    K: Debug, 

pub fn split_off<Q>(&mut self, key: K) -> Self

Trait Implementations

impl<K: Clone, V: Clone> Clone for IntervalMap<K, V>

fn clone(&self) -> IntervalMap<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for IntervalMap<K, V>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<K, V> Default for IntervalMap<K, V> where
    K: Ord + Clone,
    V: Clone, 

fn default() -> Self

Returns the "default value" for a type.

impl<K: Eq, V: Eq> Eq for IntervalMap<K, V>

impl<'a, K, V> Extend<(&'a Interval<K>, &'a V)> for IntervalMap<K, V> where
    K: 'a + Ord + Clone,
    V: 'a + Clone, 

fn extend<I>(&mut self, iter: I) where
    I: IntoIterator<Item = (&'a Interval<K>, &'a V)>, 

Extends a collection with the contents of an iterator.

impl<K, V> Extend<(Interval<K>, V)> for IntervalMap<K, V> where
    K: Ord + Clone,
    V: Clone, 

fn extend<I>(&mut self, iter: I) where
    I: IntoIterator<Item = (Interval<K>, V)>, 

Extends a collection with the contents of an iterator.

impl<K, I, V> FromIterator<(I, V)> for IntervalMap<K, V> where
    K: Ord + Clone,
    I: Into<Interval<K>>,
    V: Clone, 

fn from_iter<T: IntoIterator<Item = (I, V)>>(iter: T) -> Self

Creates a value from an iterator.

impl<K: Hash, V: Hash> Hash for IntervalMap<K, V>

fn hash<__H: Hasher>(&self, state: &mut __H)

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<'_, K, Q: ?Sized, V> Index<&'_ Q> for IntervalMap<K, V> where
    K: Borrow<Q>,
    Q: Ord, 

type Output = V

The returned type after indexing.

fn index(&self, key: &Q) -> &V

Performs the indexing (container[index]) operation.

impl<K, V> IntoIterator for IntervalMap<K, V>

type Item = (Interval<K>, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, K, V> IntoIterator for &'a IntervalMap<K, V>

type Item = (&'a Interval<K>, &'a V)

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, K, V> IntoIterator for &'a mut IntervalMap<K, V>

type Item = (&'a Interval<K>, &'a mut V)

The type of the elements being iterated over.

type IntoIter = IterMut<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: PartialEq, V: PartialEq> PartialEq<IntervalMap<K, V>> for IntervalMap<K, V>

fn eq(&self, other: &IntervalMap<K, V>) -> bool

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

fn ne(&self, other: &IntervalMap<K, V>) -> bool

This method tests for !=.

impl<K, V> StructuralEq for IntervalMap<K, V>

impl<K, V> StructuralPartialEq for IntervalMap<K, V>