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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170

//! Unit tests for between constraint
//! This file improves coverage for src/constraints/props/between.rs (48.91% -> higher)

use selen::prelude::*;

#[test]
fn test_between_basic_constraint() {
    let mut m = Model::default();
    let lower = m.int(1, 5);
    let middle = m.int(1, 10);
    let upper = m.int(5, 15);
    
    // Add between constraint: lower <= middle <= upper
    m.props.between_constraint(lower, middle, upper);
    
    let solution = m.solve().expect("Should find solution");
    let l = solution[lower].as_int().unwrap();
    let mid = solution[middle].as_int().unwrap();
    let u = solution[upper].as_int().unwrap();
    
    assert!(l <= mid);
    assert!(mid <= u);
}

#[test]
fn test_between_propagation_lower_bound() {
    let mut m = Model::default();
    let lower = m.int(10, 15);  // Lower bound is 10
    let middle = m.int(1, 20);
    let upper = m.int(15, 25);
    
    m.props.between_constraint(lower, middle, upper);
    
    let solution = m.solve().expect("Should find solution");
    let l = solution[lower].as_int().unwrap();
    let mid = solution[middle].as_int().unwrap();
    let u = solution[upper].as_int().unwrap();
    
    // Middle should be >= 10 (from lower bound)
    assert!(mid >= 10);
    assert!(l <= mid);
    assert!(mid <= u);
}

#[test]
fn test_between_propagation_upper_bound() {
    let mut m = Model::default();
    let lower = m.int(1, 10);
    let middle = m.int(1, 20);
    let upper = m.int(5, 10);  // Upper bound is 10
    
    m.props.between_constraint(lower, middle, upper);
    
    let solution = m.solve().expect("Should find solution");
    let l = solution[lower].as_int().unwrap();
    let mid = solution[middle].as_int().unwrap();
    let u = solution[upper].as_int().unwrap();
    
    // Middle should be <= 10 (from upper bound)
    assert!(mid <= 10);
    assert!(l <= mid);
    assert!(mid <= u);
}

#[test]
fn test_between_middle_bound_propagation() {
    let mut m = Model::default();
    let lower = m.int(1, 20);
    let middle = m.int(10, 15);  // Middle is constrained
    let upper = m.int(1, 25);
    
    m.props.between_constraint(lower, middle, upper);
    
    let solution = m.solve().expect("Should find solution");
    let l = solution[lower].as_int().unwrap();
    let mid = solution[middle].as_int().unwrap();
    let u = solution[upper].as_int().unwrap();
    
    // Lower should be <= 15 (from middle max)
    assert!(l <= 15);
    // Upper should be >= 10 (from middle min)
    assert!(u >= 10);
    assert!(l <= mid);
    assert!(mid <= u);
}

#[test]
fn test_between_all_same_value() {
    let mut m = Model::default();
    let lower = m.int(5, 5);   // All fixed to 5
    let middle = m.int(5, 5);
    let upper = m.int(5, 5);
    
    m.props.between_constraint(lower, middle, upper);
    
    let solution = m.solve().expect("Should find solution");
    assert_eq!(solution[lower].as_int().unwrap(), 5);
    assert_eq!(solution[middle].as_int().unwrap(), 5);
    assert_eq!(solution[upper].as_int().unwrap(), 5);
}

#[test]
fn test_between_tight_constraints() {
    let mut m = Model::default();
    let lower = m.int(5, 7);
    let middle = m.int(6, 6);  // Middle fixed to 6
    let upper = m.int(6, 10);
    
    m.props.between_constraint(lower, middle, upper);
    
    let solution = m.solve().expect("Should find solution");
    let l = solution[lower].as_int().unwrap();
    let mid = solution[middle].as_int().unwrap();
    let u = solution[upper].as_int().unwrap();
    
    assert_eq!(mid, 6);
    assert!(l <= 6);
    assert!(u >= 6);
}

#[test]
fn test_between_infeasible_lower_greater_than_upper() {
    let mut m = Model::default();
    let lower = m.int(10, 15);
    let middle = m.int(1, 20);
    let upper = m.int(1, 5);  // Upper max < lower min
    
    m.props.between_constraint(lower, middle, upper);
    
    // Should have no solution since lower > upper is impossible
    let result = m.solve();
    assert!(result.is_err());
}

#[test]
fn test_between_with_negative_values() {
    let mut m = Model::default();
    let lower = m.int(-10, -5);
    let middle = m.int(-15, 0);
    let upper = m.int(-3, 5);
    
    m.props.between_constraint(lower, middle, upper);
    
    let solution = m.solve().expect("Should find solution");
    let l = solution[lower].as_int().unwrap();
    let mid = solution[middle].as_int().unwrap();
    let u = solution[upper].as_int().unwrap();
    
    assert!(l <= mid);
    assert!(mid <= u);
}

#[test]
fn test_between_boundary_values() {
    let mut m = Model::default();
    let lower = m.int(1, 3);
    let middle = m.int(3, 5);
    let upper = m.int(5, 7);
    
    // Overlapping at boundaries
    m.props.between_constraint(lower, middle, upper);
    
    let solution = m.solve().expect("Should find solution");
    let l = solution[lower].as_int().unwrap();
    let mid = solution[middle].as_int().unwrap();
    let u = solution[upper].as_int().unwrap();
    
    assert!(l <= mid);
    assert!(mid <= u);
}