-
Notifications
You must be signed in to change notification settings - Fork 0
/
lww_e_set_test.go
237 lines (200 loc) · 5.09 KB
/
lww_e_set_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
package crdt
import (
"testing"
"time"
)
func TestLWWESetInitialization(t *testing.T) {
set := NewLWWESet[int]("lwweset")
if set.Size() != 0 {
t.Fatalf("lwweset should initialize to a size of 0")
}
}
func TestLSSESetAdd(t *testing.T) {
set := NewLWWESet[int]("lwweset")
set.Add(5)
if set.Size() != 1 {
t.Fatalf("lwweset size should be 1")
}
}
func TestLWWESetLookupTrue(t *testing.T) {
set := NewLWWESet[int]("lwweset")
set.Add(5)
if !set.Lookup(5) {
t.Fatalf("lwweset lookup should have been true")
}
}
func TestLWWESetLookupFalse(t *testing.T) {
set := NewLWWESet[int]("lwweset")
set.Add(5)
if set.Lookup(10) {
t.Fatalf("lwweset lookup should have been false")
}
}
func TestLWWESetValidRemove(t *testing.T) {
set := NewLWWESet[int]("lwweset")
set.Add(5)
set.Remove(5)
if set.Size() != 0 {
t.Fatalf("lwweset size should be 0")
}
if set.Lookup(5) {
t.Fatalf("lwweset lookup should have been false")
}
}
func TestLWWESetInvalidRemove(t *testing.T) {
set := NewLWWESet[int]("lwweset")
set.Remove(5)
set.Add(5)
if set.Size() != 1 {
t.Fatalf("lwweset size should be 1")
}
if !set.Lookup(5) {
t.Fatalf("lwweset lookup should have been true")
}
}
func TestLWWESetValidRemoveWithReAdd(t *testing.T) {
set := NewLWWESet[int]("lwweset")
set.Add(5)
set.Remove(5)
time.Sleep(1 * time.Millisecond)
set.Add(5)
if set.Size() != 1 {
t.Fatalf("lwweset size should be 1")
}
if !set.Lookup(5) {
t.Fatalf("lwweset lookup should have been true")
}
}
func TestLWWESetMerge(t *testing.T) {
set1 := NewLWWESet[int]("lwweset")
set1.Add(5)
set2 := NewLWWESet[int]("lwweset")
set2.Add(10)
set2.Add(15)
set2.Remove(10)
if set1.Lookup(10) {
t.Fatalf("lwweset lookup for 10 should have been false before merge")
}
if set1.Lookup(15) {
t.Fatalf("lwweset lookup for 15 should have been false before merge")
}
set1.Merge(set2)
if set1.Size() != 2 {
t.Fatalf("lwweset size should have been 2 after merge")
}
if set1.Lookup(10) {
t.Fatalf("lwweset lookup for 10 should have been false after merge")
}
if !set1.Lookup(15) {
t.Fatalf("lwweset lookup for 10 should have been true after merge")
}
}
func TestLWWESetMergeWithDelayedAdd(t *testing.T) {
set1 := NewLWWESet[int]("lwweset")
set1.Add(5)
time.Sleep(1 * time.Millisecond)
set1.Remove(5)
set2 := NewLWWESet[int]("lwweset")
time.Sleep(1 * time.Millisecond)
set2.Add(5)
if set1.Size() != 0 {
t.Fatalf("lwweset size should have been 0 before merge")
}
if set1.Lookup(5) {
t.Fatalf("lwweset lookup for 5 should have been false before merge")
}
set1.Merge(set2)
if set1.Size() != 1 {
t.Fatalf("lwweset size should have been 1 after merge")
}
if !set1.Lookup(5) {
t.Fatalf("lwweset lookup for 5 should have been true after merge")
}
}
func TestLWWESetMergeFirstSetAddAndRemoveAfter(t *testing.T) {
set1 := NewLWWESet[int]("lwweset")
set2 := NewLWWESet[int]("lwweset")
time.Sleep(10 * time.Millisecond)
set2.Add(5)
time.Sleep(10 * time.Millisecond)
set2.Remove(5)
time.Sleep(10 * time.Millisecond)
set1.Add(5)
if set1.Size() != 1 {
t.Fatalf("lwweset size should have been 1 before merge")
}
if !set1.Lookup(5) {
t.Fatalf("lwweset lookup for 5 should have been true before merge")
}
set1.Merge(set2)
if set1.Size() != 1 {
t.Fatalf("lwweset size should have been 1 after merge")
}
if !set1.Lookup(5) {
t.Fatalf("lwweset lookup for 5 should have been true after merge")
}
time.Sleep(10 * time.Millisecond)
set1.Remove(5)
set1.Merge(set2)
if set1.Size() != 0 {
t.Fatalf("lwweset size should have been 1 after merge")
}
if set1.Lookup(5) {
t.Fatalf("lwweset lookup for 5 should have been false after merge")
}
}
func TestLWWESetMergeIdempotent(t *testing.T) {
set1 := NewLWWESet[int]("lwweset")
set1.Add(5)
time.Sleep(1 * time.Millisecond)
set1.Remove(5)
set2 := NewLWWESet[int]("lwweset")
time.Sleep(1 * time.Millisecond)
set2.Add(5)
if set1.Size() != 0 {
t.Fatalf("lwweset size should have been 0 before merge")
}
if set1.Lookup(5) {
t.Fatalf("lwweset lookup for 5 should have been false before merge")
}
set1.Merge(set2)
if set1.Size() != 1 {
t.Fatalf("lwweset size should have been 1 after merge")
}
if !set1.Lookup(5) {
t.Fatalf("lwweset lookup for 5 should have been true after merge")
}
set1.Merge(set2)
set1.Merge(set2)
set1.Merge(set2)
if set1.Size() != 1 {
t.Fatalf("lwweset size should have been 2 after merge")
}
if !set1.Lookup(5) {
t.Fatalf("lwweset lookup for 5 should have been true after merge")
}
}
func TestLWWESetMergeUnmatchedName(t *testing.T) {
set1 := NewLWWESet[int]("lwweset")
set1.Add(5)
set2 := NewLWWESet[int]("lwweset2")
set2.Add(10)
set2.Add(15)
set2.Remove(10)
if set1.Lookup(10) {
t.Fatalf("lwweset lookup for 10 should have been false before merge")
}
if set1.Lookup(15) {
t.Fatalf("lwweset lookup for 15 should have been false before merge")
}
set1.Merge(set2)
if set1.Size() != 1 {
t.Fatalf("lwweset size should have been 2 after merge")
}
if set1.Lookup(10) {
t.Fatalf("lwweset lookup for 10 should have been false after merge")
}
if set1.Lookup(15) {
t.Fatalf("lwweset lookup for 10 should have been false after merge")
}
}