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
|
from pytest import raises
from boltons.setutils import IndexedSet, _MISSING, complement
def test_indexed_set_basic():
zero2nine = IndexedSet(range(10))
five2nine = zero2nine & IndexedSet(range(5, 15))
x = IndexedSet(five2nine)
x |= {10}
assert list(zero2nine) == [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
assert set(zero2nine) == {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
assert list(five2nine) == [5, 6, 7, 8, 9]
assert x == IndexedSet([5, 6, 7, 8, 9, 10])
assert x[-1] == 10
assert zero2nine ^ five2nine == IndexedSet([0, 1, 2, 3, 4])
assert x[:3] == IndexedSet([5, 6, 7])
assert x[2:4:-1] == IndexedSet([8, 7])
def test_indexed_set_rsub():
"From #252"
assert (set('abc') - IndexedSet('bcd')) == {'a'}
assert (IndexedSet('abc') - IndexedSet('bcd')) == IndexedSet(['a'])
assert (frozenset('abc') - IndexedSet('bcd')) == frozenset(['a'])
def test_indexed_set_mutate():
thou = IndexedSet(range(1000))
assert (thou.pop(), thou.pop()) == (999, 998)
assert (thou.pop(499), thou.pop(499)) == (499, 500)
ref = [495, 496, 497, 498, 501, 502, 503, 504, 505, 506]
assert [thou[i] for i in range(495, 505)] == ref
assert len(thou) == 996
while len(thou) > 600:
dead_idx_len = len(thou.dead_indices)
dead_idx_count = thou._dead_index_count
thou.pop(0)
new_dead_idx_len = len(thou.dead_indices)
if new_dead_idx_len < dead_idx_len:
assert dead_idx_count > 0
# 124, 109, 95
assert len(thou) == 600
assert thou._dead_index_count == 67
assert not any([thou[i] is _MISSING for i in range(len(thou))])
thou &= IndexedSet(range(500, 503))
assert thou == IndexedSet([501, 502])
return
def big_popper():
# more of a benchmark than a test
from os import urandom
import time
big_set = IndexedSet(range(100000))
rands = [ord(r) for r in urandom(len(big_set))]
start_time, start_size = time.time(), len(big_set)
while len(big_set) > 10000:
if len(big_set) % 10000 == 0:
print(len(big_set) / 10000)
rand = rands.pop()
big_set.pop(rand)
big_set.pop(-rand)
end_time, end_size = time.time(), len(big_set)
print()
print('popped {} items in {} seconds'.format(start_size - end_size,
end_time - start_time))
def test_complement_set():
'''exercises a bunch of code-paths but doesn't really confirm math identities'''
assert complement(complement(set())) == set()
sab = set('ab')
sbc = set('bc')
cab = complement('ab')
cbc = complement('bc')
cc = complement('c')
sc = set('c')
u = complement(set())
assert repr(sab) in repr(cab)
# non-mutating tests
assert cab != cbc
assert complement(cab) == sab
assert complement(cbc) == sbc
assert 'a' not in cab
assert 'c' in cab
assert (sab & cbc) == (sab - sbc) # set theory invariant
assert not (cab < sab) # complement never subset of set
assert not (sab < cab)
assert not (cbc < sab)
assert not (cbc < cab) # not subsets of each other
assert sab < cc
assert cab < (cab | cbc)
assert (cab | cbc) > cab
assert cc > sab
assert not (cab > sab)
assert not cab.isdisjoint(cc) # complements never disjoint
assert cab.isdisjoint(sab)
assert not cab.isdisjoint(sc)
assert (cab | sab) == u
assert (cab | cc) == u
assert (cab | cbc) == complement('b')
assert (sab | cab) == (cbc | sbc)
assert (sab & cab) == (cbc & sbc)
assert (sab ^ cab) == (cbc ^ sbc)
assert cab - cc == sc
assert cab - sab == cab
assert sab - cab == sab
assert (cab ^ cbc | set('b')) == (sab | sbc)
everything = complement(frozenset())
assert everything in everything # https://en.wikipedia.org/wiki/Russell%27s_paradox
assert bool(cab)
assert not complement(u)
# destructive testing
cab ^= sab
cab ^= sab
cab &= sab
cab &= cbc
cab |= sab
cab |= cbc
cab -= sab
cab.add(5)
cab.remove(5)
cab.update(sab)
cab.discard(sab)
cab.update(cbc)
cab.add(complement(frozenset())) # frozen complement can be a member of complement set
assert len({complement(frozenset()): 1, complement(frozenset()): 2}) == 1 # hash works
with raises(NotImplementedError): cab.pop()
with raises(NotImplementedError): len(cab)
with raises(NotImplementedError): iter(cab)
~cab
cab.complement()
cab.complemented()
class OpOverloader:
# tests that operators properly return NotImplemented so they will defer to
# another class implementation if available
def __and__(self, other): return self
__rand__ = __iand__ = __or__ = __ror__ = __ior__ = __xor__ = __rxor__ = __sub__ = __isub__ = __and__
def __le__(self, other): return True
__lt__ = __ge__ = __gt__ = __le__
ops = OpOverloader()
def opsmash(a, b):
a &= b; a |= b; a -= b; a ^= b
a > b; a >= b; a < b; a <= b
return (((a & b) | b) - b) ^ b
with raises(TypeError): opsmash(cab, object())
assert opsmash(ops, cab) == ops
assert opsmash(cab, ops) == ops
def test_iset_index_method():
original_list = list(range(8, 20)) + list(range(8))
indexed_list = IndexedSet()
for i in original_list:
indexed_list.add(i)
for i in original_list:
index = indexed_list.index(i)
# if we're removing them in order, the target value should always be at index 0
assert index == 0
indexed_list.pop(index)
indexed_list = IndexedSet(range(10))
for i in reversed(range(10)):
if i % 2:
continue
index = indexed_list.index(i)
assert i == indexed_list.pop(index)
indexed_list = IndexedSet(range(32))
for i in list(indexed_list):
if i % 3:
index = indexed_list.index(i)
assert i == indexed_list.pop(index)
indexed_list = IndexedSet(range(10))
for i in range(10):
if i < 3:
continue
index = indexed_list.index(i)
assert i == indexed_list.pop(index)
indexed_list = IndexedSet(range(32))
for i in list(indexed_list):
if i % 3:
index = indexed_list.index(i)
assert i == indexed_list.pop(index)
|
