Struct IntervalMap 

pub struct IntervalMap<T: Ord + Clone, V: Clone> { /* private fields */ }

A simple interval map for ordered key types.

Stores a list of disjoint intervals, each associated with a value. Lookup is O(n) by linear scan.

Implementations

impl<T: Ord + Clone, V: Clone> IntervalMap<T, V>

pub fn new() -> Self

Create an empty interval map.

pub fn insert(&mut self, lo: T, hi: T, value: V)

Insert an interval [lo, hi] with a value.

pub fn query(&self, point: &T) -> Vec<&V>

Query a point, returning all values whose interval contains the point.

pub fn len(&self) -> usize

Number of intervals.

pub fn is_empty(&self) -> bool

Check if empty.

pub fn clear(&mut self)

Clear all intervals.

Trait Implementations

impl<T: Clone + Ord + Clone, V: Clone + Clone> Clone for IntervalMap<T, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Ord + Clone, V: Debug + Clone> Debug for IntervalMap<T, V>

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.