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
|
# 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 hypothesis import strategies as st
from hypothesis.internal.conjecture.junkdrawer import IntList
from hypothesis.stateful import RuleBasedStateMachine, initialize, invariant, rule
INTEGERS = st.integers(0, 2**68)
@st.composite
def valid_index(draw):
machine = draw(st.runner())
if not machine.model:
return draw(st.nothing())
return draw(st.integers(0, len(machine.model) - 1))
@st.composite
def valid_slice(draw):
machine = draw(st.runner())
result = [
draw(st.integers(0, max(3, len(machine.model) * 2 - 1))) for _ in range(2)
]
result.sort()
return slice(*result)
class IntListRules(RuleBasedStateMachine):
@initialize(ls=st.lists(INTEGERS))
def starting_lists(self, ls):
self.model = list(ls)
self.target = IntList(ls)
@invariant()
def lists_are_equivalent(self):
if hasattr(self, "model"):
assert isinstance(self.model, list)
assert isinstance(self.target, IntList)
assert len(self.model) == len(self.target)
assert list(self.target) == self.model
@rule(n=INTEGERS)
def append(self, n):
self.model.append(n)
self.target.append(n)
@rule(i=valid_index() | valid_slice())
def delete(self, i):
del self.model[i]
del self.target[i]
@rule(sl=valid_slice())
def slice(self, sl):
self.model = self.model[sl]
self.target = self.target[sl]
@rule(i=valid_index())
def agree_on_values(self, i):
assert self.model[i] == self.target[i]
TestIntList = IntListRules.TestCase
|
