♻️ refactor + linter comments
This commit is contained in:
parent
6231dc2e4e
commit
da2121060e
|
@ -71,9 +71,8 @@ def valid_cases():
|
||||||
|
|
||||||
modes = [RandomizationMode.mode_random, RandomizationMode.mode_zero, RandomizationMode.mode_max]
|
modes = [RandomizationMode.mode_random, RandomizationMode.mode_zero, RandomizationMode.mode_max]
|
||||||
if len(offsets) != 0:
|
if len(offsets) != 0:
|
||||||
modes.extend([RandomizationMode.mode_nil_count,
|
modes = list(RandomizationMode)
|
||||||
RandomizationMode.mode_one_count,
|
|
||||||
RandomizationMode.mode_max_count])
|
|
||||||
for mode in modes:
|
for mode in modes:
|
||||||
for variation in range(3):
|
for variation in range(3):
|
||||||
yield f'{name}_{mode.to_name()}_chaos_{variation}', \
|
yield f'{name}_{mode.to_name()}_chaos_{variation}', \
|
||||||
|
@ -86,11 +85,7 @@ def valid_cases():
|
||||||
# Notes: ``RandomizationMode.mode_zero`` and ``RandomizationMode.mode_max`` are
|
# Notes: ``RandomizationMode.mode_zero`` and ``RandomizationMode.mode_max`` are
|
||||||
# pseudo-random modes for containers that contains List of Bitlist
|
# pseudo-random modes for containers that contains List of Bitlist
|
||||||
# (because the length of List and Bitlist are randoms).
|
# (because the length of List and Bitlist are randoms).
|
||||||
modes.extend([RandomizationMode.mode_nil_count,
|
modes = list(RandomizationMode)
|
||||||
RandomizationMode.mode_one_count,
|
|
||||||
RandomizationMode.mode_max_count,
|
|
||||||
RandomizationMode.mode_zero,
|
|
||||||
RandomizationMode.mode_max])
|
|
||||||
for mode in modes:
|
for mode in modes:
|
||||||
for variation in range(10):
|
for variation in range(10):
|
||||||
yield f'{name}_{mode.to_name()}_{variation}', \
|
yield f'{name}_{mode.to_name()}_{variation}', \
|
||||||
|
|
|
@ -23,10 +23,10 @@ def valid_cases():
|
||||||
yield f'uint_{byte_len * 8}_last_byte_empty', \
|
yield f'uint_{byte_len * 8}_last_byte_empty', \
|
||||||
valid_test_case(lambda: uint_type((2 ** ((byte_len - 1) * 8)) - 1))
|
valid_test_case(lambda: uint_type((2 ** ((byte_len - 1) * 8)) - 1))
|
||||||
for variation in range(5):
|
for variation in range(5):
|
||||||
yield f'uint_{byte_len * 8}_{mode.to_name()}_{variation}',\
|
yield f'uint_{byte_len * 8}_{mode.to_name()}_{variation}', \
|
||||||
valid_test_case(lambda: uint_case_fn(rng, mode, uint_type))
|
valid_test_case(lambda: uint_case_fn(rng, mode, uint_type))
|
||||||
for mode in [RandomizationMode.mode_zero, RandomizationMode.mode_max]:
|
for mode in [RandomizationMode.mode_zero, RandomizationMode.mode_max]:
|
||||||
yield f'uint_{byte_len * 8}_{mode.to_name()}',\
|
yield f'uint_{byte_len * 8}_{mode.to_name()}', \
|
||||||
valid_test_case(lambda: uint_case_fn(rng, mode, uint_type))
|
valid_test_case(lambda: uint_case_fn(rng, mode, uint_type))
|
||||||
|
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue