-
Notifications
You must be signed in to change notification settings - Fork 19
/
schema_test.go
235 lines (221 loc) · 6.04 KB
/
schema_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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
package spec3
import (
"reflect"
"testing"
)
func TestOrderedSchemas_Get(t *testing.T) {
type fields struct {
data OrderedMap
}
type args struct {
key string
}
tests := []struct {
name string
fields fields
args args
want *Schema
}{
{"Should fetch the item when existent key is passed", fields{buildOrderMapForOrderedSchemas()}, args{"skipParam"}, buildSchema("default parameter")},
{"Should return nil when non-existent key is passed", fields{buildOrderMapForOrderedSchemas()}, args{"getParam"}, nil},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &OrderedSchemas{
data: tt.fields.data,
}
if got := s.Get(tt.args.key); !reflect.DeepEqual(got, tt.want) {
t.Errorf("OrderedSchemas.Get() = %v, want %v", got, tt.want)
}
})
}
}
func TestOrderedSchemas_GetOK(t *testing.T) {
type fields struct {
data OrderedMap
}
type args struct {
key string
}
tests := []struct {
name string
fields fields
args args
wantSchema *Schema
wantOK bool
}{
{"Should fetch the item when existent key is passed", fields{buildOrderMapForOrderedSchemas()}, args{"limitParam"}, buildSchema("OK"), true},
{"Should return nil when non-existent key is passed", fields{buildOrderMapForOrderedSchemas()}, args{"getParam"}, nil, false},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &OrderedSchemas{
data: tt.fields.data,
}
got, got1 := s.GetOK(tt.args.key)
if !reflect.DeepEqual(got, tt.wantSchema) {
t.Errorf("OrderedSchemas.GetOK() got = %v, want %v", got, tt.wantSchema)
}
if got1 != tt.wantOK {
t.Errorf("OrderedSchemas.GetOK() got1 = %v, want %v", got1, tt.wantOK)
}
})
}
}
func TestOrderedSchemas_Set(t *testing.T) {
type fields struct {
data OrderedMap
}
type args struct {
key string
val *Schema
}
tests := []struct {
name string
fields fields
args args
wantOK bool
}{
{"Should set value when non-existent parameter code is passed", fields{buildOrderMapForOrderedSchemas()}, args{"getParam", buildSchema("Getting OrderedSchemas")}, true},
{"Should fail when existent parameter code is passed", fields{buildOrderMapForOrderedSchemas()}, args{"limitParam", buildSchema("another OK")}, false},
{"Should fail when empty key is passed", fields{buildOrderMapForOrderedSchemas()}, args{"", buildSchema("description of item #empty")}, false},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &OrderedSchemas{
data: tt.fields.data,
}
if got := s.Set(tt.args.key, tt.args.val); got != tt.wantOK {
t.Fatalf("OrderedSchemas.Set() = %v, want %v", got, tt.wantOK)
}
if tt.wantOK {
gotVal, gotOK := s.GetOK(tt.args.key)
if !gotOK {
t.Fatalf("OrderedSchemas.GetOK().OK = %v, want %v", gotOK, true)
}
if !reflect.DeepEqual(gotVal, tt.args.val) {
t.Fatalf("OrderedSchemas.GetOK().val = %v, want %v", gotVal, tt.args.val)
}
}
})
}
}
func TestOrderedSchemas_ForEach(t *testing.T) {
type fields struct {
data OrderedMap
}
type args struct {
fn func(string, *Schema) error
}
type foundSchema struct {
parameter *Schema
found bool
}
tests := []struct {
name string
fields fields
wantValInForEach map[string]*foundSchema
wantErr error
}{
{
"Should iterate 4 items for OrderedSchemas fixture",
fields{buildOrderMapForOrderedSchemas()},
map[string]*foundSchema{
"skipParam": &foundSchema{buildSchema("default parameter"), false},
"limitParam": &foundSchema{buildSchema("OK"), false},
},
nil,
},
{
"Should return empty array when there are no values in OrderedSchemas",
fields{},
map[string]*foundSchema{},
nil,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &OrderedSchemas{
data: tt.fields.data,
}
err := s.ForEach(func(key string, gotSchema *Schema) error {
if wantVal, ok := tt.wantValInForEach[key]; ok {
if !reflect.DeepEqual(wantVal.parameter, gotSchema) {
t.Fatalf("OrderedSchemas.ForEach() for key = %s val = %v, want = %v", key, gotSchema, wantVal.parameter)
}
wantVal.found = true
} else {
t.Fatalf("OrderedSchemas.ForEach() for key = %s val = %v, want = %v", key, gotSchema, wantVal)
}
return nil
})
if err == nil && tt.wantErr == nil {
// nothing to assert here
} else if err != tt.wantErr {
t.Fatalf("OrderedSchemas.ForEach() error = %v, wantErr %v", err, tt.wantErr)
}
if tt.wantErr == nil {
for key2, val2 := range tt.wantValInForEach {
if !val2.found {
t.Fatalf("OrderedSchemas.ForEach() key = %s not found during foreach()", key2)
}
}
}
})
}
}
func TestOrderedSchemas_Keys(t *testing.T) {
type fields struct {
data OrderedMap
}
tests := []struct {
name string
fields fields
wantKeys []string
}{
{"Should return 2 items for OrderedSchemas fixture", fields{buildOrderMapForOrderedSchemas()}, []string{"skipParam", "limitParam"}},
{"Should return empty array when there are no values in OrderedSchemas", fields{}, []string{}},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &OrderedSchemas{
data: tt.fields.data,
}
got := s.Keys()
if len(got) != 0 || len(tt.wantKeys) != 0 {
if !reflect.DeepEqual(got, tt.wantKeys) {
t.Errorf("OrderedSchemas.Keys() = %v, want %v", got, tt.wantKeys)
}
}
})
}
}
func buildSchema(value string) *Schema {
extensions := Extensions{}
extensions.Set("x-some-key", value)
return &Schema{VendorExtensible{extensions}, Reference{}}
}
func buildEmptyOrderMapForOrderedSchemas() OrderedMap {
return OrderedMap{
filter: MatchNonEmptyKeys,
}
}
func buildOrderMapForOrderedSchemas() OrderedMap {
return OrderedMap{
data: map[string]interface{}{
"skipParam": buildSchema("default parameter"),
"limitParam": buildSchema("OK"),
},
keys: []string{
"skipParam",
"limitParam",
},
filter: MatchNonEmptyKeys,
}
}
func buildOrderedSchemasFixture() OrderedSchemas {
m := OrderedSchemas{
data: buildOrderMapForOrderedSchemas(),
}
return m
}