Struct IntervalDomain 

pub struct IntervalDomain {
    pub lower: Bound,
    pub upper: Bound,
    pub is_bottom: bool,
}

The interval domain: an abstract value [lower, upper]. Represents the set of integers n with lower ≤ n ≤ upper.

Fields

lower: Bound

Lower bound (inclusive), or NegInf

upper: Bound

Upper bound (inclusive), or PosInf

is_bottom: bool

Whether this is the bottom element (empty set)

Implementations

impl IntervalDomain

pub fn bottom() -> Self

Bottom element (empty set, unreachable).

pub fn top() -> Self

Top element (all integers).

pub fn constant(n: i64) -> Self

A constant interval [n, n].

pub fn new(lower: Bound, upper: Bound) -> Self

An interval [l, u].

pub fn join(&self, other: &Self) -> Self

Join (least upper bound): smallest interval containing both.

pub fn meet(&self, other: &Self) -> Self

Meet (greatest lower bound): intersection of two intervals.

pub fn widen(&self, other: &Self) -> Self

Widening: accelerate convergence by jumping to ±∞.

pub fn narrow(&self, other: &Self) -> Self

Narrowing: refine using constraints from other.

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

Abstract addition: [a,b] + [c,d] = [a+c, b+d].

pub fn contains(&self, n: i64) -> bool

Check if a concrete integer is in the interval.

Trait Implementations

impl Clone for IntervalDomain

fn clone(&self) -> IntervalDomain

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IntervalDomain

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

Formats the value using the given formatter.

impl PartialEq for IntervalDomain

fn eq(&self, other: &IntervalDomain) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for IntervalDomain

impl StructuralPartialEq for IntervalDomain