forked from gnboorse/centipede
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathintegerconstraints_test.go
68 lines (56 loc) · 2.09 KB
/
integerconstraints_test.go
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
// Copyright 2022 Gabriel Boorse
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package centipede
import (
"context"
"testing"
"github.com/stretchr/testify/assert"
)
func TestIntegerConstraints(t *testing.T) {
// some integer variables
vars := Variables[int]{
NewVariable("A", IntRange(1, 10)),
NewVariable("B", IntRange(1, 10)),
NewVariable("C", IntRange(1, 10)),
NewVariable("D", IntRange(1, 10)),
NewVariable("E", IntRangeStep(0, 20, 2)), // even numbers < 20
}
// numeric constraints
constraints := Constraints[int]{
// using some constraint generators
Equals[int]("A", "D"), // A = D
// here we implement a custom constraint
Constraint[int]{Vars: VariableNames{"A", "E"}, // E = A * 2
ConstraintFunction: func(variables *Variables[int]) bool {
// here we have to use type assertion for numeric methods since
// Variable.Value is stored as interface{}
if variables.Find("E").Empty || variables.Find("A").Empty {
return true
}
return variables.Find("E").Value == variables.Find("A").Value*2
}},
}
constraints = append(constraints, AllUnique[int]("A", "B", "C", "E")...) // A != B != C != E
// solve the problem
solver := NewBackTrackingCSPSolver(vars, constraints)
success, err := solver.Solve(context.TODO()) // run the solution
assert.Nil(t, err)
assert.True(t, success)
values := map[string]int{}
for _, variable := range solver.State.Vars {
values[string(variable.Name)] = variable.Value
}
assert.Equal(t, values["A"], 1)
assert.Equal(t, values["B"], 3)
assert.Equal(t, values["C"], 4)
assert.Equal(t, values["D"], 1)
assert.Equal(t, values["E"], 2)
}