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
|
// Copyright (c) 2021 Uber Technologies, Inc.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
package tally
import (
"math/rand"
"sort"
"testing"
"github.com/stretchr/testify/assert"
)
func TestKeyForPrefixedStringMaps(t *testing.T) {
tests := []struct {
desc string
prefix string
maps []map[string]string
want string
}{
{
desc: "no maps",
prefix: "foo",
want: "foo+",
},
{
desc: "disjoint maps",
prefix: "foo",
maps: []map[string]string{
{
"a": "foo",
"b": "bar",
},
{
"c": "baz",
"d": "qux",
},
},
want: "foo+a=foo,b=bar,c=baz,d=qux",
},
{
desc: "map overlap",
prefix: "foo",
maps: []map[string]string{
{
"a": "1",
"b": "1",
"c": "1",
"d": "1",
},
{"b": "2"},
{"c": "3"},
{"d": "4"},
},
want: "foo+a=1,b=2,c=3,d=4",
},
}
for _, tt := range tests {
t.Run(tt.desc, func(t *testing.T) {
got := keyForPrefixedStringMaps(tt.prefix, tt.maps...)
assert.Equal(t, tt.want, got)
})
}
}
func TestInsertionSort(t *testing.T) {
chars := []byte("abcdefghijklmnopqrstuvwxyz")
n := len(chars)
var expected []string
var actual []string
for i := 0; i < 12; i++ {
s := rand.Intn(20) + 5
var key []byte
for j := 0; j < s; j++ {
key = append(key, chars[rand.Intn(n)])
}
expected = append(expected, string(key))
actual = append(actual, string(key))
}
sort.Strings(expected)
insertionSort(actual)
assert.Equal(t, expected, actual)
}
|
