-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprime_test.go
70 lines (64 loc) · 1.36 KB
/
prime_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
69
70
// TODO: replace with your own tests (TDD). An example to get you started is included below.
// Ginkgo BDD Testing Framework <http://onsi.github.io/ginkgo/>
// Gomega Matcher Library <http://onsi.github.io/gomega/>
package go_kata
import (
"testing"
)
func runIsPrimeTests(t *testing.T, testFunc func(int) bool) {
tests := []struct {
input int
expected bool
}{
{0, false},
{1, false},
{2, true},
{3, true},
{4, false},
{5, true},
{7, true},
{8, false},
{71, true},
{941, true},
{1000, false},
{7919, true},
}
for _, test := range tests {
result := testFunc(test.input)
if result != test.expected {
t.Errorf("IsPrime(%d) = %t; want %t", test.input, result, test.expected)
}
}
}
func TestIsPrime(t *testing.T) {
runIsPrimeTests(t, IsPrime)
}
func TestIsPrimeUsingMathLib(t *testing.T) {
runIsPrimeTests(t, IsPrimeWithMathLib)
}
func TestGetPrimeThatIsGreaterThan(t *testing.T) {
tests := []struct {
input int
expected int
}{
{0, 2},
{1, 2},
{2, 3},
{3, 5},
{4, 5},
{5, 7},
{7, 11},
{8, 11},
{71, 73},
{941, 947},
{1000, 1009},
{7919, 7927},
{1000000000000000000, 1000000000000000003},
}
for _, test := range tests {
result := GetPrimeThatIsGreaterThan(test.input)
if result != test.expected {
t.Errorf("GetPrimeThatIsGreaterThan(%d) = %d; want %d", test.input, result, test.expected)
}
}
}