-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathtest_transform.cpp
More file actions
144 lines (119 loc) · 5.31 KB
/
Copy pathtest_transform.cpp
File metadata and controls
144 lines (119 loc) · 5.31 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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
/***************************************************************************
* Copyright (c) Johan Mabille, Sylvain Corlay, Wolf Vollprecht and *
* Martin Renou *
* Copyright (c) QuantStack *
* Copyright (c) Serge Guelton *
* *
* Distributed under the terms of the BSD 3-Clause License. *
* *
* The full license is in the file LICENSE, distributed with this software. *
****************************************************************************/
#include "xsimd_algorithm/stl/transform.hpp"
#ifndef XSIMD_NO_SUPPORTED_ARCHITECTURE
#include "doctest/doctest.h"
#include <vector>
#if XSIMD_WITH_NEON && !XSIMD_WITH_NEON64
#define ALGORITHMS_TYPES float, std::complex<float>
#else
#define ALGORITHMS_TYPES float, double, std::complex<float>, std::complex<double>
#endif
template <typename Type>
struct transform_test
{
using vector = std::vector<Type>;
using aligned_vector = std::vector<Type, xsimd::aligned_allocator<Type>>;
struct binary_functor
{
template <class T>
T operator()(const T& a, const T& b) const
{
return a + b;
}
};
struct unary_functor
{
template <class T>
T operator()(const T& a) const
{
return -a;
}
};
void test_binary_transform() const
{
vector expected(93);
vector a(93, 123), b(93, 123), c(93);
aligned_vector aa(93, 123), ba(93, 123), ca(93);
std::transform(a.begin(), a.end(), b.begin(), expected.begin(),
binary_functor {});
xsimd::transform(a.begin(), a.end(), b.begin(), c.begin(),
binary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), c.begin()));
CHECK(expected.size() == c.size());
std::fill(c.begin(), c.end(), -1); // erase
xsimd::transform(aa.begin(), aa.end(), ba.begin(), c.begin(),
binary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), c.begin()));
CHECK(expected.size() == c.size());
std::fill(c.begin(), c.end(), -1); // erase
xsimd::transform(aa.begin(), aa.end(), b.begin(), c.begin(),
binary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), c.begin()));
CHECK(expected.size() == c.size());
std::fill(c.begin(), c.end(), -1); // erase
xsimd::transform(a.begin(), a.end(), ba.begin(), c.begin(),
binary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), c.begin()));
CHECK(expected.size() == c.size());
std::fill(c.begin(), c.end(), -1); // erase
xsimd::transform(aa.begin(), aa.end(), ba.begin(), ca.begin(),
binary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), ca.begin()));
CHECK(expected.size() == ca.size());
std::fill(ca.begin(), ca.end(), -1); // erase
xsimd::transform(aa.begin(), aa.end(), b.begin(), ca.begin(),
binary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), ca.begin()));
CHECK(expected.size() == ca.size());
std::fill(ca.begin(), ca.end(), -1); // erase
xsimd::transform(a.begin(), a.end(), ba.begin(), ca.begin(),
binary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), ca.begin()));
CHECK(expected.size() == ca.size());
std::fill(ca.begin(), ca.end(), -1); // erase
}
void test_unary_transform() const
{
vector expected(93);
vector a(93, 123), c(93);
aligned_vector aa(93, 123), ca(93);
std::transform(a.begin(), a.end(), expected.begin(),
unary_functor {});
xsimd::transform(a.begin(), a.end(), c.begin(),
unary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), c.begin()));
CHECK(expected.size() == c.size());
std::fill(c.begin(), c.end(), -1); // erase
xsimd::transform(aa.begin(), aa.end(), c.begin(),
unary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), c.begin()));
CHECK(expected.size() == c.size());
std::fill(c.begin(), c.end(), -1); // erase
xsimd::transform(a.begin(), a.end(), ca.begin(),
unary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), ca.begin()));
CHECK(expected.size() == ca.size());
std::fill(ca.begin(), ca.end(), -1); // erase
xsimd::transform(aa.begin(), aa.end(), ca.begin(),
unary_functor {});
CHECK(std::equal(expected.begin(), expected.end(), ca.begin()));
CHECK(expected.size() == ca.size());
std::fill(ca.begin(), ca.end(), -1); // erase
}
};
TEST_CASE_TEMPLATE("transform test", T, ALGORITHMS_TYPES)
{
transform_test<T> Test;
SUBCASE("unary") { Test.test_unary_transform(); }
SUBCASE("binary") { Test.test_binary_transform(); }
}
#endif