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

use crate::{
    goals::{assert_2, Goal},
    Unify, Value,
};

/** Ensure that one value is less than another.

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

let (x, y) = (LVar::new(), LVar::new());
let goal = all![
    unify(x, 1),
    unify(y, 2),
    lt(x, y)
];
let results: Vec<_> = goal.query((x, y)).collect();
assert_eq!(results, vec![(1, 2)]);
```
*/
pub fn lt<A, AV, B, BV>(a: AV, b: BV) -> impl Goal
where
    A: Unify + PartialOrd<B>,
    B: Unify,
    AV: Into<Value<A>>,
    BV: Into<Value<B>>,
{
    assert_2(a, b, |a, b| a < b)
}

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

    #[test]
    fn succeeds() {
        let (x, y) = (LVar::new(), LVar::new());
        let goals = goal_vec![unify(x, 1), unify(y, 2), lt(x, y)];
        goals.assert_permutations_resolve_to(&(x, y), vec![(1, 2)]);
    }

    #[test]
    fn fails() {
        let (x, y) = (LVar::new(), LVar::new());
        let goals = goal_vec![unify(x, 2), unify(y, 1), lt(x, y)];
        goals.assert_permutations_resolve_to(&(x, y), vec![]);
    }
}