Struct ValueRange 

pub struct ValueRange { /* private fields */ }

Restricts a variable’s raw value to a byte-lexicographic range.

This constraint only confirms — it never proposes candidates. Use it with and! alongside a constraint that does propose (e.g. a pattern!):

find!((id: Id, ts: Value<NsTAIInterval>),
    and!(
        pattern!(data, [{ ?id @ exec::requested_at: ?ts }]),
        value_range(ts, min_ts, max_ts),
    )
)

The estimate returns usize::MAX so the intersection sorts this constraint last — the tighter TribleSet constraint proposes first, then this range constraint filters.

Implementations

impl ValueRange

pub fn new<T: ValueSchema>( variable: Variable<T>, min: Value<T>, max: Value<T>, ) -> Self

Create a range constraint on variable with inclusive bounds.

Trait Implementations

impl<'a> Constraint<'a> for ValueRange

fn estimate(&self, variable: VariableId, _binding: &Binding) -> Option<usize>

Returns usize::MAX so the intersection never chooses this constraint as the proposer — it only confirms.

fn propose( &self, _variable: VariableId, _binding: &Binding, _proposals: &mut Vec<RawValue>, )

Does not propose — the paired TribleSet constraint handles proposals.

fn confirm( &self, variable: VariableId, _binding: &Binding, proposals: &mut Vec<RawValue>, )

Retains only proposals whose raw bytes fall within [min, max] inclusive.

fn satisfied(&self, binding: &Binding) -> bool

Returns false when the variable is bound to a value outside the range.

fn variables(&self) -> VariableSet

Returns the set of variables this constraint touches.

fn influence(&self, variable: VariableId) -> VariableSet

Returns the set of variables whose estimates may change when variable is bound or unbound.