/
test_fill_values.py
61 lines (47 loc) · 1.78 KB
/
test_fill_values.py
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
# 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-2018 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 hypothesis.strategies as st
from hypothesis import given
from tests.common.debug import minimal, find_any
from hypothesis.extra.numpy import arrays
@given(arrays(object, 100, st.builds(list)))
def test_generated_lists_are_distinct(ls):
assert len(set(map(id, ls))) == len(ls)
@st.composite
def distinct_integers(draw):
used = draw(st.shared(st.builds(set), key='distinct_integers.used'))
i = draw(st.integers(0, 2 ** 64 - 1).filter(lambda x: x not in used))
used.add(i)
return i
@given(arrays('uint64', 10, distinct_integers()))
def test_does_not_reuse_distinct_integers(arr):
assert len(set(arr)) == len(arr)
def test_may_reuse_distinct_integers_if_asked():
find_any(
arrays('uint64', 10, distinct_integers(), fill=distinct_integers()),
lambda x: len(set(x)) < len(x)
)
def test_minimizes_to_fill():
result = minimal(arrays(float, 10, fill=st.just(3.0)))
assert (result == 3.0).all()
@given(arrays(
dtype=float,
elements=st.floats().filter(bool), shape=(3, 3, 3,), fill=st.just(1.0))
)
def test_fills_everything(x):
assert x.all()