-
Notifications
You must be signed in to change notification settings - Fork 2.4k
/
keyvalues_test.go
136 lines (123 loc) · 3.58 KB
/
keyvalues_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
// Copyright (c) 2019 The Jaeger Authors.
// Copyright (c) 2017 Uber Technologies, Inc.
// SPDX-License-Identifier: Apache-2.0
package model_test
import (
"errors"
"fmt"
"testing"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
"github.com/jaegertracing/jaeger/model"
)
func TestKeyValuesSort(t *testing.T) {
input := model.KeyValues{
model.String("x", "z"),
model.String("x", "y"),
model.Int64("a", 2),
model.Int64("a", 1),
model.Float64("x", 2),
model.Float64("x", 1),
model.Bool("x", true),
model.Bool("x", false),
}
expected := model.KeyValues{
model.Int64("a", 1),
model.Int64("a", 2),
model.String("x", "y"),
model.String("x", "z"),
model.Bool("x", false),
model.Bool("x", true),
model.Float64("x", 1),
model.Float64("x", 2),
}
input.Sort()
assert.Equal(t, expected, input)
}
func TestKeyValuesFindByKey(t *testing.T) {
input := model.KeyValues{
model.String("x", "z"),
model.String("x", "y"),
model.Int64("a", 2),
}
testCases := []struct {
key string
found bool
kv model.KeyValue
}{
{"b", false, model.KeyValue{}},
{"a", true, model.Int64("a", 2)},
{"x", true, model.String("x", "z")},
}
for _, test := range testCases {
t.Run(fmt.Sprintf("%+v", test), func(t *testing.T) {
kv, found := input.FindByKey(test.key)
assert.Equal(t, test.found, found)
assert.Equal(t, test.kv, kv)
})
}
}
func TestKeyValuesEqual(t *testing.T) {
v1 := model.String("s", "abc")
v2 := model.Int64("i", 123)
v3 := model.Float64("f", 123.4)
assert.True(t, model.KeyValues{}.Equal(model.KeyValues{}))
assert.True(t, model.KeyValues{v1}.Equal(model.KeyValues{v1}))
assert.True(t, model.KeyValues{v1, v2}.Equal(model.KeyValues{v1, v2}))
assert.False(t, model.KeyValues{v1, v2}.Equal(model.KeyValues{v2, v1}))
assert.False(t, model.KeyValues{v1, v2}.Equal(model.KeyValues{v1, v3}))
assert.False(t, model.KeyValues{v1, v2}.Equal(model.KeyValues{v1, v2, v3}))
}
func TestKeyValuesHashErrors(t *testing.T) {
kvs := model.KeyValues{
model.String("x", "y"),
}
someErr := errors.New("some error")
for i := 0; i < 3; i++ {
// mock writer with i-1 successful answers, and one failed answer
w := &mockHashWwiter{
answers: make([]mockHashWwiterAnswer, i+1),
}
w.answers[i] = mockHashWwiterAnswer{1, someErr}
assert.Equal(t, someErr, kvs.Hash(w))
}
kvs[0].VType = model.ValueType(-1)
w := &mockHashWwiter{
answers: make([]mockHashWwiterAnswer, 3),
}
require.EqualError(t, kvs.Hash(w), "unknown type -1")
}
// No memory allocations for IsLess and Equal
// 18.6 ns/op 0 B/op 0 allocs/op
func BenchmarkKeyValueIsLessAndEquals(b *testing.B) {
v1 := model.KeyValue{Key: "x", VType: model.ValueType(-1)}
v2 := model.KeyValue{Key: "x", VType: model.ValueType(-1)}
for i := 0; i < b.N; i++ {
v1.IsLess(&v2)
v2.IsLess(&v1)
v1.Equal(&v2)
v2.Equal(&v1)
}
}
// No memory allocations for Sort (1 alloc comes from the algorithm, not from comparisons)
// 107 ns/op 32 B/op 1 allocs/op
func BenchmarkKeyValuesSort(b *testing.B) {
v1 := model.KeyValue{Key: "x", VType: model.ValueType(-1)}
v2 := model.KeyValue{Key: "x", VType: model.ValueType(-1)}
list := model.KeyValues(make([]model.KeyValue, 5))
for i := 0; i < b.N; i++ {
list[0], list[1], list[2], list[3], list[4] = v2, v1, v2, v1, v2
list.Sort()
}
}
// No memory allocations from wrapping sliceinto model.KeyValues()
// 0.53 ns/op 0 B/op 0 allocs/op
func BenchmarkKeyValuesWrapping(b *testing.B) {
kv := []model.KeyValue{
model.String("x", "y"),
model.Int64("n", 42),
}
for i := 0; i < b.N; i++ {
model.KeyValues(kv).Len()
}
}