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
|
# 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 collections import Counter
from random import Random
from hypothesis.internal.conjecture.shrinking import Lexical
def test_shrink_to_zero():
assert Lexical.shrink(bytes([255] * 8), lambda x: True, random=Random(0)) == bytes(
8
)
def test_shrink_to_smallest():
assert Lexical.shrink(
bytes([255] * 8), lambda x: sum(x) > 10, random=Random(0)
) == bytes([0] * 7 + [11])
def test_float_hack_fails():
assert Lexical.shrink(
bytes([255] * 8), lambda x: x[0] >> 7, random=Random(0)
) == bytes([128] + [0] * 7)
def test_can_sort_bytes_by_reordering():
start = bytes([5, 4, 3, 2, 1, 0])
finish = Lexical.shrink(start, lambda x: set(x) == set(start), random=Random(0))
assert finish == bytes([0, 1, 2, 3, 4, 5])
def test_can_sort_bytes_by_reordering_partially():
start = bytes([5, 4, 3, 2, 1, 0])
finish = Lexical.shrink(
start, lambda x: set(x) == set(start) and x[0] > x[-1], random=Random(0)
)
assert finish == bytes([1, 2, 3, 4, 5, 0])
def test_can_sort_bytes_by_reordering_partially2():
start = bytes([5, 4, 3, 2, 1, 0])
finish = Lexical.shrink(
start,
lambda x: Counter(x) == Counter(start) and x[0] > x[2],
random=Random(0),
full=True,
)
assert finish <= bytes([1, 2, 0, 3, 4, 5])
def test_can_sort_bytes_by_reordering_partially_not_cross_stationary_element():
start = bytes([5, 3, 0, 2, 1, 4])
finish = Lexical.shrink(
start, lambda x: set(x) == set(start) and x[3] == 2, random=Random(0)
)
assert finish <= bytes([0, 3, 5, 2, 1, 4])
|
