forked from apache/cassandra-python-driver
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_sortedset.py
More file actions
251 lines (211 loc) · 7.9 KB
/
test_sortedset.py
File metadata and controls
251 lines (211 loc) · 7.9 KB
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
# Copyright 2013-2015 DataStax, Inc.
#
# Licensed 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.
try:
import unittest2 as unittest
except ImportError:
import unittest # noqa
from cassandra.util import sortedset
from cassandra.cqltypes import EMPTY
class SortedSetTest(unittest.TestCase):
def test_init(self):
input = [5, 4, 3, 2, 1, 1, 1]
expected = sorted(set(input))
ss = sortedset(input)
self.assertEqual(len(ss), len(expected))
self.assertEqual(list(ss), expected)
def test_contains(self):
input = [5, 4, 3, 2, 1, 1, 1]
expected = sorted(set(input))
ss = sortedset(input)
for i in expected:
self.assertTrue(i in ss)
self.assertFalse(i not in ss)
hi = max(expected)+1
lo = min(expected)-1
self.assertFalse(hi in ss)
self.assertFalse(lo in ss)
def test_mutable_contents(self):
ba = bytearray(b'some data here')
ss = sortedset([ba, ba])
self.assertEqual(list(ss), [ba])
def test_clear(self):
ss = sortedset([1, 2, 3])
ss.clear()
self.assertEqual(len(ss), 0)
def test_equal(self):
s1 = set([1])
s12 = set([1, 2])
ss1 = sortedset(s1)
ss12 = sortedset(s12)
self.assertEqual(ss1, s1)
self.assertEqual(ss12, s12)
self.assertNotEqual(ss1, ss12)
self.assertNotEqual(ss12, ss1)
self.assertNotEqual(ss1, s12)
self.assertNotEqual(ss12, s1)
self.assertNotEqual(ss1, EMPTY)
def test_copy(self):
class comparable(object):
def __lt__(self, other):
return id(self) < id(other)
o = comparable()
ss = sortedset([comparable(), o])
ss2 = ss.copy()
self.assertNotEqual(id(ss), id(ss2))
self.assertTrue(o in ss)
self.assertTrue(o in ss2)
def test_isdisjoint(self):
# set, ss
s12 = set([1, 2])
s2 = set([2])
ss1 = sortedset([1])
ss13 = sortedset([1, 3])
ss3 = sortedset([3])
# s ss disjoint
self.assertTrue(s2.isdisjoint(ss1))
self.assertTrue(s2.isdisjoint(ss13))
# s ss not disjoint
self.assertFalse(s12.isdisjoint(ss1))
self.assertFalse(s12.isdisjoint(ss13))
# ss s disjoint
self.assertTrue(ss1.isdisjoint(s2))
self.assertTrue(ss13.isdisjoint(s2))
# ss s not disjoint
self.assertFalse(ss1.isdisjoint(s12))
self.assertFalse(ss13.isdisjoint(s12))
# ss ss disjoint
self.assertTrue(ss1.isdisjoint(ss3))
self.assertTrue(ss3.isdisjoint(ss1))
# ss ss not disjoint
self.assertFalse(ss1.isdisjoint(ss13))
self.assertFalse(ss13.isdisjoint(ss1))
self.assertFalse(ss3.isdisjoint(ss13))
self.assertFalse(ss13.isdisjoint(ss3))
def test_issubset(self):
s12 = set([1, 2])
ss1 = sortedset([1])
ss13 = sortedset([1, 3])
ss3 = sortedset([3])
self.assertTrue(ss1.issubset(s12))
self.assertTrue(ss1.issubset(ss13))
self.assertFalse(ss1.issubset(ss3))
self.assertFalse(ss13.issubset(ss3))
self.assertFalse(ss13.issubset(ss1))
self.assertFalse(ss13.issubset(s12))
def test_issuperset(self):
s12 = set([1, 2])
ss1 = sortedset([1])
ss13 = sortedset([1, 3])
ss3 = sortedset([3])
self.assertTrue(s12.issuperset(ss1))
self.assertTrue(ss13.issuperset(ss3))
self.assertTrue(ss13.issuperset(ss13))
self.assertFalse(s12.issuperset(ss13))
self.assertFalse(ss1.issuperset(ss3))
self.assertFalse(ss1.issuperset(ss13))
def test_union(self):
s1 = set([1])
ss12 = sortedset([1, 2])
ss23 = sortedset([2, 3])
self.assertEqual(sortedset().union(s1), sortedset([1]))
self.assertEqual(ss12.union(s1), sortedset([1, 2]))
self.assertEqual(ss12.union(ss23), sortedset([1, 2, 3]))
self.assertEqual(ss23.union(ss12), sortedset([1, 2, 3]))
self.assertEqual(ss23.union(s1), sortedset([1, 2, 3]))
def test_intersection(self):
s12 = set([1, 2])
ss23 = sortedset([2, 3])
self.assertEqual(s12.intersection(ss23), set([2]))
self.assertEqual(ss23.intersection(s12), sortedset([2]))
self.assertEqual(ss23.intersection(s12, [2], (2,)), sortedset([2]))
self.assertEqual(ss23.intersection(s12, [900], (2,)), sortedset())
def test_difference(self):
s1 = set([1])
ss12 = sortedset([1, 2])
ss23 = sortedset([2, 3])
self.assertEqual(sortedset().difference(s1), sortedset())
self.assertEqual(ss12.difference(s1), sortedset([2]))
self.assertEqual(ss12.difference(ss23), sortedset([1]))
self.assertEqual(ss23.difference(ss12), sortedset([3]))
self.assertEqual(ss23.difference(s1), sortedset([2, 3]))
def test_symmetric_difference(self):
s = set([1, 3, 5])
ss = sortedset([2, 3, 4])
ss2 = sortedset([5, 6, 7])
self.assertEqual(ss.symmetric_difference(s), sortedset([1, 2, 4, 5]))
self.assertFalse(ss.symmetric_difference(ss))
self.assertEqual(ss.symmetric_difference(s), sortedset([1, 2, 4, 5]))
self.assertEqual(ss2.symmetric_difference(ss), sortedset([2, 3, 4, 5, 6, 7]))
def test_pop(self):
ss = sortedset([2, 1])
self.assertEqual(ss.pop(), 2)
self.assertEqual(ss.pop(), 1)
try:
ss.pop()
self.fail("Error not thrown")
except (KeyError, IndexError) as e:
pass
def test_remove(self):
ss = sortedset([2, 1])
self.assertEqual(len(ss), 2)
self.assertRaises(KeyError, ss.remove, 3)
self.assertEqual(len(ss), 2)
ss.remove(1)
self.assertEqual(len(ss), 1)
ss.remove(2)
self.assertFalse(ss)
self.assertRaises(KeyError, ss.remove, 2)
self.assertFalse(ss)
def test_operators(self):
ss1 = sortedset([1])
ss12 = sortedset([1, 2])
# __ne__
self.assertFalse(ss12 != ss12)
self.assertFalse(ss12 != sortedset([1, 2]))
self.assertTrue(ss12 != sortedset())
# __le__
self.assertTrue(ss1 <= ss12)
self.assertTrue(ss12 <= ss12)
self.assertFalse(ss12 <= ss1)
# __lt__
self.assertTrue(ss1 < ss12)
self.assertFalse(ss12 < ss12)
self.assertFalse(ss12 < ss1)
# __ge__
self.assertFalse(ss1 >= ss12)
self.assertTrue(ss12 >= ss12)
self.assertTrue(ss12 >= ss1)
# __gt__
self.assertFalse(ss1 > ss12)
self.assertFalse(ss12 > ss12)
self.assertTrue(ss12 > ss1)
# __and__
self.assertEqual(ss1 & ss12, ss1)
self.assertEqual(ss12 & ss12, ss12)
self.assertEqual(ss12 & set(), sortedset())
# __or__
self.assertEqual(ss1 | ss12, ss12)
self.assertEqual(ss12 | ss12, ss12)
self.assertEqual(ss12 | set(), ss12)
self.assertEqual(sortedset() | ss1 | ss12, ss12)
# __sub__
self.assertEqual(ss1 - ss12, set())
self.assertEqual(ss12 - ss12, set())
self.assertEqual(ss12 - set(), ss12)
self.assertEqual(ss12 - ss1, sortedset([2]))
# __xor__
self.assertEqual(ss1 ^ ss12, set([2]))
self.assertEqual(ss12 ^ ss1, set([2]))
self.assertEqual(ss12 ^ ss12, set())
self.assertEqual(ss12 ^ set(), ss12)