Read-only mirrors. Development, issues and pull requests are on GitHub.

summaryrefslogtreecommitdiffhomepage
path: root/src/Progmasoft/Catch3/Generators/Integer.hpp
blob: 4d4e181b090859bc24c8eb1bea511dbabace1ce8 (plain)
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
// Copyright (c) 2026 Progmasoft.
// SPDX-License-Identifier: MPL-2.0 WITH AdditionRef-Progmasoft-Exception-2.0
#pragma once

#include <Progmasoft/Catch3/Detail/TypeTraits.hpp>
#include <Progmasoft/Catch3/Generator.hpp>
#include <algorithm>
#include <limits>
#include <type_traits>

namespace Progmasoft::Catch3
{
    namespace Detail
    {

        template<typename IntegerType, Detail::EnableIfInteger<IntegerType> = 0>
        [[nodiscard]] std::vector<IntegerType>
        ShrinkInteger(IntegerType value,
                      IntegerType minimum,
                      IntegerType maximum)
        {
            std::vector<IntegerType> candidates;
            const auto addCandidate = [&](IntegerType candidate) {
                if (candidate < minimum || candidate > maximum
                    || candidate == value
                    || std::find(candidates.begin(),
                                 candidates.end(),
                                 candidate)
                           != candidates.end())
                {
                    return;
                }
                candidates.push_back(candidate);
            };

            if (value == 0)
            {
                return candidates;
            }

            // First try the conventional simplest value, then halve toward it.
            // The adjacent value at the end lets the runner find boundary
            // counterexamples (for example, the first failing integer in a
            // threshold property).
            if (minimum <= 0 && maximum >= 0)
            {
                addCandidate(0);
            }

            IntegerType smaller = value;
            while (smaller != 0)
            {
                smaller = static_cast<IntegerType>(smaller / 2);
                if (smaller == 0)
                {
                    break;
                }
                addCandidate(smaller);
            }

            if (value > 0)
            {
                if (value > minimum)
                {
                    addCandidate(static_cast<IntegerType>(value - 1));
                }
                if (minimum > 0)
                {
                    addCandidate(minimum);
                }
            }
            else
            {
                if (value < maximum)
                {
                    addCandidate(static_cast<IntegerType>(value + 1));
                }
                if (maximum < 0)
                {
                    addCandidate(maximum);
                }
            }
            return candidates;
        }

    } // namespace Detail

    /// Generates integers over the inclusive range and shrinks toward simple
    /// values.
    template<typename IntegerType, Detail::EnableIfInteger<IntegerType> = 0>
    [[nodiscard]] Generator<IntegerType>
    Integer(IntegerType minimum = std::numeric_limits<IntegerType>::lowest(),
            IntegerType maximum = std::numeric_limits<IntegerType>::max())
    {
        if (minimum > maximum)
        {
            Detail::RejectInvalidArgument(
                "Integer requires minimum <= maximum");
        }

        return MakeGenerator<IntegerType>(
            [minimum, maximum](Random &random) {
                return random.Between(minimum, maximum);
            },
            [minimum, maximum](const IntegerType &value) {
                return Detail::ShrinkInteger(value, minimum, maximum);
            });
    }

} // namespace Progmasoft::Catch3