-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathuint64_gcd_test.go
66 lines (53 loc) · 1.27 KB
/
uint64_gcd_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
package decimal
import "testing"
// Arrange
var cases = []struct {
expected, a, b uint64
}{
{1, 4, 3},
{10, 40, 30},
}
var invalidCases = []struct {
expected, a, b uint64
}{
{2, 4, 3},
{5, 40, 30},
}
func actAndAssert(t *testing.T, fp func(uint64, uint64) uint64) {
for _, c := range cases {
// Act
actual := fp(c.a, c.b)
// Assert
if actual != c.expected {
t.Errorf("gcd(%d, %d) == %d, expected %d", c.a, c.b, actual, c.expected)
}
}
}
func actAndAssertWithInvalidData(t *testing.T, fp func(uint64, uint64) uint64) {
for _, c := range invalidCases {
// Act
actual := fp(c.a, c.b)
// Assert
if actual == c.expected {
t.Errorf("gcd(%d, %d) == %d, expected %d", c.a, c.b, actual, c.expected)
}
}
}
func Test_gcdEuclidean(t *testing.T) {
actAndAssert(t, gcdEuclidean)
}
func Test_gcdRemainderRecursive(t *testing.T) {
actAndAssert(t, gcdRemainderRecursive)
}
func Test_gcdRemainder(t *testing.T) {
actAndAssert(t, gcdRemainder)
}
func Test_gcdEuclideanWithInvalidData(t *testing.T) {
actAndAssertWithInvalidData(t, gcdEuclidean)
}
func Test_gcdRemainderRecursiveWithInvalidData(t *testing.T) {
actAndAssertWithInvalidData(t, gcdRemainderRecursive)
}
func Test_gcdRemainderWithInvalidData(t *testing.T) {
actAndAssertWithInvalidData(t, gcdRemainder)
}