-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolver007_test.go
65 lines (58 loc) · 1.1 KB
/
solver007_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
package goeulerproject
import (
"errors"
"testing"
)
type testCase9 struct {
in int
want int
err error
}
func TestFindPrimeNumber(t *testing.T) {
cases := []testCase9{
// test problem
{
in: 10001,
want: 104743,
err: nil,
},
// test example
{
in: 6,
want: 13,
err: nil,
},
// test invalid input
{
in: -5,
want: 0,
err: errors.New("invalid input: -5 is less than 1"),
},
{
in: 1,
want: 2,
err: nil,
},
}
// iterate over test cases
for _, c := range cases {
got, err := FindPrimeNumber(c.in)
// test similarity of expected and received value
if got != c.want {
t.Errorf("FindPrimeNumber(%d) == %d, want %d\n",
c.in, got, c.want)
}
// if no error is returned, test if none is expected
if err == nil && c.err != nil {
t.Errorf("FindPrimeNumber(%d) returned error %v, want %v\n",
c.in, err, c.err)
}
// if error is returned, test if an error is expected
if err != nil {
if err.Error() != c.err.Error() {
t.Errorf("FindPrimeNumber(%d) returned error %v, want %v\n",
c.in, err, c.err)
}
}
}
}