forked from boostorg/compute
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_linear_congruential_engine.cpp
More file actions
120 lines (96 loc) · 3.09 KB
/
test_linear_congruential_engine.cpp
File metadata and controls
120 lines (96 loc) · 3.09 KB
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
//---------------------------------------------------------------------------//
// Copyright (c) 2014 Roshan <thisisroshansmail@gmail.com>
//
// Distributed under the Boost Software License, Version 1.0
// See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt
//
// See http://boostorg.github.com/compute for more information.
//---------------------------------------------------------------------------//
#define BOOST_TEST_MODULE TestLinearCongruentialEngine
#include <boost/test/unit_test.hpp>
#include <boost/compute/random/linear_congruential_engine.hpp>
#include <boost/compute/container/vector.hpp>
#include "check_macros.hpp"
#include "context_setup.hpp"
BOOST_AUTO_TEST_CASE(generate_uint)
{
using boost::compute::uint_;
boost::compute::linear_congruential_engine<uint_> rng(queue);
boost::compute::vector<uint_> vector(10, context);
rng.generate(vector.begin(), vector.end(), queue);
CHECK_RANGE_EQUAL(
uint_, 10, vector,
(uint_(1099087573),
uint_(2291457337),
uint_(4026424941),
uint_(420705969),
uint_(2250972997),
uint_(153107049),
uint_(3581708125),
uint_(1733142113),
uint_(3008982197),
uint_(3237988505))
);
}
BOOST_AUTO_TEST_CASE(discard_uint)
{
using boost::compute::uint_;
boost::compute::linear_congruential_engine<uint_> rng(queue);
boost::compute::vector<uint_> vector(5, context);
rng.discard(5, queue);
rng.generate(vector.begin(), vector.end(), queue);
CHECK_RANGE_EQUAL(
uint_, 5, vector,
(uint_(153107049),
uint_(3581708125),
uint_(1733142113),
uint_(3008982197),
uint_(3237988505))
);
}
BOOST_AUTO_TEST_CASE(copy_ctor)
{
using boost::compute::uint_;
boost::compute::linear_congruential_engine<uint_> rng(queue);
boost::compute::linear_congruential_engine<uint_> rng_copy(rng);
boost::compute::vector<uint_> vector(10, context);
rng_copy.generate(vector.begin(), vector.end(), queue);
CHECK_RANGE_EQUAL(
uint_, 10, vector,
(uint_(1099087573),
uint_(2291457337),
uint_(4026424941),
uint_(420705969),
uint_(2250972997),
uint_(153107049),
uint_(3581708125),
uint_(1733142113),
uint_(3008982197),
uint_(3237988505))
);
}
BOOST_AUTO_TEST_CASE(assign_op)
{
using boost::compute::uint_;
boost::compute::linear_congruential_engine<uint_> rng(queue);
boost::compute::linear_congruential_engine<uint_> rng_copy(queue);
boost::compute::vector<uint_> vector(10, context);
rng_copy.discard(5, queue);
rng_copy = rng;
rng_copy.generate(vector.begin(), vector.end(), queue);
CHECK_RANGE_EQUAL(
uint_, 10, vector,
(uint_(1099087573),
uint_(2291457337),
uint_(4026424941),
uint_(420705969),
uint_(2250972997),
uint_(153107049),
uint_(3581708125),
uint_(1733142113),
uint_(3008982197),
uint_(3237988505))
);
}
BOOST_AUTO_TEST_SUITE_END()