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
|
# Copyright (C) Dnspython Contributors, see LICENSE for text of ISC license
# Copyright (C) 2003-2007, 2009-2011 Nominum, Inc.
#
# Permission to use, copy, modify, and distribute this software and its
# documentation for any purpose with or without fee is hereby granted,
# provided that the above copyright notice and this permission notice
# appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND NOMINUM DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL NOMINUM BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
# OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
import copy
import unittest
import dns.set
# for convenience
S = dns.set.Set
class SetTestCase(unittest.TestCase):
def testLen1(self):
s1 = S()
self.assertEqual(len(s1), 0)
def testLen2(self):
s1 = S([1, 2, 3])
self.assertEqual(len(s1), 3)
def testLen3(self):
s1 = S([1, 2, 3, 3, 3])
self.assertEqual(len(s1), 3)
def testUnion1(self):
s1 = S([1, 2, 3])
s2 = S([1, 2, 3])
e = S([1, 2, 3])
self.assertEqual(s1 | s2, e)
def testUnion2(self):
s1 = S([1, 2, 3])
s2 = S([])
e = S([1, 2, 3])
self.assertEqual(s1 | s2, e)
def testUnion3(self):
s1 = S([1, 2, 3])
s2 = S([3, 4])
e = S([1, 2, 3, 4])
self.assertEqual(s1 | s2, e)
def testUnionPlusSyntax(self):
s1 = S([1, 2, 3])
s2 = S([3, 4])
e = S([1, 2, 3, 4])
self.assertEqual(s1 + s2, e)
def testIntersection1(self):
s1 = S([1, 2, 3])
s2 = S([1, 2, 3])
e = S([1, 2, 3])
self.assertEqual(s1 & s2, e)
def testIntersection2(self):
s1 = S([0, 1, 2, 3])
s2 = S([1, 2, 3, 4])
e = S([1, 2, 3])
self.assertEqual(s1 & s2, e)
def testIntersection3(self):
s1 = S([1, 2, 3])
s2 = S([])
e = S([])
self.assertEqual(s1 & s2, e)
def testIntersection4(self):
s1 = S([1, 2, 3])
s2 = S([5, 4])
e = S([])
self.assertEqual(s1 & s2, e)
def testDifference1(self):
s1 = S([1, 2, 3])
s2 = S([5, 4])
e = S([1, 2, 3])
self.assertEqual(s1 - s2, e)
def testDifference2(self):
s1 = S([1, 2, 3])
s2 = S([])
e = S([1, 2, 3])
self.assertEqual(s1 - s2, e)
def testDifference3(self):
s1 = S([1, 2, 3])
s2 = S([3, 2])
e = S([1])
self.assertEqual(s1 - s2, e)
def testDifference4(self):
s1 = S([1, 2, 3])
s2 = S([3, 2, 1])
e = S([])
self.assertEqual(s1 - s2, e)
def testSymmetricDifference1(self):
s1 = S([1, 2, 3])
s2 = S([5, 4])
e = S([1, 2, 3, 4, 5])
self.assertEqual(s1 ^ s2, e)
def testSymmetricDifference2(self):
s1 = S([1, 2, 3])
s2 = S([])
e = S([1, 2, 3])
self.assertEqual(s1 ^ s2, e)
def testSymmetricDifference3(self):
s1 = S([1, 2, 3])
s2 = S([3, 2])
e = S([1])
self.assertEqual(s1 ^ s2, e)
def testSymmetricDifference4(self):
s1 = S([1, 2, 3])
s2 = S([3, 2, 1])
e = S([])
self.assertEqual(s1 ^ s2, e)
def testSymmetricDifference5(self):
s1 = S([1, 2, 3])
s2 = S([2, 4])
s1 ^= s2
e = S([1, 3, 4])
self.assertEqual(s1, e)
def testSymmetricDifference6(self):
s1 = S([1, 2, 3])
s1 ^= s1
e = S([])
self.assertEqual(s1, e)
def testSubset1(self):
s1 = S([1, 2, 3])
s2 = S([3, 2, 1])
self.assertTrue(s1.issubset(s2))
def testSubset2(self):
s1 = S([1, 2, 3])
self.assertTrue(s1.issubset(s1))
def testSubset3(self):
s1 = S([])
s2 = S([1, 2, 3])
self.assertTrue(s1.issubset(s2))
def testSubset4(self):
s1 = S([1])
s2 = S([1, 2, 3])
self.assertTrue(s1.issubset(s2))
def testSubset5(self):
s1 = S([])
s2 = S([])
self.assertTrue(s1.issubset(s2))
def testSubset6(self):
s1 = S([1, 4])
s2 = S([1, 2, 3])
self.assertTrue(not s1.issubset(s2))
def testSuperset1(self):
s1 = S([1, 2, 3])
s2 = S([3, 2, 1])
self.assertTrue(s1.issuperset(s2))
def testSuperset2(self):
s1 = S([1, 2, 3])
self.assertTrue(s1.issuperset(s1))
def testSuperset3(self):
s1 = S([1, 2, 3])
s2 = S([])
self.assertTrue(s1.issuperset(s2))
def testSuperset4(self):
s1 = S([1, 2, 3])
s2 = S([1])
self.assertTrue(s1.issuperset(s2))
def testSuperset5(self):
s1 = S([])
s2 = S([])
self.assertTrue(s1.issuperset(s2))
def testSuperset6(self):
s1 = S([1, 2, 3])
s2 = S([1, 4])
self.assertTrue(not s1.issuperset(s2))
def testDisjoint1(self):
s1 = S([1, 2, 3])
s2 = S([4])
self.assertTrue(s1.isdisjoint(s2))
def testDisjoint2(self):
s1 = S([1, 2, 3])
s2 = S([2, 4])
self.assertTrue(not s1.isdisjoint(s2))
def testDisjoint3(self):
s1 = S([1, 2, 3])
s2 = S([])
self.assertTrue(s1.isdisjoint(s2))
def testPop(self):
original = S([1, 2, 3])
s1 = original.copy()
item = s1.pop()
self.assertTrue(len(s1) == 2)
self.assertTrue(item in original)
item = s1.pop()
self.assertTrue(len(s1) == 1)
self.assertTrue(item in original)
item = s1.pop()
self.assertTrue(len(s1) == 0)
self.assertTrue(item in original)
self.assertRaises(KeyError, lambda: s1.pop())
def testUpdate1(self):
s1 = S([1, 2, 3])
u = (4, 5, 6)
e = S([1, 2, 3, 4, 5, 6])
s1.update(u)
self.assertEqual(s1, e)
def testUpdate2(self):
s1 = S([1, 2, 3])
u = []
e = S([1, 2, 3])
s1.update(u)
self.assertEqual(s1, e)
def testGetitem(self):
s1 = S([1, 2, 3])
i0 = s1[0]
i1 = s1[1]
i2 = s1[2]
s2 = S([i0, i1, i2])
self.assertEqual(s1, s2)
def testGetslice(self):
s1 = S([1, 2, 3])
slice = s1[0:2]
self.assertEqual(len(slice), 2)
item = s1[2]
slice.append(item)
s2 = S(slice)
self.assertEqual(s1, s2)
def testDelitem(self):
s1 = S([1, 2, 3])
del s1[0]
self.assertEqual(list(s1), [2, 3])
def testDelslice(self):
s1 = S([1, 2, 3])
del s1[0:2]
self.assertEqual(list(s1), [3])
def testRemoveNonexistent(self):
s1 = S([1, 2, 3])
s2 = S([1, 2, 3])
with self.assertRaises(ValueError):
s1.remove(4)
self.assertEqual(s1, s2)
def testDiscardNonexistent(self):
s1 = S([1, 2, 3])
s2 = S([1, 2, 3])
s1.discard(4)
self.assertEqual(s1, s2)
def testCopy(self):
s1 = S([1, 2, 3])
s2 = s1.copy()
s1.remove(1)
self.assertNotEqual(s1, s2)
s1.add(1)
self.assertEqual(s1, s2)
s2 = copy.copy(s1)
self.assertEqual(s1, s2)
def testBadUpdates(self):
s = S([1, 2, 3])
self.assertRaises(ValueError, lambda: s.union_update(1))
self.assertRaises(ValueError, lambda: s.intersection_update(1))
self.assertRaises(ValueError, lambda: s.difference_update(1))
self.assertRaises(ValueError, lambda: s.symmetric_difference_update(1))
def testSelfUpdates(self):
expected = S([1, 2, 3])
s = S([1, 2, 3])
s.union_update(s)
self.assertEqual(s, expected)
s.intersection_update(s)
self.assertEqual(s, expected)
s.difference_update(s)
self.assertTrue(len(s) == 0)
def testBadSubsetSuperset(self):
s = S([1, 2, 3])
self.assertRaises(ValueError, lambda: s.issubset(123))
self.assertRaises(ValueError, lambda: s.issuperset(123))
def testBadDisjoint(self):
s = S([1, 2, 3])
self.assertRaises(ValueError, lambda: s.isdisjoint(123))
def testIncrementalOperators(self):
s = S([1, 2, 3])
s += S([5, 4])
self.assertEqual(s, S([1, 2, 3, 4, 5]))
s -= S([1, 2])
self.assertEqual(s, S([3, 4, 5]))
s |= S([1, 2])
self.assertEqual(s, S([1, 2, 3, 4, 5]))
s &= S([1, 2])
self.assertEqual(s, S([1, 2]))
if __name__ == "__main__":
unittest.main()
|
