Enum IntConstraint 

pub enum IntConstraint {
    Always,
    Never,
    Min {
        n: i64,
    },
    Max {
        n: i64,
    },
    Range {
        min: i64,
        max: i64,
    },
    InSet {
        values: BTreeSet<i64>,
    },
    NotInSet {
        values: BTreeSet<i64>,
    },
    Multiple {
        n: i64,
    },
    And {
        children: Vec<Self>,
    },
    Or {
        children: Vec<Self>,
    },
    Not {
        child: Box<Self>,
    },
}

Integer-value constraint.

Variants track SRD-0004 §Constraint algebra. Multiple(0) is a legal representation but always tests false; the constructor Self::multiple rejects zero so callers that go through the helper never produce it.

Variants

Always

Always satisfied.

Never

Never satisfied.

Min

value >= n.

Fields

n: i64

The inclusive lower bound.

Max

value <= n.

Fields

n: i64

The inclusive upper bound.

Range

min <= value <= max.

Fields

min: i64

Inclusive lower bound.

max: i64

Inclusive upper bound.

InSet

value is one of these.

Fields

values: BTreeSet<i64>

The permitted values.

NotInSet

value is none of these.

Fields

values: BTreeSet<i64>

The forbidden values.

Multiple

value % n == 0. Always false for n == 0.

Fields

n: i64

The divisor.

And

All children must hold.

Fields

children: Vec<Self>

Conjuncts.

Or

At least one child must hold.

Fields

children: Vec<Self>

Disjuncts.

Not

Child must not hold.

Fields

child: Box<Self>

The negated child.

Implementations

impl IntConstraint

pub const fn multiple(n: i64) -> Option<Self>

Construct a Multiple leaf. Rejects n == 0.

pub fn test(&self, value: i64) -> bool

Test a candidate value.

pub fn and(self, rhs: Self) -> Self

Conjunction, flattening nested And.

pub fn or(self, rhs: Self) -> Self

Disjunction, flattening nested Or.

pub fn canonicalize(self) -> Self

Collapse identities, peel double negation, flatten same-kind combinators, sort And/Or children by canonical bytes, and dedup.

pub fn canonical_bytes(&self) -> Vec<u8>

Canonical byte form of this constraint as written.

Two constraints with the same canonical bytes are structurally identical. Self::fingerprint canonicalises first and is what you want for semantic identity.

pub fn fingerprint(&self) -> Fingerprint

Canonical fingerprint — semantically identical constraints hash to the same value. Auto-canonicalises the tree before hashing.

Trait Implementations

impl Clone for IntConstraint

fn clone(&self) -> IntConstraint

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IntConstraint

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for IntConstraint

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for IntConstraint

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Not for IntConstraint

type Output = IntConstraint

The resulting type after applying the ! operator.

fn not(self) -> Self

Performs the unary ! operation.

impl PartialEq for IntConstraint

fn eq(&self, other: &IntConstraint) -> 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 Serialize for IntConstraint

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for IntConstraint

impl StructuralPartialEq for IntConstraint