-
Notifications
You must be signed in to change notification settings - Fork 27
/
freq_test.go
162 lines (151 loc) · 2.5 KB
/
freq_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
153
154
155
156
157
158
159
160
161
162
package main
import (
"testing"
"github.com/marianogappa/chart/format"
)
func TestFreq(t *testing.T) {
tests := []struct {
name string
isss [][]string
expectedFSS [][]float64
expectedSSS [][]string
}{
{
name: "empty case",
isss: [][]string{},
expectedFSS: [][]float64{},
expectedSSS: [][]string{},
},
{
name: "one column, all different",
isss: [][]string{
{"a"},
{"b"},
{"c"},
},
expectedFSS: [][]float64{
{1},
{1},
{1},
},
expectedSSS: [][]string{
{"a"},
{"b"},
{"c"},
},
},
{
name: "one column, one duplicate",
isss: [][]string{
{"a"},
{"b"},
{"a"},
},
expectedFSS: [][]float64{
{2},
{1},
},
expectedSSS: [][]string{
{"a"},
{"b"},
},
},
{
name: "two columns, ignores second one",
isss: [][]string{
{"a", "ignore me"},
{"b", "ignore me"},
{"a", "ignore me"},
},
expectedFSS: [][]float64{
{2},
{1},
},
expectedSSS: [][]string{
{"a"},
{"b"},
},
},
{
name: "sums less frequent labels into an Other category when over 10 labels",
isss: [][]string{
{"a"},
{"a"},
{"b"},
{"b"},
{"c"},
{"c"},
{"d"},
{"d"},
{"e"},
{"e"},
{"f"},
{"f"},
{"g"},
{"g"},
{"h"},
{"h"},
{"i"},
{"i"},
{"j"},
{"k"},
{"l"},
{"m"},
},
expectedFSS: [][]float64{
{2},
{2},
{2},
{2},
{2},
{2},
{2},
{2},
{2},
{4},
},
expectedSSS: [][]string{
{"a"},
{"b"},
{"c"},
{"d"},
{"e"},
{"f"},
{"g"},
{"h"},
{"i"},
{"Other"},
},
},
}
for _, ts := range tests {
fss, sss, _ := preprocessFreq(ts.isss, format.LineFormat{})
if !equalMap(fss, ts.expectedFSS, sss, ts.expectedSSS) {
t.Errorf("[%v] case failed: %v, %v were not equal to %v, %v", ts.name, fss, sss, ts.expectedFSS, ts.expectedSSS)
}
}
}
// equalMap is different to intuitive equality in that: supports mirror slices sss/fss and disregards order of map entries
func equalMap(fss [][]float64, expectedFSS [][]float64, sss [][]string, expectedSSS [][]string) bool {
if len(fss) != len(expectedFSS) || len(sss) != len(expectedSSS) {
return false
}
for i := range fss {
f := fss[i][0]
s := sss[i][0]
k := -1
for j := range expectedSSS {
if expectedSSS[j][0] == s {
k = j
break
}
}
if k == -1 {
return false
}
if expectedFSS[k][0] != f {
return false
}
}
return true
}