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
|
# This file is part of Hypothesis, which may be found at
# https://github.com/HypothesisWorks/hypothesis/
#
# Copyright the Hypothesis Authors.
# Individual contributors are listed in AUTHORS.rst and the git log.
#
# This Source Code Form is subject to the terms of the Mozilla Public License,
# v. 2.0. If a copy of the MPL was not distributed with this file, You can
# obtain one at https://mozilla.org/MPL/2.0/.
from collections import OrderedDict
from random import Random
import pytest
from hypothesis import given, settings
from hypothesis.strategies import (
booleans,
dictionaries,
fixed_dictionaries,
frozensets,
integers,
lists,
none,
nothing,
sets,
text,
tuples,
)
from tests.common.debug import assert_simple_property, find_any, minimal
from tests.common.utils import flaky
@pytest.mark.parametrize(
("col", "strat"),
[
((), tuples()),
([], lists(none(), max_size=0)),
(set(), sets(none(), max_size=0)),
(frozenset(), frozensets(none(), max_size=0)),
({}, fixed_dictionaries({})),
({}, fixed_dictionaries({}, optional={})),
(OrderedDict(), fixed_dictionaries(OrderedDict(), optional=OrderedDict())),
({}, fixed_dictionaries({}, optional={1: booleans()})),
({0: False}, fixed_dictionaries({0: booleans()}, optional={1: booleans()})),
({}, fixed_dictionaries({}, optional={(): booleans(), 0: booleans()})),
([], lists(nothing())),
([], lists(nothing(), unique=True)),
],
)
def test_find_empty_collection_gives_empty(col, strat):
assert minimal(strat) == col
@pytest.mark.parametrize(
("coltype", "strat"), [(list, lists), (set, sets), (frozenset, frozensets)]
)
def test_find_non_empty_collection_gives_single_zero(coltype, strat):
assert minimal(strat(integers()), bool) == coltype((0,))
@pytest.mark.parametrize(
("coltype", "strat"), [(list, lists), (set, sets), (frozenset, frozensets)]
)
def test_minimizes_to_empty(coltype, strat):
assert minimal(strat(integers())) == coltype()
def test_minimizes_list_of_lists():
xs = minimal(lists(lists(booleans())), lambda x: any(x) and not all(x))
xs.sort()
assert xs == [[], [False]]
@given(sets(integers(0, 100), min_size=2, max_size=10))
@settings(max_examples=100)
def test_sets_are_size_bounded(xs):
assert 2 <= len(xs) <= 10
def test_ordered_dictionaries_preserve_keys():
r = Random()
keys = list(range(100))
r.shuffle(keys)
assert_simple_property(
fixed_dictionaries(OrderedDict([(k, booleans()) for k in keys])),
lambda x: list(x.keys()) == keys,
)
@given(fixed_dictionaries({}, optional={0: booleans(), 1: nothing(), 2: booleans()}))
def test_fixed_dictionaries_with_optional_and_empty_keys(d):
assert 1 not in d
@pytest.mark.parametrize("n", range(10))
def test_lists_of_fixed_length(n):
assert minimal(lists(integers(), min_size=n, max_size=n)) == [0] * n
@pytest.mark.parametrize("n", range(10))
def test_sets_of_fixed_length(n):
x = minimal(sets(integers(), min_size=n, max_size=n))
assert len(x) == n
if n == 0:
assert x == set()
else:
assert x == set(range(min(x), min(x) + n))
@pytest.mark.parametrize("n", range(10))
def test_dictionaries_of_fixed_length(n):
x = set(minimal(dictionaries(integers(), booleans(), min_size=n, max_size=n)))
if not n:
assert x == set()
else:
assert x == set(range(min(x), min(x) + n))
@pytest.mark.parametrize("n", range(10))
def test_lists_of_lower_bounded_length(n):
l = minimal(lists(integers(), min_size=n), lambda x: sum(x) >= 2 * n)
assert l == [] if n == 0 else [0] * (n - 1) + [n * 2]
@flaky(min_passes=1, max_runs=3)
def test_can_find_unique_lists_of_non_set_order():
# This test checks that our strategy for unique lists doesn't accidentally
# depend on the iteration order of sets.
#
# Unfortunately, that means that *this* test has to rely on set iteration
# order. That makes it tricky to debug on CPython, because set iteration
# order changes every time the process is launched.
#
# To get around this, define the PYTHONHASHSEED environment variable to
# a consistent value. This could be 0, or it could be the PYTHONHASHSEED
# value listed in a failure log from CI.
ls = minimal(
lists(text(), min_size=2, unique=True),
lambda x: list(set(reversed(x))) != x, # noqa: C414 # yes, reverse inside set
)
assert len(set(ls)) == len(ls)
assert len(ls) == 2
def test_can_draw_empty_list_from_unsatisfiable_strategy():
assert find_any(lists(integers().filter(lambda s: False))) == []
def test_can_draw_empty_set_from_unsatisfiable_strategy():
assert find_any(sets(integers().filter(lambda s: False))) == set()
@given(lists(sets(none()), min_size=10))
def test_small_sized_sets(x):
pass
def test_minimize_dicts_with_incompatible_keys():
strat = fixed_dictionaries({1: booleans(), "hi": lists(booleans())})
assert minimal(strat) == {1: False, "hi": []}
@given(
lists(
tuples(integers(), integers()),
min_size=2,
unique_by=(lambda x: x[0], lambda x: x[1]),
)
)
def test_lists_unique_by_tuple_funcs(ls):
firstitems, seconditems = zip(*ls)
assert len(set(firstitems)) == len(firstitems)
assert len(set(seconditems)) == len(seconditems)
|
