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
|
/* ************************************************************************
* Copyright (C) 2022 Advanced Micro Devices, Inc. All rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*
* ************************************************************************ */
#pragma once
#ifndef TESTING_RANDOM_HPP
#define TESTING_RANDOM_HPP
#include <algorithm>
#include <complex>
#include <random>
#include <string>
/* ==================================================================================== */
// Random number generator
using rocalution_rng_t = std::mt19937;
void rocalution_rng_set(rocalution_rng_t a);
void rocalution_seed_set(rocalution_rng_t a);
rocalution_rng_t& rocalution_rng_get();
rocalution_rng_t& rocalution_seed_get();
// Reset the seed (mainly to ensure repeatability of failures in a given suite)
inline void rocalution_seedrand()
{
rocalution_rng_set(rocalution_seed_get());
}
/* ==================================================================================== */
/* generate random number :*/
/*! \brief generate a random number in range [a,b] */
template <typename T>
inline T random_generator_exact(int a = 1, int b = 10)
{
return std::uniform_int_distribution<int>(a, b)(rocalution_rng_get());
}
template <>
inline std::complex<float> random_generator_exact<std::complex<float>>(int a, int b)
{
return std::complex<float>(random_generator_exact<float>(a, b),
random_generator_exact<float>(a, b));
}
template <>
inline std::complex<double> random_generator_exact<std::complex<double>>(int a, int b)
{
return std::complex<double>(random_generator_exact<double>(a, b),
random_generator_exact<double>(a, b));
}
template <typename T, typename std::enable_if_t<std::is_integral<T>::value, bool> = true>
inline T random_generator(T a = static_cast<T>(1), T b = static_cast<T>(10))
{
return random_generator_exact<T>(a, b);
}
template <typename T, typename std::enable_if_t<!std::is_integral<T>::value, bool> = true>
inline T random_generator(T a = static_cast<T>(0), T b = static_cast<T>(1))
{
return std::uniform_real_distribution<T>(a, b)(rocalution_rng_get());
}
template <>
inline std::complex<float> random_generator<std::complex<float>>(std::complex<float> a,
std::complex<float> b)
{
float theta = random_generator<float>(0.0f, 2.0f * acos(-1.0f));
float r = random_generator<float>(std::abs(a), std::abs(b));
return std::complex<float>(r * cos(theta), r * sin(theta));
}
template <>
inline std::complex<double> random_generator<std::complex<double>>(std::complex<double> a,
std::complex<double> b)
{
double theta = random_generator<double>(0.0, 2.0 * acos(-1.0));
double r = random_generator<double>(std::abs(a), std::abs(b));
return std::complex<double>(r * cos(theta), r * sin(theta));
}
#endif // TESTING_RANDOM_HPP
|
