-
Notifications
You must be signed in to change notification settings - Fork 51
/
test_cycler.py
354 lines (271 loc) · 9.58 KB
/
test_cycler.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
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
from collections import defaultdict
from operator import add, iadd, mul, imul
from itertools import product, cycle, chain
import pytest # type: ignore
from cycler import cycler, Cycler, concat
def _cycler_helper(c, length, keys, values):
assert len(c) == length
assert len(c) == len(list(c))
assert c.keys == set(keys)
for k, vals in zip(keys, values):
for v, v_target in zip(c, vals):
assert v[k] == v_target
def _cycles_equal(c1, c2):
assert list(c1) == list(c2)
assert c1 == c2
@pytest.mark.parametrize('c', [cycler(c='rgb'),
cycler(c=list('rgb')),
cycler(cycler(c='rgb'))],
ids=['from string',
'from list',
'from cycler'])
def test_creation(c):
_cycler_helper(c, 3, ['c'], [['r', 'g', 'b']])
def test_add():
c1 = cycler(c='rgb')
c2 = cycler(lw=range(3))
# addition
_cycler_helper(c1 + c2, 3, ['c', 'lw'], [list('rgb'), range(3)])
_cycler_helper(c2 + c1, 3, ['c', 'lw'], [list('rgb'), range(3)])
_cycles_equal(c2 + c1, c1 + c2)
def test_add_len_mismatch():
# miss-matched add lengths
c1 = cycler(c='rgb')
c3 = cycler(lw=range(15))
with pytest.raises(ValueError):
c1 + c3
with pytest.raises(ValueError):
c3 + c1
def test_prod():
c1 = cycler(c='rgb')
c2 = cycler(lw=range(3))
c3 = cycler(lw=range(15))
# multiplication
target = zip(*product(list('rgb'), range(3)))
_cycler_helper(c1 * c2, 9, ['c', 'lw'], target)
target = zip(*product(range(3), list('rgb')))
_cycler_helper(c2 * c1, 9, ['lw', 'c'], target)
target = zip(*product(range(15), list('rgb')))
_cycler_helper(c3 * c1, 45, ['lw', 'c'], target)
def test_inplace():
c1 = cycler(c='rgb')
c2 = cycler(lw=range(3))
c2 += c1
_cycler_helper(c2, 3, ['c', 'lw'], [list('rgb'), range(3)])
c3 = cycler(c='rgb')
c4 = cycler(lw=range(3))
c3 *= c4
target = zip(*product(list('rgb'), range(3)))
_cycler_helper(c3, 9, ['c', 'lw'], target)
def test_constructor():
c1 = cycler(c='rgb')
c2 = cycler(ec=c1)
_cycler_helper(c1 + c2, 3, ['c', 'ec'], [['r', 'g', 'b']] * 2)
c3 = cycler(c=c1)
_cycler_helper(c3 + c2, 3, ['c', 'ec'], [['r', 'g', 'b']] * 2)
# Using a non-string hashable
c4 = cycler(1, range(3))
_cycler_helper(c4 + c1, 3, [1, 'c'], [range(3), ['r', 'g', 'b']])
# addition using cycler()
_cycler_helper(cycler(c='rgb', lw=range(3)),
3, ['c', 'lw'], [list('rgb'), range(3)])
_cycler_helper(cycler(lw=range(3), c='rgb'),
3, ['c', 'lw'], [list('rgb'), range(3)])
# Purposely mixing them
_cycler_helper(cycler(c=range(3), lw=c1),
3, ['c', 'lw'], [range(3), list('rgb')])
def test_failures():
c1 = cycler(c='rgb')
c2 = cycler(c=c1)
pytest.raises(ValueError, add, c1, c2)
pytest.raises(ValueError, iadd, c1, c2)
pytest.raises(ValueError, mul, c1, c2)
pytest.raises(ValueError, imul, c1, c2)
pytest.raises(TypeError, iadd, c2, 'aardvark')
pytest.raises(TypeError, imul, c2, 'aardvark')
c3 = cycler(ec=c1)
pytest.raises(ValueError, cycler, c=c2 + c3)
def test_simplify():
c1 = cycler(c='rgb')
c2 = cycler(ec=c1)
for c in [c1 * c2, c2 * c1, c1 + c2]:
_cycles_equal(c, c.simplify())
def test_multiply():
c1 = cycler(c='rgb')
_cycler_helper(2 * c1, 6, ['c'], ['rgb' * 2])
c2 = cycler(ec=c1)
c3 = c1 * c2
_cycles_equal(2 * c3, c3 * 2)
def test_mul_fails():
c1 = cycler(c='rgb')
pytest.raises(TypeError, mul, c1, 2.0)
pytest.raises(TypeError, mul, c1, 'a')
pytest.raises(TypeError, mul, c1, [])
def test_getitem():
c1 = cycler(3, range(15))
widths = list(range(15))
for slc in (slice(None, None, None),
slice(None, None, -1),
slice(1, 5, None),
slice(0, 5, 2)):
_cycles_equal(c1[slc], cycler(3, widths[slc]))
def test_fail_getime():
c1 = cycler(lw=range(15))
pytest.raises(ValueError, Cycler.__getitem__, c1, 0)
pytest.raises(ValueError, Cycler.__getitem__, c1, [0, 1])
def test_repr():
c = cycler(c='rgb')
# Using an identifier that would be not valid as a kwarg
c2 = cycler('3rd', range(3))
assert repr(c + c2) == (
"(cycler('c', ['r', 'g', 'b']) + cycler('3rd', [0, 1, 2]))")
assert repr(c * c2) == (
"(cycler('c', ['r', 'g', 'b']) * cycler('3rd', [0, 1, 2]))")
assert (c + c2)._repr_html_() == (
"<table>"
"<th>'3rd'</th><th>'c'</th>"
"<tr><td>0</td><td>'r'</td></tr>"
"<tr><td>1</td><td>'g'</td></tr>"
"<tr><td>2</td><td>'b'</td></tr>"
"</table>")
assert (c * c2)._repr_html_() == (
"<table>"
"<th>'3rd'</th><th>'c'</th>"
"<tr><td>0</td><td>'r'</td></tr>"
"<tr><td>1</td><td>'r'</td></tr>"
"<tr><td>2</td><td>'r'</td></tr>"
"<tr><td>0</td><td>'g'</td></tr>"
"<tr><td>1</td><td>'g'</td></tr>"
"<tr><td>2</td><td>'g'</td></tr>"
"<tr><td>0</td><td>'b'</td></tr>"
"<tr><td>1</td><td>'b'</td></tr>"
"<tr><td>2</td><td>'b'</td></tr>"
"</table>")
def test_call():
c = cycler(c='rgb')
c_cycle = c()
assert isinstance(c_cycle, cycle)
j = 0
for a, b in zip(2 * c, c_cycle):
j += 1
assert a == b
assert j == len(c) * 2
def test_copying():
# Just about everything results in copying the cycler and
# its contents (shallow). This set of tests is intended to make sure
# of that. Our iterables will be mutable for extra fun!
i1 = [1, 2, 3]
i2 = ['r', 'g', 'b']
# For more mutation fun!
i3 = [['y', 'g'], ['b', 'k']]
c1 = cycler('c', i1)
c2 = cycler('lw', i2)
c3 = cycler('foo', i3)
c_before = (c1 + c2) * c3
i1.pop()
i2.append('cyan')
i3[0].append('blue')
c_after = (c1 + c2) * c3
assert c1 == cycler('c', [1, 2, 3])
assert c2 == cycler('lw', ['r', 'g', 'b'])
assert c3 == cycler('foo', [['y', 'g', 'blue'], ['b', 'k']])
assert c_before == (cycler(c=[1, 2, 3], lw=['r', 'g', 'b']) *
cycler('foo', [['y', 'g', 'blue'], ['b', 'k']]))
assert c_after == (cycler(c=[1, 2, 3], lw=['r', 'g', 'b']) *
cycler('foo', [['y', 'g', 'blue'], ['b', 'k']]))
# Make sure that changing the key for a specific cycler
# doesn't break things for a composed cycler
c = (c1 + c2) * c3
c4 = cycler('bar', c3)
assert c == (cycler(c=[1, 2, 3], lw=['r', 'g', 'b']) *
cycler('foo', [['y', 'g', 'blue'], ['b', 'k']]))
assert c3 == cycler('foo', [['y', 'g', 'blue'], ['b', 'k']])
assert c4 == cycler('bar', [['y', 'g', 'blue'], ['b', 'k']])
def test_keychange():
c1 = cycler('c', 'rgb')
c2 = cycler('lw', [1, 2, 3])
c3 = cycler('ec', 'yk')
c3.change_key('ec', 'edgecolor')
assert c3 == cycler('edgecolor', c3)
c = c1 + c2
c.change_key('lw', 'linewidth')
# Changing a key in one cycler should have no
# impact in the original cycler.
assert c2 == cycler('lw', [1, 2, 3])
assert c == c1 + cycler('linewidth', c2)
c = (c1 + c2) * c3
c.change_key('c', 'color')
assert c1 == cycler('c', 'rgb')
assert c == (cycler('color', c1) + c2) * c3
# Perfectly fine, it is a no-op
c.change_key('color', 'color')
assert c == (cycler('color', c1) + c2) * c3
# Can't change a key to one that is already in there
pytest.raises(ValueError, Cycler.change_key, c, 'color', 'lw')
# Can't change a key you don't have
pytest.raises(KeyError, Cycler.change_key, c, 'c', 'foobar')
def test_eq():
a = cycler(c='rgb')
b = cycler(c='rgb')
assert a == b
assert a != b[::-1]
c = cycler(lw=range(3))
assert a + c == c + a
assert a + c == c + b
assert a * c != c * a
assert a != c
d = cycler(c='ymk')
assert b != d
e = cycler(c='orange')
assert b != e
def test_cycler_exceptions():
pytest.raises(TypeError, cycler)
pytest.raises(TypeError, cycler, 'c', 'rgb', lw=range(3))
pytest.raises(TypeError, cycler, 'c')
pytest.raises(TypeError, cycler, 'c', 'rgb', 'lw', range(3))
def test_strange_init():
c = cycler('r', 'rgb')
c2 = cycler('lw', range(3))
cy = Cycler(list(c), c2, zip)
assert cy == c + c2
def test_concat():
a = cycler('a', range(3))
b = cycler('a', 'abc')
for con, chn in zip(a.concat(b), chain(a, b)):
assert con == chn
for con, chn in zip(concat(a, b), chain(a, b)):
assert con == chn
def test_concat_fail():
a = cycler('a', range(3))
b = cycler('b', range(3))
pytest.raises(ValueError, concat, a, b)
pytest.raises(ValueError, a.concat, b)
def _by_key_helper(cy):
res = cy.by_key()
target = defaultdict(list)
for sty in cy:
for k, v in sty.items():
target[k].append(v)
assert res == target
def test_by_key_add():
input_dict = dict(c=list('rgb'), lw=[1, 2, 3])
cy = cycler(c=input_dict['c']) + cycler(lw=input_dict['lw'])
res = cy.by_key()
assert res == input_dict
_by_key_helper(cy)
def test_by_key_mul():
input_dict = dict(c=list('rg'), lw=[1, 2, 3])
cy = cycler(c=input_dict['c']) * cycler(lw=input_dict['lw'])
res = cy.by_key()
assert input_dict['lw'] * len(input_dict['c']) == res['lw']
_by_key_helper(cy)
def test_contains():
a = cycler('a', range(3))
b = cycler('b', range(3))
assert 'a' in a
assert 'b' in b
assert 'a' not in b
assert 'b' not in a
ab = a + b
assert 'a' in ab
assert 'b' in ab