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
|
# 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 HealthCheck, assume, example, given, settings, strategies as st
from hypothesis.internal.conjecture.provider_conformance import (
interval_lists,
intervals,
)
from hypothesis.internal.intervalsets import IntervalSet
# various tests in this file impose a max_codepoint restriction on intervals,
# for performance. There may be possibilities for performance improvements in
# IntervalSet itself as well.
@given(intervals(max_codepoint=200))
def test_intervals_are_equivalent_to_their_lists(intervals):
ls = list(intervals)
assert len(ls) == len(intervals)
for i in range(len(ls)):
assert ls[i] == intervals[i]
for i in range(1, len(ls) - 1):
assert ls[-i] == intervals[-i]
@given(intervals(max_codepoint=200))
def test_intervals_match_indexes(intervals):
ls = list(intervals)
for v in ls:
assert ls.index(v) == intervals.index(v)
@example(intervals=IntervalSet(((1, 1),)), v=0)
@example(intervals=IntervalSet(()), v=0)
@given(intervals(), st.integers(0, 0x10FFFF))
def test_error_for_index_of_not_present_value(intervals, v):
assume(v not in intervals)
with pytest.raises(ValueError):
intervals.index(v)
def test_validates_index():
with pytest.raises(IndexError):
IntervalSet([])[1]
with pytest.raises(IndexError):
IntervalSet([[1, 10]])[11]
with pytest.raises(IndexError):
IntervalSet([[1, 10]])[-11]
def test_index_above_is_index_if_present():
assert IntervalSet([[1, 10]]).index_above(1) == 0
assert IntervalSet([[1, 10]]).index_above(2) == 1
def test_index_above_is_length_if_higher():
assert IntervalSet([[1, 10]]).index_above(100) == 10
def intervals_to_set(ints):
return set(IntervalSet(ints))
@settings(suppress_health_check=[HealthCheck.filter_too_much, HealthCheck.too_slow])
@example(x=[(0, 1), (3, 3)], y=[(1, 3)])
@example(x=[(0, 1)], y=[(0, 0), (1, 1)])
@example(x=[(0, 1)], y=[(1, 1)])
@given(interval_lists(max_codepoint=200), interval_lists(max_codepoint=200))
def test_subtraction_of_intervals(x, y):
xs = intervals_to_set(x)
ys = intervals_to_set(y)
assume(not xs.isdisjoint(ys))
z = IntervalSet(x).difference(IntervalSet(y)).intervals
assert z == tuple(sorted(z))
for a, b in z:
assert a <= b
assert intervals_to_set(z) == intervals_to_set(x) - intervals_to_set(y)
@given(intervals(max_codepoint=200), intervals(max_codepoint=200))
def test_interval_intersection(x, y):
assert set(x & y) == set(x) & set(y)
assert set(x.intersection(y)) == set(x).intersection(y)
def test_char_in_shrink_order():
xs = IntervalSet([(0, 256)])
assert xs[xs._idx_of_zero] == ord("0")
assert xs[xs._idx_of_Z] == ord("Z")
rewritten = [ord(xs.char_in_shrink_order(i)) for i in range(256)]
assert rewritten != list(range(256))
assert sorted(rewritten) == sorted(range(256))
def test_index_from_char_in_shrink_order():
xs = IntervalSet([(0, 256)])
for i in xs:
assert xs.index_from_char_in_shrink_order(xs.char_in_shrink_order(i)) == i
def test_intervalset_equal():
xs1 = IntervalSet([(0, 256)])
xs2 = IntervalSet([(0, 256)])
assert xs1 == xs2
xs3 = IntervalSet([(0, 255)])
assert xs2 != xs3
|
