solverforge-scoring 0.15.0

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
130
131
132
133
134
135
136

use std::hash::Hash;

use crate::constraint::grouped::GroupedStateView;
use crate::stream::collector::Accumulator;

use super::indexes::key_hash;
use super::state::{CrossGroupedEvaluationState, CrossGroupedNodeState};

impl<GK, V, R, Acc> GroupedStateView<GK, R> for CrossGroupedEvaluationState<GK, V, R, Acc>
where
    GK: Eq + Hash,
    Acc: Accumulator<V, R>,
{
    fn for_each_group_result<Visit>(&self, mut visit: Visit)
    where
        Visit: FnMut(&GK, &R),
    {
        for (key, accumulator) in &self.groups {
            accumulator.with_result(|result| visit(key, result));
        }
    }

    fn for_each_group_slot_result<Visit>(&self, mut visit: Visit)
    where
        Visit: FnMut(usize, Option<(&GK, &R)>),
    {
        for (group_id, (key, accumulator)) in self.groups.iter().enumerate() {
            accumulator.with_result(|result| visit(group_id, Some((key, result))));
        }
    }

    fn for_each_changed_group_slot_result<Visit>(&self, visit: Visit)
    where
        Visit: FnMut(usize, Option<(&GK, &R)>),
    {
        self.for_each_group_slot_result(visit);
    }

    fn with_group_result<T, Present, Missing>(
        &self,
        key: &GK,
        present: Present,
        missing: Missing,
    ) -> T
    where
        Present: FnOnce(&R) -> T,
        Missing: FnOnce() -> T,
    {
        match self.groups.get(key) {
            Some(accumulator) => accumulator.with_result(present),
            None => missing(),
        }
    }

    fn group_count(&self) -> usize {
        self.groups.len()
    }
}

impl<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc> GroupedStateView<GK, R>
    for CrossGroupedNodeState<S, A, B, JK, GK, EA, EB, KA, KB, F, GF, C, V, R, Acc>
where
    GK: Eq + Hash,
    Acc: Accumulator<V, R>,
{
    fn for_each_group_result<Visit>(&self, mut visit: Visit)
    where
        Visit: FnMut(&GK, &R),
    {
        for group in &self.groups {
            if group.count > 0 {
                group
                    .accumulator
                    .with_result(|result| visit(&group.key, result));
            }
        }
    }

    fn for_each_group_slot_result<Visit>(&self, mut visit: Visit)
    where
        Visit: FnMut(usize, Option<(&GK, &R)>),
    {
        for (group_id, group) in self.groups.iter().enumerate() {
            if group.count == 0 {
                visit(group_id, None);
                continue;
            }
            group
                .accumulator
                .with_result(|result| visit(group_id, Some((&group.key, result))));
        }
    }

    fn for_each_changed_group_slot_result<Visit>(&self, mut visit: Visit)
    where
        Visit: FnMut(usize, Option<(&GK, &R)>),
    {
        for &group_id in &self.changed_groups {
            let Some(group) = self.groups.get(group_id) else {
                continue;
            };
            if group.count == 0 {
                visit(group_id, None);
                continue;
            }
            group
                .accumulator
                .with_result(|result| visit(group_id, Some((&group.key, result))));
        }
    }

    fn with_group_result<T, Present, Missing>(
        &self,
        key: &GK,
        present: Present,
        missing: Missing,
    ) -> T
    where
        Present: FnOnce(&R) -> T,
        Missing: FnOnce() -> T,
    {
        let hash = key_hash(key);
        let Some(group_id) = self.find_group(hash, key) else {
            return missing();
        };
        let group = &self.groups[group_id];
        if group.count == 0 {
            return missing();
        }
        group.accumulator.with_result(present)
    }

    fn group_count(&self) -> usize {
        self.groups.iter().filter(|group| group.count > 0).count()
    }
}