1
// https://conjure-cp.github.io/conjure-oxide/docs/conjure_core/representation/trait.Representation.html
2
use conjure_cp::ast::GroundDomain;
3
use conjure_cp::bug;
4
use conjure_cp::{
5
    ast::{Atom, DeclarationPtr, Domain, Expression, Literal, Metadata, Name, SymbolTable},
6
    register_representation,
7
    representation::Representation,
8
    rule_engine::ApplicationError,
9
};
10

            
11
register_representation!(SatDirectInt, "sat_direct_int");
12

            
13
#[derive(Clone, Debug)]
14
pub struct SatDirectInt {
15
    src_var: Name,
16
    upper_bound: i32,
17
    lower_bound: i32,
18
}
19

            
20
impl SatDirectInt {
21
    /// Returns the names of the boolean variables used in the direct encoding.
22
687
    fn names(&self) -> impl Iterator<Item = Name> + '_ {
23
6249
        (self.lower_bound..=self.upper_bound).map(|index| self.index_to_name(index))
24
687
    }
25

            
26
    /// Gets the representation variable name corresponding to a concrete integer value.
27
771093
    fn index_to_name(&self, index: i32) -> Name {
28
771093
        Name::Represented(Box::new((
29
771093
            self.src_var.clone(),
30
771093
            self.repr_name().into(),
31
771093
            format!("{index}").into(), // stored as _00, _01, ...
32
771093
        )))
33
771093
    }
34
}
35

            
36
impl Representation for SatDirectInt {
37
    /// Creates a direct int representation object for the given name.
38
261
    fn init(name: &Name, symtab: &SymbolTable) -> Option<Self> {
39
261
        let domain = symtab.resolve_domain(name)?;
40

            
41
261
        if !domain.is_finite() {
42
            return None;
43
261
        }
44

            
45
261
        let GroundDomain::Int(ranges) = domain.as_ref() else {
46
            return None;
47
        };
48

            
49
        // Determine min/max and return None if range is unbounded
50
261
        let (min, max) =
51
261
            ranges
52
261
                .iter()
53
291
                .try_fold((i32::MAX, i32::MIN), |(min_a, max_b), range| {
54
291
                    let lb = range.low()?;
55
291
                    let ub = range.high()?;
56
291
                    Some((min_a.min(*lb), max_b.max(*ub)))
57
291
                })?;
58

            
59
261
        Some(SatDirectInt {
60
261
            src_var: name.clone(),
61
261
            lower_bound: min,
62
261
            upper_bound: max,
63
261
        })
64
261
    }
65

            
66
    /// The variable being represented.
67
    fn variable_name(&self) -> &Name {
68
        &self.src_var
69
    }
70

            
71
    fn value_down(
72
        &self,
73
        _value: Literal,
74
    ) -> Result<std::collections::BTreeMap<Name, Literal>, ApplicationError> {
75
        // NOTE: It's unclear where and when `value_down` would be called for
76
        // direct encoding. This is also never called in log encoding, so we
77
        // deliberately fail here to surface unexpected usage.
78
        bug!("value_down is not implemented for direct encoding and should not be called")
79
    }
80

            
81
    /// Given the values for its boolean representation variables, creates an assignment for `self` - the integer form.
82
25875
    fn value_up(
83
25875
        &self,
84
25875
        values: &std::collections::BTreeMap<Name, Literal>,
85
25875
    ) -> Result<Literal, ApplicationError> {
86
25875
        let mut found_value: Option<i32> = None;
87

            
88
764844
        for value_candidate in self.lower_bound..=self.upper_bound {
89
764844
            let name = self.index_to_name(value_candidate);
90
764844
            let value_literal = values
91
764844
                .get(&name)
92
764844
                .ok_or(ApplicationError::RuleNotApplicable)?;
93

            
94
764844
            let is_true = match value_literal {
95
25875
                Literal::Int(1) | Literal::Bool(true) => true,
96
738969
                Literal::Int(0) | Literal::Bool(false) => false,
97
                _ => return Err(ApplicationError::RuleNotApplicable),
98
            };
99

            
100
764844
            if is_true {
101
25875
                if found_value.is_some() {
102
                    // More than one variable is true, which is an error for direct encoding
103
                    return Err(ApplicationError::RuleNotApplicable);
104
25875
                }
105
25875
                found_value = Some(value_candidate);
106
738969
            }
107
        }
108

            
109
25875
        found_value
110
25875
            .map(Literal::Int)
111
25875
            .ok_or(ApplicationError::RuleNotApplicable)
112
25875
    }
113

            
114
    /// Returns [`Expression`]s representing each boolean representation variable.
115
426
    fn expression_down(
116
426
        &self,
117
426
        st: &SymbolTable,
118
426
    ) -> Result<std::collections::BTreeMap<Name, Expression>, ApplicationError> {
119
426
        Ok(self
120
426
            .names()
121
426
            .enumerate()
122
3468
            .map(|(index, name)| {
123
3468
                let decl = st.lookup(&name).unwrap();
124
3468
                (
125
                    // Machine names are used so that the derived ordering matches the correct ordering of the representation variables
126
3468
                    Name::Machine(index as i32),
127
3468
                    Expression::Atomic(
128
3468
                        Metadata::new(),
129
3468
                        Atom::Reference(conjure_cp::ast::Reference { ptr: decl }),
130
3468
                    ),
131
3468
                )
132
3468
            })
133
426
            .collect())
134
426
    }
135

            
136
    /// Creates declarations for the boolean representation variables of `self`.
137
261
    fn declaration_down(&self) -> Result<Vec<DeclarationPtr>, ApplicationError> {
138
261
        let temp_a = self
139
261
            .names()
140
2781
            .map(|name| DeclarationPtr::new_find(name, Domain::bool()))
141
261
            .collect();
142

            
143
261
        Ok(temp_a)
144
261
    }
145

            
146
    /// The rule name for this representation.
147
771945
    fn repr_name(&self) -> &str {
148
771945
        "sat_direct_int"
149
771945
    }
150

            
151
    /// Makes a clone of `self` into a `Representation` trait object.
152
31467
    fn box_clone(&self) -> Box<dyn Representation> {
153
31467
        Box::new(self.clone()) as _
154
31467
    }
155
}