solverforge-scoring 0.12.1

Incremental constraint scoring for SolverForge
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

use solverforge_core::score::SoftScore;

use crate::api::constraint_set::IncrementalConstraint;
use crate::stream::collection_extract::{source, ChangeSource};
use crate::stream::joiner::equal_bi;
use crate::stream::ConstraintFactory;

#[derive(Clone)]
struct A {
    id: usize,
}

#[derive(Clone)]
struct B {
    id: usize,
}

#[derive(Clone)]
struct State {
    a: Vec<A>,
    b: Vec<B>,
}

fn as_a(state: &State) -> &[A] {
    state.a.as_slice()
}

fn as_b(state: &State) -> &[B] {
    state.b.as_slice()
}

#[test]
#[should_panic(expected = "cannot localize entity indexes")]
fn unknown_source_same_source_wrong_delta_on_wrong_descriptor_update() {
    let mut constraint = ConstraintFactory::<State, SoftScore>::new()
        .for_each(source(as_a as fn(&State) -> &[A], ChangeSource::Unknown))
        .filter(|_a: &A| true)
        .if_exists((
            ConstraintFactory::<State, SoftScore>::new()
                .for_each(source(as_b as fn(&State) -> &[B], ChangeSource::Unknown))
                .filter(|_b: &B| true),
            equal_bi(|a: &A| a.id, |b: &B| b.id),
        ))
        .penalize(SoftScore::of(1))
        .named("exists from unknown source");

    let mut state = State {
        a: vec![A { id: 2 }, A { id: 2 }],
        b: vec![B { id: 3 }, B { id: 2 }],
    };

    let initial = constraint.initialize(&state);
    assert_eq!(initial, SoftScore::of(-2));

    let mut total = initial;
    total = total + constraint.on_retract(&state, 1, 0);
    state.a[1].id = 3;

    total = total + constraint.on_insert(&state, 1, 0);

    assert_eq!(total, SoftScore::of(-1));
    assert_eq!(total, constraint.evaluate(&state));
}

#[test]
fn descriptor_exists_parent_side_update_matches_evaluate() {
    let mut constraint = ConstraintFactory::<State, SoftScore>::new()
        .for_each(source(
            as_a as fn(&State) -> &[A],
            ChangeSource::Descriptor(0),
        ))
        .if_exists((
            ConstraintFactory::<State, SoftScore>::new().for_each(source(
                as_b as fn(&State) -> &[B],
                ChangeSource::Descriptor(1),
            )),
            equal_bi(|a: &A| a.id, |b: &B| b.id),
        ))
        .penalize(SoftScore::of(1))
        .named("descriptor exists");

    let mut state = State {
        a: vec![A { id: 2 }, A { id: 2 }],
        b: vec![B { id: 3 }, B { id: 2 }],
    };

    let mut total = constraint.initialize(&state);
    assert_eq!(total, SoftScore::of(-2));

    total = total + constraint.on_retract(&state, 1, 1);
    state.b[1].id = 3;
    total = total + constraint.on_insert(&state, 1, 1);

    assert_eq!(total, SoftScore::of(0));
    assert_eq!(total, constraint.evaluate(&state));
}

#[test]
fn descriptor_not_exists_parent_side_update_matches_evaluate() {
    let mut constraint = ConstraintFactory::<State, SoftScore>::new()
        .for_each(source(
            as_a as fn(&State) -> &[A],
            ChangeSource::Descriptor(0),
        ))
        .if_not_exists((
            ConstraintFactory::<State, SoftScore>::new().for_each(source(
                as_b as fn(&State) -> &[B],
                ChangeSource::Descriptor(1),
            )),
            equal_bi(|a: &A| a.id, |b: &B| b.id),
        ))
        .penalize(SoftScore::of(1))
        .named("descriptor not exists");

    let mut state = State {
        a: vec![A { id: 2 }, A { id: 2 }],
        b: vec![B { id: 3 }, B { id: 2 }],
    };

    let mut total = constraint.initialize(&state);
    assert_eq!(total, SoftScore::of(0));

    total = total + constraint.on_retract(&state, 1, 1);
    state.b[1].id = 3;
    total = total + constraint.on_insert(&state, 1, 1);

    assert_eq!(total, SoftScore::of(-2));
    assert_eq!(total, constraint.evaluate(&state));
}