Struct rangemap::RangeSet

pub struct RangeSet<T> { /* fields omitted */ }

A set whose items are stored as ranges.

See RangeMap's documentation for more details.

Implementations

impl<T> RangeSet<T> where
    T: Ord + Clone, 

pub fn new() -> Self

Makes a new empty RangeSet.

pub fn get(&self, value: &T) -> Option<&Range<T>>

Returns a reference to the range covering the given key, if any.

pub fn contains(&self, value: &T) -> bool

Returns true if any range in the set covers the specified value.

pub fn iter(&self) -> impl Iterator<Item = &Range<T>>

Gets an ordered iterator over all ranges, ordered by range.

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

Insert a range into the set.

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

Panics

Panics if range start >= end.

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

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

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

Panics

Panics if range start >= end.

Trait Implementations

impl<T: Clone> Clone for RangeSet<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Default for RangeSet<T> where
    T: Ord + Clone, 

fn default() -> Self

Returns the "default value" for a type.