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
use crate::cmp::{gt, gte};
use crate::goals::Goal;
use crate::{both, either, unify, Unify, Value};
pub fn max<T, A, B, C>(a: A, b: B, c: C) -> impl Goal
where
T: Unify + PartialOrd,
A: Into<Value<T>>,
B: Into<Value<T>>,
C: Into<Value<T>>,
{
let a = a.into();
let b = b.into();
let c = c.into();
either(
both(unify(a.clone(), c.clone()), gte(a.clone(), b.clone())),
both(unify(b.clone(), c), gt(b, a)),
)
}
#[cfg(test)]
mod tests {
use super::max;
use crate::{goal_vec, unify, LVar};
#[test]
fn succeeds_gt() {
let (x, y, z) = (LVar::new(), LVar::new(), LVar::new());
let goals = goal_vec![unify(x, 1), unify(y, 2), unify(z, 2), max(x, y, z)];
goals.assert_permutations_resolve_to((x, y, z), vec![(1, 2, 2)]);
}
#[test]
fn succeeds_gte() {
let (x, y, z) = (LVar::new(), LVar::new(), LVar::new());
let goals = goal_vec![unify(x, 1), unify(y, 1), unify(z, 1), max(x, y, z)];
goals.assert_permutations_resolve_to((x, y, z), vec![(1, 1, 1)]);
}
#[test]
fn fails() {
let (x, y, z) = (LVar::new(), LVar::new(), LVar::new());
let goals = goal_vec![unify(x, 2), unify(y, 1), unify(z, 1), max(x, y, z)];
goals.assert_permutations_resolve_to((x, y), vec![]);
}
}