Struct RangeSet 

pub struct RangeSet<const K: usize = 2> { /* private fields */ }

A bounded union of at most K disjoint, inclusive unsigned intervals.

Operations first compute their exact interval pieces and, when there are too many, fill the smallest gaps until the result fits. Thus K is a compile-time precision/storage knob.

References:

• GCC’s bounded multi-range (irange) design: https://gcc.gnu.org/pipermail/gcc/2020-September/233620.html
• Bagnara, Hill, and Zaffanella, “Widening Operators for Powerset Domains”: https://www.cs.unipr.it/~zaffanella/Papers/Abstracts/Q349

Implementations

impl<const K: usize> RangeSet<K>

pub const fn empty() -> Self

pub fn full() -> Self

pub fn from_value(value: u64) -> Self

pub fn from_range(low: u64, high: u64) -> Self

pub fn ranges(&self) -> &[(u64, u64)]

pub fn is_empty(&self) -> bool

pub fn contains_value(&self, value: u64) -> bool

pub fn union(self, other: Self) -> Self

pub fn intersection(self, other: Self) -> Self

pub fn cardinality(&self) -> u128

The number of represented values. 2^64 is representable in u128.

Trait Implementations

impl<const K: usize> Add for RangeSet<K>

type Output = RangeSet<K>

The resulting type after applying the + operator.

fn add(self, other: Self) -> Self

Performs the + operation.

impl<const K: usize> Clone for RangeSet<K>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const K: usize> Copy for RangeSet<K>

impl<const K: usize> Debug for RangeSet<K>

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

Formats the value using the given formatter.

impl<const K: usize> Default for RangeSet<K>

fn default() -> Self

Returns the “default value” for a type.

impl<const K: usize> Eq for RangeSet<K>

impl<const K: usize> PartialEq for RangeSet<K>

fn eq(&self, other: &RangeSet<K>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<const K: usize> StructuralPartialEq for RangeSet<K>