Struct rangemap::RangeMap

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

A map whose keys are stored as (half-open) ranges bounded inclusively below and exclusively above (start..end).

Contiguous and overlapping ranges that map to the same value are coalesced into a single range.

Implementations

impl<K, V> RangeMap<K, V> where
    K: Ord + Clone,
    V: Eq + Clone, 

pub fn new() -> Self

Makes a new empty RangeMap.

pub fn get(&self, key: &K) -> Option<&V>

Returns a reference to the value corresponding to the given key, if the key is covered by any range in the map.

pub fn get_key_value(&self, key: &K) -> Option<(&Range<K>, &V)>

Returns the range-value pair (as a pair of references) corresponding to the given key, if the key is covered by any range in the map.

pub fn contains_key(&self, key: &K) -> bool

Returns true if any range in the map covers the specified key.

pub fn iter(&self) -> impl Iterator<Item = (&Range<K>, &V)>

Gets an iterator over all pairs of key range and value, ordered by key range.

The iterator element type is (&'a Range<K>, &'a V).

pub fn insert(&mut self, range: Range<K>, value: V)

Insert a pair of key range and value into the map.

If the inserted range partially or completely overlaps any existing range in the map, then the existing range (or ranges) will be partially or completely replaced by the inserted range.

If the inserted range either overlaps or is immediately adjacent any existing range mapping to the same value, then the ranges will be coalesced into a single contiguous range.

Panics

Panics if range start >= end.

pub fn remove(&mut self, range: Range<K>)

Removes a range from the map, if all or any of it was present.

If the range to be removed partially overlaps any ranges in the map, then those ranges will be contracted to no longer cover the removed range.

Panics

Panics if range start >= end.

pub fn gaps<'a>(&'a self, outer_range: &'a Range<K>) -> Gaps<'a, K, V>

Gets an iterator over all the maximally-sized ranges contained in outer_range that are not covered by any range stored in the map.

The iterator element type is Range<K>.

NOTE: Calling gaps eagerly finds the first gap, even if the iterator is never consumed.

Trait Implementations

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

fn clone(&self) -> RangeMap<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 RangeMap<K, V> where
    K: Ord + Clone,
    V: Eq + Clone, 

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> Extend<(Range<K>, V)> for RangeMap<K, V> where
    K: Ord + Clone,
    V: Eq + Clone, 

fn extend<T: IntoIterator<Item = (Range<K>, V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<K, V> FromIterator<(Range<K>, V)> for RangeMap<K, V> where
    K: Ord + Clone,
    V: Eq + Clone, 

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

Creates a value from an iterator.

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

type Item = (Range<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.