-
Notifications
You must be signed in to change notification settings - Fork 208
/
Copy pathtest_stress_sortedkeylist.py
325 lines (245 loc) · 6.2 KB
/
test_stress_sortedkeylist.py
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
import bisect
import random
from sortedcontainers import SortedKeyList
from functools import wraps
random.seed(0)
actions = []
def frange(start, stop, step):
while start < stop:
yield start
start += step
class actor:
def __init__(self, count):
self._count = count
def __call__(self, func):
actions.extend([func] * self._count)
return func
def not_empty(func):
@wraps(func)
def wrapper(slt):
if len(slt) < 100:
stress_update(slt)
func(slt)
return wrapper
@actor(1)
def stress_clear(slt):
if random.randrange(100) < 10:
slt.clear()
else:
values = list(slt)
slt.clear()
slt.update(values[: int(len(values) / 2)])
@actor(1)
def stress_add(slt):
if random.randrange(100) < 10:
slt.clear()
slt.add(random.random())
@actor(1)
def stress_update(slt):
slt.update(random.random() for rpt in range(350))
@actor(1)
@not_empty
def stress_contains(slt):
if random.randrange(100) < 10:
slt.clear()
assert 0 not in slt
else:
val = slt[random.randrange(len(slt))]
assert val in slt
assert 1 not in slt
@actor(1)
@not_empty
def stress_discard(slt):
val = slt[random.randrange(len(slt))]
slt.discard(val)
@actor(1)
def stress_discard2(slt):
if random.randrange(100) < 10:
slt.clear()
slt.discard(random.random())
@actor(1)
def stress_remove(slt):
if len(slt) > 0:
val = slt[random.randrange(len(slt))]
slt.remove(val)
try:
slt.remove(1)
assert False
except ValueError:
pass
try:
slt.remove(-1)
assert False
except ValueError:
pass
@actor(1)
@not_empty
def stress_delitem(slt):
del slt[random.randrange(len(slt))]
@actor(1)
def stress_getitem(slt):
if len(slt) > 0:
pos = random.randrange(len(slt))
assert slt[pos] == list(slt)[pos]
try:
slt[-(slt._len + 5)]
assert False
except IndexError:
pass
try:
slt[slt._len + 5]
assert False
except IndexError:
pass
else:
try:
slt[0]
assert False
except IndexError:
pass
@actor(1)
@not_empty
def stress_delitem_slice(slt):
start, stop = sorted(random.randrange(len(slt)) for rpt in range(2))
step = random.choice([-3, -2, -1, 1, 1, 1, 1, 1, 2, 3])
del slt[start:stop:step]
@actor(1)
def stress_iter(slt):
itr1 = iter(slt)
itr2 = (slt[pos] for pos in range(len(slt)))
assert all(tup[0] == tup[1] for tup in zip(itr1, itr2))
@actor(1)
def stress_reversed(slt):
itr = reversed(list(reversed(slt)))
assert all(tup[0] == tup[1] for tup in zip(slt, itr))
@actor(1)
def stress_bisect_left(slt):
values = list(slt)
value = random.random()
values.sort()
assert bisect.bisect_left(values, value) == slt.bisect_left(value)
@actor(1)
def stress_bisect(slt):
values = list(slt)
value = random.random()
values.sort()
assert bisect.bisect(values, value) == slt.bisect(value)
@actor(1)
def stress_bisect_right(slt):
values = list(slt)
value = random.random()
values.sort()
assert bisect.bisect_right(values, value) == slt.bisect_right(value)
@actor(1)
@not_empty
def stress_dups(slt):
pos = min(random.randrange(len(slt)), 300)
val = slt[pos]
for rpt in range(pos):
slt.add(val)
@actor(1)
@not_empty
def stress_count(slt):
values = list(slt)
val = slt[random.randrange(len(slt))]
assert slt.count(val) == values.count(val)
@actor(1)
@not_empty
def stress_pop(slt):
pos = random.randrange(len(slt)) + 1
assert slt[-pos] == slt.pop(-pos)
@actor(1)
@not_empty
def stress_index(slt):
values = set(slt)
slt.clear()
slt.update(values)
pos = random.randrange(len(slt))
assert slt.index(slt[pos]) == pos
@actor(1)
@not_empty
def stress_index2(slt):
values = list(slt)[:3] * 200
slt = SortedKeyList(values)
for idx, val in enumerate(slt):
assert slt.index(val, idx) == idx
@actor(1)
def stress_mul(slt):
values = list(slt)
mult = random.randrange(10)
values *= mult
values.sort()
assert (slt * mult) == values
@actor(1)
def stress_imul(slt):
mult = random.randrange(10)
slt *= mult
@actor(1)
@not_empty
def stress_reversed(slt):
itr = reversed(slt)
pos = random.randrange(1, len(slt))
for rpt in range(pos):
val = next(itr)
assert val == slt[-pos]
@actor(1)
@not_empty
def stress_eq(slt):
values = []
assert not (values == slt)
@actor(1)
@not_empty
def stress_lt(slt):
values = list(slt)
assert not (values < slt)
values = SortedKeyList(value - 1 for value in values)
assert values < slt
values = []
assert values < slt
assert not (slt < values)
def test_stress(repeat=1000):
slt = SortedKeyList(random.random() for rpt in range(1000))
for rpt in range(repeat):
action = random.choice(actions)
action(slt)
slt._check()
while len(slt) > 2000:
# Shorten the sortedlist. This maintains the "jaggedness"
# of the sublists which helps coverage.
pos = random.randrange(len(slt._maxes))
del slt._maxes[pos]
del slt._keys[pos]
del slt._lists[pos]
slt._len = sum(len(sublist) for sublist in slt._lists)
slt._index = []
slt._check()
slt._check()
stress_update(slt)
while len(slt) > 0:
pos = random.randrange(len(slt))
del slt[pos]
slt._check()
if __name__ == '__main__':
import sys
from datetime import datetime
start = datetime.now()
print('Python', sys.version_info)
try:
num = int(sys.argv[1])
print('Setting iterations to', num)
except:
print('Setting iterations to 1000 (default)')
num = 1000
try:
pea = int(sys.argv[2])
random.seed(pea)
print('Setting seed to', pea)
except:
print('Setting seed to 0 (default)')
random.seed(0)
try:
test_stress(num)
except:
raise
finally:
print('Exiting after', (datetime.now() - start))