-
-
Notifications
You must be signed in to change notification settings - Fork 400
/
Copy pathorderedmap_test.go
361 lines (326 loc) · 8.96 KB
/
orderedmap_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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
// This file is part of arduino-cli.
//
// Copyright 2023 ARDUINO SA (http://www.arduino.cc/)
//
// This software is released under the GNU General Public License version 3,
// which covers the main part of arduino-cli.
// The terms of this license can be found at:
// https://www.gnu.org/licenses/gpl-3.0.en.html
//
// You can be released from the requirements of the above licenses by purchasing
// a commercial license. Buying such a license is mandatory if you want to
// modify or otherwise use the software for commercial activities involving the
// Arduino software without disclosing the source code of your own applications.
// To purchase a commercial license, send an email to license@arduino.cc.
package orderedmap_test
import (
"testing"
"github.com/arduino/arduino-cli/internal/orderedmap"
"github.com/stretchr/testify/require"
)
func TestGet(t *testing.T) {
t.Run("the key is a string", func(t *testing.T) {
m := orderedmap.New[string, int]()
require.Zero(t, m.Get("not-existing-key"))
v, ok := m.GetOk("not-existing-key")
require.Zero(t, v)
require.False(t, ok)
m.Set("existing-key", 1)
require.Equal(t, 1, m.Get("existing-key"))
v, ok = m.GetOk("existing-key")
require.Equal(t, 1, v)
require.True(t, ok)
// test empty key
m.Set("", 2)
require.Equal(t, 2, m.Get(""))
v, ok = m.GetOk("")
require.Equal(t, 2, v)
require.True(t, ok)
})
t.Run("the key is int", func(t *testing.T) {
m := orderedmap.New[int, int]()
require.Equal(t, 0, m.Get(1))
v, ok := m.GetOk(1)
require.Zero(t, v)
require.False(t, ok)
m.Set(1, 1)
require.Equal(t, 1, m.Get(1))
v, ok = m.GetOk(1)
require.Equal(t, 1, v)
require.True(t, ok)
// test empty key
m.Set(0, 2)
require.Equal(t, 2, m.Get(0))
v, ok = m.GetOk(0)
require.Equal(t, 2, v)
require.True(t, ok)
})
t.Run("custom comparable key", func(t *testing.T) {
type A struct {
b []byte
}
m := orderedmap.NewWithConversionFunc[*A, int, string](
func(a *A) string {
if a == nil {
return ""
}
return string(a.b)
},
)
require.Zero(t, m.Get(&A{}))
require.Zero(t, m.Get(nil))
// Here we're using the conversion function to set the key, using a different
// pointer to retrieve the value works.
m.Set(&A{b: []byte{60, 61, 62}}, 1)
require.Equal(t, 1, m.Get(&A{b: []byte{60, 61, 62}}))
m.Set(nil, 2)
require.Equal(t, 2, m.Get(nil))
})
}
func TestSet(t *testing.T) {
t.Run("insert 3 different keys", func(t *testing.T) {
m := orderedmap.New[string, int]()
m.Set("a", 1)
m.Set("b", 2)
m.Set("c", 3)
require.Equal(t, 1, m.Get("a"))
require.Equal(t, 2, m.Get("b"))
require.Equal(t, 3, m.Get("c"))
})
t.Run("insert equal keys", func(t *testing.T) {
m := orderedmap.New[string, int]()
m.Set("a", 1)
m.Set("a", 2)
require.Equal(t, 2, m.Get("a"))
})
}
func TestSize(t *testing.T) {
t.Run("empty map", func(t *testing.T) {
m := orderedmap.New[string, bool]()
require.Zero(t, m.Size())
})
t.Run("one element", func(t *testing.T) {
m := orderedmap.New[string, bool]()
m.Set("a", true)
require.Equal(t, 1, m.Size())
})
t.Run("three elements", func(t *testing.T) {
m := orderedmap.New[string, bool]()
m.Set("a", true)
m.Set("b", true)
m.Set("c", true)
require.Equal(t, 3, m.Size())
})
t.Run("insert same keys result in size 1", func(t *testing.T) {
m := orderedmap.New[string, bool]()
m.Set("a", true)
m.Set("a", false)
m.Set("a", true)
require.Equal(t, 1, m.Size())
})
}
func TestKeys(t *testing.T) {
t.Run("empty map", func(t *testing.T) {
m := orderedmap.New[string, bool]()
require.Empty(t, m.Keys())
})
t.Run("one element", func(t *testing.T) {
m := orderedmap.New[string, bool]()
m.Set("a", true)
require.Len(t, m.Keys(), 1)
})
t.Run("keys respect order of insertion", func(t *testing.T) {
m := orderedmap.New[string, bool]()
m.Set("a", true)
m.Set("b", true)
m.Set("c", true)
require.Equal(t, []string{"a", "b", "c"}, m.Keys())
})
t.Run("replacing a key changes the ordering", func(t *testing.T) {
m := orderedmap.New[string, bool]()
m.Set("a", true)
m.Set("b", true)
m.Set("a", false)
require.Equal(t, []string{"b", "a"}, m.Keys())
})
t.Run("delete a key", func(t *testing.T) {
m := orderedmap.New[string, bool]()
m.Set("a", true)
m.Set("b", true)
m.Remove("a")
require.Equal(t, []string{"b"}, m.Keys())
})
}
func TestRemove(t *testing.T) {
t.Run("key doesn't exist", func(t *testing.T) {
m := orderedmap.New[string, bool]()
require.Zero(t, m.Get("not-existing-key"))
m.Remove("not-existing-key")
require.Zero(t, m.Get("not-existing-key"))
})
t.Run("key exist", func(t *testing.T) {
m := orderedmap.New[string, bool]()
m.Set("a", true)
require.True(t, m.Get("a"))
m.Remove("a")
require.False(t, m.Get("a"))
})
t.Run("key deletion doesn't affect other keys", func(t *testing.T) {
m := orderedmap.New[string, bool]()
m.Set("a", true)
m.Set("b", true)
m.Remove("a")
require.True(t, m.Get("b"))
_, ok := m.GetOk("a")
require.False(t, ok)
})
}
func TestMerge(t *testing.T) {
t.Run("merge empty maps", func(t *testing.T) {
m1 := orderedmap.New[string, int]()
m2 := orderedmap.New[string, int]()
merged := m1.Merge(m2)
require.Equal(t, m1, merged)
require.Len(t, m1.Keys(), 0)
})
t.Run("merge multiple elements", func(t *testing.T) {
m1 := orderedmap.New[string, int]()
m1.Set("a", 1)
m1.Set("b", 2)
m1.Set("c", 3)
m2 := orderedmap.New[string, int]()
m2.Set("d", 4)
m2.Set("e", 5)
// assert that the Merge return is m1
merged := m1.Merge(m2)
require.Equal(t, m1, merged)
// assert we find the merged elements in the map
require.Equal(t, 5, m1.Size())
require.Equal(t, 4, m1.Get("d"))
require.Equal(t, 5, m1.Get("e"))
require.Equal(t, []string{"a", "b", "c", "d", "e"}, m1.Keys())
require.Equal(t, []string{"d", "e"}, m2.Keys())
})
}
func TestSortKeys(t *testing.T) {
t.Run("empty map", func(t *testing.T) {
m1 := orderedmap.New[string, int]()
require.Equal(t, []string{}, m1.Keys())
m1.SortKeys(func(x, y string) int {
if x < y {
return -1
}
return 1
})
require.Equal(t, []string{}, m1.Keys())
})
t.Run("sort ascending", func(t *testing.T) {
m1 := orderedmap.New[string, int]()
m1.Set("c", 3)
m1.Set("b", 2)
m1.Set("a", 1)
m1.Set("z", 4)
require.Equal(t, []string{"c", "b", "a", "z"}, m1.Keys())
m1.SortKeys(func(x, y string) int {
if x < y {
return -1
}
return 1
})
require.Equal(t, []string{"a", "b", "c", "z"}, m1.Keys())
})
}
func TestValues(t *testing.T) {
t.Run("empty map", func(t *testing.T) {
m1 := orderedmap.New[string, int]()
require.Empty(t, m1.Values())
})
t.Run("values respect order of insertion", func(t *testing.T) {
m1 := orderedmap.New[string, int]()
m1.Set("a", 1)
m1.Set("b", 2)
m1.Set("c", 3)
require.Equal(t, []int{1, 2, 3}, m1.Values())
})
t.Run("after a key sort values respect the new order", func(t *testing.T) {
m1 := orderedmap.New[string, int]()
m1.Set("c", 3)
m1.Set("b", 2)
m1.Set("a", 1)
m1.Set("z", 4)
require.Equal(t, []int{3, 2, 1, 4}, m1.Values())
m1.SortKeys(func(x, y string) int {
if x < y {
return -1
}
return 1
})
require.Equal(t, []int{1, 2, 3, 4}, m1.Values())
})
}
func TestClone(t *testing.T) {
t.Run("empty map", func(t *testing.T) {
m1 := orderedmap.New[string, int]()
clone := m1.Clone()
require.NotEqual(t, m1, clone)
require.Equal(t, m1.Keys(), clone.Keys())
require.Equal(t, m1.Values(), clone.Values())
})
t.Run("clone doesn't affect the original map", func(t *testing.T) {
m1 := orderedmap.New[string, int]()
m1.Set("a", 1)
m1.Set("b", 2)
m1.Set("c", 3)
clone := m1.Clone()
require.NotEqual(t, m1, clone)
require.Equal(t, m1.Keys(), clone.Keys())
require.Equal(t, m1.Values(), clone.Values())
clone.Set("d", 4)
require.Equal(t, 4, clone.Get("d"))
_, ok := m1.GetOk("d")
require.False(t, ok)
})
}
func TestMarshallJSON(t *testing.T) {
t.Run("empty map", func(t *testing.T) {
m := orderedmap.New[string, int]()
mapJSON, err := m.MarshalJSON()
require.NoError(t, err)
require.JSONEq(t, `{}`, string(mapJSON))
})
t.Run("respect the order of insertion", func(t *testing.T) {
m := orderedmap.New[string, int]()
m.Set("a", 1)
m.Set("b", 2)
m.Set("c", 3)
mapJSON, err := m.MarshalJSON()
require.NoError(t, err)
require.JSONEq(t, `{"a":1,"b":2,"c":3}`, string(mapJSON))
})
t.Run("can serialize int keys", func(t *testing.T) {
m := orderedmap.New[int, bool]()
m.Set(1, true)
m.Set(2, true)
m.Set(3, true)
mapJSON, err := m.MarshalJSON()
require.NoError(t, err)
require.JSONEq(t, `{"1":true,"2":true,"3":true}`, string(mapJSON))
})
t.Run("can serialize pointer keys", func(t *testing.T) {
m := orderedmap.NewWithConversionFunc[*int, bool, int](func(i *int) int {
if i == nil {
return 0
}
return *i
})
m.Set(toPtr(1), true)
m.Set(toPtr(2), true)
m.Set(toPtr(3), true)
mapJSON, err := m.MarshalJSON()
require.NoError(t, err)
require.JSONEq(t, `{"1":true,"2":true,"3":true}`, string(mapJSON))
})
}
func toPtr[V any](v V) *V {
return &v
}