Struct RangeSet

pub struct RangeSet { /* private fields */ }

Set of ranges implemented with a BTreeMap. No overlapping ranges are allowed. Consecutive ranges are merged. Representable ranges are [0, u64::MAX).

Implementations

impl RangeSet

pub fn new(max_size: usize) -> RangeSet

pub fn unlimited() -> RangeSet

pub fn has_value(&self, val: u64) -> bool

Test if a single value is contained in the set.

pub fn has_range(&self, range: Range<u64>) -> bool

Test if a range is contained in the set

pub fn insert_range(&mut self, new_range: Range<u64>) -> bool

Insert a range into the set

pub fn materialize_bounds(range: impl RangeBounds<u64>) -> Range<u64>

Convert RangeBounds to ordinary range

pub fn remove_range( &mut self, to_remove: impl RangeBounds<u64> + Clone, ) -> usize

Remove range from set

pub fn iter(&self) -> impl Iterator<Item = Range<u64>> + '_

Iterate all ranges contained in set

pub fn iter_range( &self, range: impl RangeBounds<u64>, ) -> impl Iterator<Item = Range<u64>> + '_

Iterate all ranges in set intersecting provided range

pub fn range_complement( &self, range: Range<u64>, ) -> impl Iterator<Item = Range<u64>> + '_

Find all ranges within provided range but which do not exist in the set

pub fn peek_first(&self) -> Option<Range<u64>>

Peek first value in set

pub fn peek_last(&self) -> Option<Range<u64>>

Peek last value in set

pub fn dump_all(&self)

Dump all ranges in set