-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathorderedset_test.go
194 lines (163 loc) · 5 KB
/
orderedset_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
// Copyright 2018, Goomba project Authors. All rights reserved.
//
// Licensed to the Apache Software Foundation (ASF) under one or more
// contributor license agreements. See the NOTICE file distributed with this
// work for additional information regarding copyright ownership. The ASF
// licenses this file to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
// License for the specific language governing permissions and limitations
// under the License.
package orderedset_test
import (
"testing"
"github.com/goombaio/orderedset"
)
type customType struct {
foo string
}
func TestOrderedSet(t *testing.T) {
s := orderedset.NewOrderedSet()
if !s.Empty() {
t.Fatalf("New set expected to be empty but it is not")
}
if s.Size() != 0 {
t.Fatalf("New set expected to have 0 elements but got %d", s.Size())
}
}
func TestOrderedSet_Add(t *testing.T) {
s := orderedset.NewOrderedSet()
s.Add("e", "f", "g", "c", "d", "x", "b", "a")
s.Add("b") //overwrite
structValue := customType{"svalue"}
s.Add(structValue)
s.Add(&structValue)
s.Add(true)
actualOutput := s.Values()
expectedOutput := []interface{}{"e", "f", "g", "c", "d", "x", "b", "a", structValue, &structValue, true}
if !sameElements(actualOutput, expectedOutput) {
t.Errorf("Got %v expected %v", actualOutput, expectedOutput)
}
}
func TestOrderedSet_Remove(t *testing.T) {
s := orderedset.NewOrderedSet()
s.Add("e", "f", "g", "c", "d", "x", "b", "a")
s.Add("b") //overwrite
structValue := customType{"svalue"}
s.Add(structValue)
s.Add(&structValue)
s.Add(true)
s.Remove("f", "g", &structValue, true)
actualOutput := s.Values()
expectedOutput := []interface{}{"e", "c", "d", "x", "b", "a", structValue}
if !sameElements(actualOutput, expectedOutput) {
t.Errorf("Got %v expected %v", actualOutput, expectedOutput)
}
// already removed, doesn't fails.
s.Remove("f", "g", &structValue, true)
actualOutput = s.Values()
expectedOutput = []interface{}{"e", "c", "d", "x", "b", "a", structValue}
if !sameElements(actualOutput, expectedOutput) {
t.Errorf("Got %v expected %v", actualOutput, expectedOutput)
}
}
func TestOrderedSet_Contains(t *testing.T) {
s := orderedset.NewOrderedSet()
s.Add("e", "f", "g", "c", "d", "x", "b", "a")
s.Add("b") //overwrite
structValue := customType{"svalue"}
s.Add(structValue)
s.Add(&structValue)
s.Add(true)
table := []struct {
input []interface{}
expectedOutput bool
}{
{[]interface{}{"c", "d", &structValue}, true},
{[]interface{}{"c", "d", nil}, false},
{[]interface{}{true}, true},
{[]interface{}{structValue}, true},
}
for _, test := range table {
actualOutput := s.Contains(test.input...)
if actualOutput != test.expectedOutput {
t.Errorf("Got %v expected %v", actualOutput, test.expectedOutput)
}
}
}
func TestOrderedSet_Empty(t *testing.T) {
s := orderedset.NewOrderedSet()
if empty := s.Empty(); !empty {
t.Errorf("Got %v expected %v", empty, true)
}
s.Add("e", "f", "g", "c", "d", "x", "b", "a")
if empty := s.Empty(); empty {
t.Errorf("Got %v expected %v", empty, false)
}
s.Remove("e", "f", "g", "c", "d", "x", "b", "a")
if empty := s.Empty(); !empty {
t.Errorf("Got %v expected %v", empty, true)
}
}
func TestOrderedSet_Values(t *testing.T) {
s := orderedset.NewOrderedSet()
s.Add("e", "f", "g", "c", "d", "x", "b", "a")
s.Add("b") //overwrite
structValue := customType{"svalue"}
s.Add(structValue)
s.Add(&structValue)
s.Add(true)
actualOutput := s.Values()
expectedOutput := []interface{}{"e", "f", "g", "c", "d", "x", "b", "a", structValue, &structValue, true}
if !sameElements(actualOutput, expectedOutput) {
t.Errorf("Got %v expected %v", actualOutput, expectedOutput)
}
}
func TestOrderedSet_Size(t *testing.T) {
s := orderedset.NewOrderedSet()
if size := s.Size(); size != 0 {
t.Errorf("Got %v expected %v", size, 0)
}
s.Add("e", "f", "g", "c", "d", "x", "b", "a")
s.Add("e", "f", "g", "c", "d", "x", "b", "a", "z") // overwrite
if size := s.Size(); size != 9 {
t.Errorf("Got %v expected %v", size, 9)
}
s.Remove("e", "f", "g", "c", "d", "x", "b", "a", "z")
if size := s.Size(); size != 0 {
t.Errorf("Got %v expected %v", size, 0)
}
}
func TestOrderedSet_String(t *testing.T) {
s := orderedset.NewOrderedSet()
s.Add("foo", "bar")
expected := "[foo bar]"
result := s.String()
if expected != result {
t.Fatalf("OrderedSet_Stringer expected to be %q but got %q", expected, result)
}
}
func sameElements(a []interface{}, b []interface{}) bool {
if len(a) != len(b) {
return false
}
for _, av := range a {
found := false
for _, bv := range b {
if av == bv {
found = true
break
}
}
if !found {
return false
}
}
return true
}