Struct range_map::RangeMultiMap

pub struct RangeMultiMap<T, V> { /* private fields */ }

A multi-valued mapping from primitive integers to other data.

Implementations

impl<T: Debug + PrimInt, V: Clone + Debug + PartialEq> RangeMultiMap<T, V>

pub fn new() -> RangeMultiMap<T, V>

Creates a new empty map.

pub fn num_ranges(&self) -> usize

Returns the number of mapped ranges.

pub fn is_empty(&self) -> bool

Checks if the map is empty.

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

Adds a new mapping from a range of characters to value.

pub fn from_vec(vec: Vec<(Range<T>, V)>) -> RangeMultiMap<T, V>

Creates a map from a vector of pairs.

pub fn intersection(&self, other: &RangeSet<T>) -> RangeMultiMap<T, V>

Returns a new RangeMultiMap containing only the mappings for keys that belong to the given set.

pub fn map_values<F>(&mut self, f: F)where
    F: FnMut(&V) -> V,

pub fn retain_values<F>(&mut self, f: F)where
    F: FnMut(&V) -> bool,

Modifies this map in place to only contain mappings whose values v satisfy f(v).

pub fn into_vec(self) -> Vec<(Range<T>, V)>

Returns the underlying Vec.

pub fn ranges_values<'a>(&'a self) -> Iter<'a, (Range<T>, V)>

Iterates over all the mapped ranges and values.

impl<T: Debug + PrimInt, V: Clone + Debug + Ord> RangeMultiMap<T, V>

pub fn group(&self) -> RangeMap<T, Vec<V>>

Makes the ranges sorted and non-overlapping. The data associated with each range will be a Vec<T> instead of a single T.

Trait Implementations

impl<T: Clone, V: Clone> Clone for RangeMultiMap<T, V>

fn clone(&self) -> RangeMultiMap<T, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + PrimInt, V: Clone + Debug + PartialEq> Debug for RangeMultiMap<T, V>

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

Formats the value using the given formatter.

impl<T: Debug + PrimInt, V: Clone + Debug + PartialEq> FromIterator<(Range<T>, V)> for RangeMultiMap<T, V>

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

Builds a RangeMultiMap from an iterator over Range and values..

impl<T: Hash, V: Hash> Hash for RangeMultiMap<T, 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,
    Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: PartialEq, V: PartialEq> PartialEq<RangeMultiMap<T, V>> for RangeMultiMap<T, V>

fn eq(&self, other: &RangeMultiMap<T, V>) -> bool

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq, V: Eq> Eq for RangeMultiMap<T, V>

impl<T, V> StructuralEq for RangeMultiMap<T, V>

impl<T, V> StructuralPartialEq for RangeMultiMap<T, V>