-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathconcat_test.go
152 lines (135 loc) · 3.3 KB
/
concat_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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
package concat
import (
"strings"
"testing"
"unsafe"
)
func TestStringSize(t *testing.T) {
have := unsafe.Sizeof(stringStruct{})
want := unsafe.Sizeof("")
if have != want {
t.Errorf("string struct size mismatch: have %d, want %d", have, want)
}
}
func TestConcat(t *testing.T) {
const stringConst = "const"
var stringVar = "var"
inputs := [][]string{
// concat2:
{"", ""},
{"x", ""},
{"", "x"},
{stringVar, stringConst},
{"abc", stringVar},
{stringConst, "abc"},
{stringVar + stringVar, stringVar},
// concat3:
{"", "", ""},
{"x", "", ""},
{"", "x", ""},
{stringVar, stringConst, "x"},
{stringConst, "", ""},
{stringVar, "x", stringVar + stringVar},
}
reverseStrings := func(xs []string) []string {
ys := make([]string, len(xs))
for i := range xs {
ys[i] = xs[len(xs)-i-1]
}
return ys
}
type testCase struct {
fn func(args []string) string
goldenFn func(args []string) string
args []string
}
var tests []testCase
for _, xs := range inputs {
var fn func([]string) string
var goldenFn func([]string) string
switch len(xs) {
case 2:
fn = func(xs []string) string {
return Strings(xs[0], xs[1])
}
goldenFn = func(xs []string) string {
return xs[0] + xs[1]
}
case 3:
fn = func(xs []string) string {
return Strings3(xs[0], xs[1], xs[2])
}
goldenFn = func(xs []string) string {
return xs[0] + xs[1] + xs[2]
}
default:
panic("invalid arguments count")
}
tests = append(tests,
testCase{fn: fn, goldenFn: goldenFn, args: xs},
testCase{fn: fn, goldenFn: goldenFn, args: reverseStrings(xs)})
}
for _, test := range tests {
have := test.fn(test.args)
want := test.goldenFn(test.args)
if have != want {
t.Errorf("concat(%v) result mismatch:\nhave: %q\nwant: %q",
test.args, have, want)
}
}
}
var shortStrings = []string{"lorem ", "ipsum ", "dolor sit amet"}
var longerStrings = []string{
strings.Repeat(shortStrings[0], 16),
strings.Repeat(shortStrings[1], 16),
strings.Repeat(shortStrings[2], 16),
}
func benchmarkConcat(b *testing.B, fn func([]string) string) {
b.Run("short", func(b *testing.B) {
for i := 0; i < b.N; i++ {
_ = fn(shortStrings)
}
})
b.Run("longer", func(b *testing.B) {
for i := 0; i < b.N; i++ {
_ = fn(longerStrings)
}
})
}
func BenchmarkConcat2Operator(b *testing.B) {
benchmarkConcat(b, func(xs []string) string { return xs[0] + xs[1] })
}
func BenchmarkConcat2Builder(b *testing.B) {
benchmarkConcat(b, func(xs []string) string {
var builder strings.Builder
builder.Grow(len(xs[0]) + len(xs[1]))
builder.WriteString(xs[0])
builder.WriteString(xs[1])
return builder.String()
})
}
func BenchmarkConcat2(b *testing.B) {
benchmarkConcat(b, func(xs []string) string {
return Strings(xs[0], xs[1])
})
}
func BenchmarkConcat3Operator(b *testing.B) {
benchmarkConcat(b, func(xs []string) string {
return xs[0] + xs[1] + xs[2]
})
}
func BenchmarkConcat3Builder(b *testing.B) {
benchmarkConcat(b, func(xs []string) string {
var builder strings.Builder
builder.Grow(len(xs[0]) + len(xs[1]) + len(xs[2]))
builder.WriteString(xs[0])
builder.WriteString(xs[1])
builder.WriteString(xs[2])
return builder.String()
})
}
func BenchmarkConcat3(b *testing.B) {
benchmarkConcat(b, func(xs []string) string {
return Strings3(xs[0], xs[1], xs[2])
})
}