Struct RangeSet

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

A set to control intervals.

Implementations

impl<T> RangeSet<T>

pub fn new() -> Self

where T: Ord,

Makes a new, empty RangeSet.

Examples found in repository

crates/competitive/src/data_structure/range_map.rs (line 383)

    fn from_iter<T: IntoIterator<Item = (K, K)>>(iter: T) -> Self {
        let mut map = Self::new();
        map.extend(iter);
        map
    }

pub fn clear(&mut self)

where T: Ord,

Clears the set, removing all elements.

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

where T: Clone + Ord,

Returns true if the set contains a key.

pub fn get_range(&self, key: &T) -> Option<&(T, T)>

where T: Clone + Ord,

Returns the range corresponding to the key.

Examples found in repository

crates/competitive/src/data_structure/range_map.rs (line 293)

    pub fn contains(&self, key: &T) -> bool
    where
        T: Clone + Ord,
    {
        self.get_range(key).is_some()
    }

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

where T: Clone + Ord,

Inserts into the specified range.

Examples found in repository

crates/competitive/src/data_structure/range_map.rs (line 374)

    fn extend<T: IntoIterator<Item = (K, K)>>(&mut self, iter: T) {
        for range in iter {
            self.insert(range);
        }
    }

pub fn insert_with<F>(&mut self, range: (T, T), f: F)

where T: Clone + Ord, F: FnMut((T, T)),

Insert and operate old range.

Examples found in repository

crates/competitive/src/data_structure/range_map.rs (line 307)

    pub fn insert(&mut self, range: (T, T))
    where
        T: Clone + Ord,
    {
        self.insert_with(range, |_| {});
    }

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

where T: Clone + Ord,

Remove items contained in the range.

pub fn get_left_if<F>(&self, key: &T, pred: F) -> Option<&(T, T)>

where T: Clone + Ord, F: FnMut(&(T, T)) -> bool,

Get a left neighboring range of [key, key) if the predicate is satisfied.

pub fn get_right_if<F>(&self, key: &T, pred: F) -> Option<&(T, T)>

where T: Clone + Ord, F: FnMut(&(T, T)) -> bool,

Get a right neighboring range of [key, key) if the predicate is satisfied.

pub fn pop_left_if<F>(&mut self, key: &T, pred: F) -> Option<(T, T)>

where T: Clone + Ord, F: FnMut(&(T, T)) -> bool,

Pop a left neighboring range of [key, key) if the predicate is satisfied.

pub fn pop_right_if<F>(&mut self, key: &T, pred: F) -> Option<(T, T)>

where T: Clone + Ord, F: FnMut(&(T, T)) -> bool,

Pop a right neighboring range of [key, key) if the predicate is satisfied.

pub fn drain_with<F>(&mut self, range: (T, T), f: F)

where T: Clone + Ord, F: FnMut((T, T)),

Operate and consume in range.

Examples found in repository

crates/competitive/src/data_structure/range_map.rs (line 322)

    pub fn remove(&mut self, range: (T, T))
    where
        T: Clone + Ord,
    {
        self.drain_with(range, |_| {});
    }

pub fn iter(&self) -> Keys<'_, (T, T), ()>

Trait Implementations

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for RangeSet<T>

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

Formats the value using the given formatter.

impl<T> Default for RangeSet<T>

where T: Ord,

fn default() -> Self

Returns the “default value” for a type.

impl<K> Extend<(K, K)> for RangeSet<K>

where K: Clone + Ord,

fn extend<T: IntoIterator<Item = (K, K)>>(&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> FromIterator<(K, K)> for RangeSet<K>

where K: Clone + Ord,

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

Creates a value from an iterator.