-
Notifications
You must be signed in to change notification settings - Fork 2
/
lstrev_test.go
57 lines (46 loc) · 1.14 KB
/
lstrev_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
package lstrev_test
import (
"fmt"
"math/rand"
"reflect"
"runtime"
"testing"
"time"
. "github.com/skurhse/gresto/lstrev"
)
type assert struct {
input []int
want []int
}
var funcs []func(*ListNode) *ListNode = []func(*ListNode) *ListNode{ReverseListRec, ReverseListItr}
func TestReverseLists(t *testing.T) {
var data = []assert{
{[]int{1, 2, 3}, []int{3, 2, 1}},
{[]int{1}, []int{1}},
{[]int{}, []int{}},
}
for _, dtm := range data {
for _, fnc := range funcs {
input, want := NewList(dtm.input), NewList(dtm.want)
fname := runtime.FuncForPC(reflect.ValueOf(fnc).Pointer()).Name()
testname := fmt.Sprintf("%s(%v)", fname, input.ToSlice())
t.Run(testname, func(t *testing.T) {
if got := fnc(input); !reflect.DeepEqual(got, want) {
t.Errorf("got %v, want %v", got.ToSlice(), want.ToSlice())
}
})
}
}
}
func BenchmarkReverseLists(b *testing.B) {
rand.Seed(time.Now().Unix())
list := NewList(rand.Perm(1000000))
for _, fnc := range funcs {
fname := runtime.FuncForPC(reflect.ValueOf(fnc).Pointer()).Name()
b.Run(fname, func(b *testing.B) {
for i := 0; i < b.N; i++ {
fnc(list)
}
})
}
}