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
|
# coding=utf-8
#
# This file is part of Hypothesis, which may be found at
# https://github.com/HypothesisWorks/hypothesis-python
#
# Most of this work is copyright (C) 2013-2016 David R. MacIver
# (david@drmaciver.com), but it contains contributions by others. See
# CONTRIBUTING.rst for a full list of people who may hold copyright, and
# consult the git log if you need to determine who owns an individual
# contribution.
#
# 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 http://mozilla.org/MPL/2.0/.
#
# END HEADER
from __future__ import division, print_function, absolute_import
import os
import hypothesis.strategies as st
from hypothesis import find, settings, given
settings.register_profile('benchmarking', settings(
database=None,
))
import pytest
import random
def setup_module():
settings.load_profile('benchmarking')
def teardown_module():
settings.load_profile(os.getenv('HYPOTHESIS_PROFILE', 'default'))
@st.composite
def sorted_three(draw):
x = draw(st.integers())
y = draw(st.integers(min_value=x))
z = draw(st.integers(min_value=y))
return (x, y, z)
strategies = [
st.integers(),
st.text(),
st.binary(),
st.floats(),
st.integers().flatmap(lambda x: st.lists(st.integers(max_value=x))),
st.integers().filter(lambda x: x % 3 == 1),
st.tuples(st.integers(), st.integers(), st.integers(), st.integers()),
st.text() | st.integers(),
sorted_three(),
st.text(average_size=20)
]
strategies.extend(list(map(st.lists, strategies)))
# Nothing special, just want a fixed seed list.
seeds = [
17449917217797177955,
10900658426497387440,
3678508287585343099,
11902419052042326073,
8648395390016624135
]
counter = 0
ids = []
for strat in strategies:
for seed in range(1, 1 + len(seeds)):
counter += 1
ids.append('example%d-%r-seed%d' % (counter, strat, seed))
bench = pytest.mark.parametrize(
('strategy', 'seed'), [
(strat, seed) for strat in strategies for seed in seeds
],
ids=ids
)
@bench
def test_empty_given(benchmark, strategy, seed):
@benchmark
def run():
random.seed(seed)
@given(strategy)
def test(s):
pass
test()
@bench
def test_failing_given(benchmark, strategy, seed):
@benchmark
def run():
random.seed(seed)
@given(strategy)
def test(s):
raise ValueError()
with pytest.raises(ValueError):
test()
@bench
def test_one_off_generation(benchmark, strategy, seed):
@benchmark
def run():
strategy.example(random.Random(seed))
@bench
def test_minimize_to_minimal(benchmark, strategy, seed):
@benchmark
def run():
find(strategy, lambda x: True, random=random.Random(seed))
@bench
def test_minimize_to_not_minimal(benchmark, strategy, seed):
@benchmark
def run():
rnd = random.Random(seed)
minimal = find(strategy, lambda x: True, random=rnd)
find(strategy, lambda x: x != minimal, random=rnd)
@bench
def test_total_failure_to_minimize(benchmark, strategy, seed):
@benchmark
def run():
rnd = random.Random(seed)
ex = []
def is_first(x):
if ex:
return x == ex[0]
else:
ex.append(x)
return True
find(strategy, lambda x: True, random=rnd)
|
