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
179
180
181
|
# 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 inspect
import pytest
from hypothesis import example, given, strategies as st
from hypothesis.internal.conjecture.junkdrawer import (
IntList,
LazySequenceCopy,
NotFound,
SelfOrganisingList,
binary_search,
clamp,
replace_all,
stack_depth_of_caller,
)
def test_out_of_range():
x = LazySequenceCopy([1, 2, 3])
with pytest.raises(IndexError):
x[3]
with pytest.raises(IndexError):
x[-4]
def test_pass_through():
x = LazySequenceCopy([1, 2, 3])
assert x[0] == 1
assert x[1] == 2
assert x[2] == 3
def test_can_assign_without_changing_underlying():
underlying = [1, 2, 3]
x = LazySequenceCopy(underlying)
x[1] = 10
assert x[1] == 10
assert underlying[1] == 2
def test_pop():
x = LazySequenceCopy([2, 3])
assert x.pop() == 3
assert x.pop() == 2
with pytest.raises(IndexError):
x.pop()
@example(1, 5, 10)
@example(1, 10, 5)
@example(5, 10, 5)
@example(5, 1, 10)
@given(st.integers(), st.integers(), st.integers())
def test_clamp(lower, value, upper):
lower, upper = sorted((lower, upper))
clamped = clamp(lower, value, upper)
assert lower <= clamped <= upper
if lower <= value <= upper:
assert value == clamped
if lower > value:
assert clamped == lower
if value > upper:
assert clamped == upper
def test_pop_without_mask():
y = [1, 2, 3]
x = LazySequenceCopy(y)
x.pop()
assert list(x) == [1, 2]
assert y == [1, 2, 3]
def test_pop_with_mask():
y = [1, 2, 3]
x = LazySequenceCopy(y)
x[-1] = 5
t = x.pop()
assert t == 5
assert list(x) == [1, 2]
assert y == [1, 2, 3]
def test_assignment():
y = [1, 2, 3]
x = LazySequenceCopy(y)
x[-1] = 5
assert list(x) == [1, 2, 5]
x[-1] = 7
assert list(x) == [1, 2, 7]
def test_replacement():
result = replace_all(bytes([1, 1, 1, 1]), [(1, 3, bytes([3, 4]))])
assert result == bytes([1, 3, 4, 1])
def test_int_list_cannot_contain_negative():
with pytest.raises(ValueError):
IntList([-1])
def test_int_list_can_contain_arbitrary_size():
n = 2**65
assert list(IntList([n])) == [n]
def test_int_list_of_length():
assert list(IntList.of_length(10)) == [0] * 10
def test_int_list_equality():
ls = [1, 2, 3]
x = IntList(ls)
y = IntList(ls)
assert ls != x
assert x != ls
assert not (x == ls)
assert x == x
assert x == y
def test_int_list_extend():
x = IntList.of_length(3)
n = 2**64 - 1
x.extend([n])
assert list(x) == [0, 0, 0, n]
@pytest.mark.parametrize("n", [0, 1, 30, 70])
def test_binary_search(n):
i = binary_search(0, 100, lambda i: i <= n)
assert i == n
def recur(i):
assert len(inspect.stack(0)) == stack_depth_of_caller()
if i >= 1:
recur(i - 1)
def test_stack_size_detection():
recur(100)
def test_self_organising_list_raises_not_found_when_none_satisfy():
with pytest.raises(NotFound):
SelfOrganisingList(range(20)).find(lambda x: False)
def test_self_organising_list_moves_to_front():
count = [0]
def zero(n):
count[0] += 1
return n == 0
x = SelfOrganisingList(range(20))
assert x.find(zero) == 0
assert count[0] == 20
assert x.find(zero) == 0
assert count[0] == 21
|
