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
|
# 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/.
import pytest
from hypothesis import given, strategies as st
from hypothesis.errors import InvalidArgument
from tests.common.debug import find_any, minimal
@given(st.recursive(st.booleans(), st.lists, max_leaves=10))
def test_respects_leaf_limit(xs):
def flatten(x):
if isinstance(x, list):
return sum(map(flatten, x), [])
else:
return [x]
assert len(flatten(xs)) <= 10
def test_can_find_nested():
x = minimal(
st.recursive(st.booleans(), lambda x: st.tuples(x, x)),
lambda x: isinstance(x, tuple) and isinstance(x[0], tuple),
)
assert x == ((False, False), False)
def test_recursive_call_validates_expand_returns_strategies():
with pytest.raises(InvalidArgument):
st.recursive(st.booleans(), lambda x: 1).example()
def test_recursive_call_validates_base_is_strategy():
x = st.recursive(1, lambda x: st.none())
with pytest.raises(InvalidArgument):
x.example()
def test_can_find_exactly_max_leaves():
strat = st.recursive(st.none(), lambda x: st.tuples(x, x), max_leaves=5)
def enough_leaves(t):
print(t)
count = 0
stack = [t]
while stack:
s = stack.pop()
if s is None:
count += 1
else:
stack.extend(s)
return count >= 5
find_any(strat, enough_leaves)
@given(st.recursive(st.none(), lambda x: st.tuples(x, x), max_leaves=1))
def test_can_exclude_branching_with_max_leaves(t):
assert t is None
@given(st.recursive(st.none(), lambda x: st.one_of(x, x)))
def test_issue_1502_regression(s):
pass
|
