selen 0.15.5

Constraint Satisfaction Problem (CSP) solver
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

use crate::{constraints::props::{Propagate, Prune}, variables::VarId, variables::views::{Context, View}};

/// Add two views together: `x + y == s`.
#[derive(Clone, Copy, Debug)]
#[doc(hidden)]
pub struct Add<U, V> {
    x: U,
    y: V,
    s: VarId,
}

impl<U, V> Add<U, V> {
    pub const fn new(x: U, y: V, s: VarId) -> Self {
        Self { x, y, s }
    }
    
    /// Get the first operand (x in x + y = s)
    pub const fn x(&self) -> &U {
        &self.x
    }
    
    /// Get the second operand (y in x + y = s)
    pub const fn y(&self) -> &V {
        &self.y
    }
    
    /// Get the result variable (s in x + y = s)
    pub const fn s(&self) -> VarId {
        self.s
    }
}

impl<U: View, V: View> Prune for Add<U, V> {
    fn prune(&self, ctx: &mut Context) -> Option<()> {
        let _min = self.s.try_set_min(self.x.min(ctx) + self.y.min(ctx), ctx)?;
        let _max = self.s.try_set_max(self.x.max(ctx) + self.y.max(ctx), ctx)?;

        let _min = self.x.try_set_min(self.s.min(ctx) - self.y.max(ctx), ctx)?;
        let _max = self.x.try_set_max(self.s.max(ctx) - self.y.min(ctx), ctx)?;

        let _min = self.y.try_set_min(self.s.min(ctx) - self.x.max(ctx), ctx)?;
        let _max = self.y.try_set_max(self.s.max(ctx) - self.x.min(ctx), ctx)?;

        Some(())
    }
}

impl<U: View, V: View> Propagate for Add<U, V> {
    fn list_trigger_vars(&self) -> impl Iterator<Item = VarId> {
        core::iter::once(self.s)
            .chain(self.x.get_underlying_var())
            .chain(self.y.get_underlying_var())
    }
}