backtrack 0.3.0

Solve hard constraints easily
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

use crate::common::assert_unsat_unique;
use backtrack::problems::TotalSum;
use backtrack::solve::IterSolveExt;
use backtrack::solvers::IterSolveCached;

#[test]
fn total_sum_search_sat() {
    let sum = TotalSum::new(3, &[2, 0], 3);
    let solver = IterSolveCached::new(&sum);

    let mut sats = solver.sat_iter();

    assert_eq!(sats.next(), Some(vec![2, 2, 0]));
    assert_eq!(sats.next(), Some(vec![2, 0, 2]));
    assert_eq!(sats.next(), Some(vec![0, 2, 2]));
    assert_eq!(sats.next(), None);
}

#[test]
fn total_sum_unsat_unique() {
    let sum = TotalSum::new(3, &[2, 0], 3);
    let unsats = IterSolveCached::new(&sum).unsat_iter();
    assert_unsat_unique(unsats);
}

#[test]
fn total_sum_search_sat_cached() {
    let sum = TotalSum::new(3, &[2, 0], 3);
    let solver = IterSolveCached::new(&sum);

    let mut sats = solver.sat_iter();

    assert_eq!(sats.next(), Some(vec![2, 2, 0]));
    assert_eq!(sats.next(), Some(vec![2, 0, 2]));
    assert_eq!(sats.next(), Some(vec![0, 2, 2]));
    assert_eq!(sats.next(), None);
}

#[test]
fn total_sum_unsat_unique_cached() {
    let sum = TotalSum::new(3, &[2, 0], 3);
    let unsats = IterSolveCached::new(&sum).unsat_iter();
    assert_unsat_unique(unsats);
}