canrun 0.5.0

A logic programming library inspired by the *Kanren family of language DSLs.
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

use crate::cmp::{lt, lte};
use crate::goals::Goal;
use crate::{both, either, unify, Unify, Value};

/** Get the lesser of two values according to [`std::cmp::min`].

# Example:
```
use canrun::{unify, LVar, all, Query};
use canrun::cmp::min;

let (x, y, z) = (LVar::new(), LVar::new(), LVar::new());
let goal = all![
    unify(x, 1),
    unify(y, 2),
    unify(z, 1),
    min(x, y, z),
];
let results: Vec<_> = goal.query((x, y, z)).collect();
assert_eq!(results, vec![(1, 2, 1)]);
```
*/
pub fn min<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()), lte(a.clone(), b.clone())),
        // Using lte above and just lt below avoids multiple states when they are equal
        // I'm not 100% sure this will be generally correct
        both(unify(b.clone(), c), lt(b, a)),
    )
}

#[cfg(test)]
mod tests {
    use super::min;
    use crate::{goal_vec, unify, LVar};

    #[test]
    fn succeeds_lt() {
        let (x, y, z) = (LVar::new(), LVar::new(), LVar::new());
        let goals = goal_vec![unify(x, 1), unify(y, 2), unify(z, 1), min(x, y, z)];
        goals.assert_permutations_resolve_to(&(x, y, z), vec![(1, 2, 1)]);
    }
    #[test]
    fn succeeds_lte() {
        let (x, y, z) = (LVar::new(), LVar::new(), LVar::new());
        let goals = goal_vec![unify(x, 1), unify(y, 1), unify(z, 1), min(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, 2), min(x, y, z)];
        goals.assert_permutations_resolve_to(&(x, y), vec![]);
    }
}