summaryrefslogtreecommitdiff
path: root/indra/llcommon/tests/llrand_test.cpp
blob: a0dd4ef5766ceaa1af0fde9935b42b6d475d949a (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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
/**
 * @file llrandom_test.cpp
 * @author Phoenix
 * @date 2007-01-25
 *
 * $LicenseInfo:firstyear=2007&license=viewerlgpl$
 * Second Life Viewer Source Code
 * Copyright (C) 2010, Linden Research, Inc.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation;
 * version 2.1 of the License only.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 *
 * Linden Research, Inc., 945 Battery Street, San Francisco, CA  94111  USA
 * $/LicenseInfo$
 */

#include "linden_common.h"
#include "../test/lltut.h"

#include "../llrand.h"
#include "stringize.h"

// In llrand.h, every function is documented to return less than the high end
// -- specifically, because you can pass a negative extent, they're documented
// never to return a value equal to the extent.
// So that we don't need two different versions of ensure_in_range(), when
// testing extent < 0, negate the return value and the extent before passing
// into ensure_in_range().
template <typename NUMBER>
void ensure_in_range(const std::string_view& name,
                     NUMBER value, NUMBER low, NUMBER high)
{
    auto failmsg{ stringize(name, " >= ", low, " (", value, ')') };
    tut::ensure(failmsg, (value >= low));
    failmsg = stringize(name, " < ", high, " (", value, ')');
    tut::ensure(failmsg, (value < high));
}

namespace tut
{
    struct random
    {
    };

    typedef test_group<random> random_t;
    typedef random_t::object random_object_t;
    tut::random_t tut_random("LLSeedRand");

    template<> template<>
    void random_object_t::test<1>()
    {
        for(S32 ii = 0; ii < 100000; ++ii)
        {
            ensure_in_range("frand", ll_frand(), 0.0f, 1.0f);
        }
    }

    template<> template<>
    void random_object_t::test<2>()
    {
        for(S32 ii = 0; ii < 100000; ++ii)
        {
            ensure_in_range("drand", ll_drand(), 0.0, 1.0);
        }
    }

    template<> template<>
    void random_object_t::test<3>()
    {
        for(S32 ii = 0; ii < 100000; ++ii)
        {
            ensure_in_range("frand(2.0f)", ll_frand(2.0f) - 1.0f, -1.0f, 1.0f);
        }
    }

    template<> template<>
    void random_object_t::test<4>()
    {
        for(S32 ii = 0; ii < 100000; ++ii)
        {
            // Negate the result so we don't have to allow a templated low-end
            // comparison as well.
            ensure_in_range("-frand(-7.0)", -ll_frand(-7.0), 0.0f, 7.0f);
        }
    }

    template<> template<>
    void random_object_t::test<5>()
    {
        for(S32 ii = 0; ii < 100000; ++ii)
        {
            ensure_in_range("-drand(-2.0)", -ll_drand(-2.0), 0.0, 2.0);
        }
    }

    template<> template<>
    void random_object_t::test<6>()
    {
        for(S32 ii = 0; ii < 100000; ++ii)
        {
            ensure_in_range("rand(100)", ll_rand(100), 0, 100);
        }
    }

    template<> template<>
    void random_object_t::test<7>()
    {
        for(S32 ii = 0; ii < 100000; ++ii)
        {
            ensure_in_range("-rand(-127)", -ll_rand(-127), 0, 127);
        }
    }
}