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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
/*
* Copyright (c) 2017-2018 Arm Limited.
*
* SPDX-License-Identifier: MIT
*
* 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.
*/
#ifndef ARM_COMPUTE_TEST_DATASET_CARTESIAN_PRODUCT
#define ARM_COMPUTE_TEST_DATASET_CARTESIAN_PRODUCT
#include "Dataset.h"
#include <string>
#include <tuple>
#include <utility>
namespace arm_compute
{
namespace test
{
namespace framework
{
namespace dataset
{
/** Implementation of a dataset representing all combinations of values of the input datasets.
*
* For example, for the inputs {1, 2} and {3, 4} this dataset virtually
* represents the values {(1, 3), (1, 4), (2, 3), (2, 4)}.
*/
template <typename T, typename U>
class CartesianProductDataset : public Dataset
{
private:
using T_noref = typename std::remove_reference<T>::type;
using U_noref = typename std::remove_reference<U>::type;
using iter1_type = typename T_noref::iterator;
using iter2_type = typename U_noref::iterator;
public:
/** Construct dataset from the given datasets.
*
* @param[in] dataset1 First dataset.
* @param[in] dataset2 Second dataset.
*/
CartesianProductDataset(T &&dataset1, U &&dataset2)
: _dataset1{ std::forward<T>(dataset1) },
_dataset2{ std::forward<U>(dataset2) }
{
}
/** Allow instances of this class to be move constructed */
CartesianProductDataset(CartesianProductDataset &&) = default;
/** Type of the dataset. */
using type = decltype(std::tuple_cat(*std::declval<iter1_type>(), *std::declval<iter2_type>()));
/** Iterator for the dataset. */
struct iterator
{
/** Construct an iterator.
*
* @param[in] dataset1 Dataset 1.
* @param[in] dataset2 Dataset 2.
*/
iterator(const T_noref *dataset1, const U_noref *dataset2)
: _iter1{ dataset1->begin() },
_dataset2{ dataset2 },
_iter2{ dataset2->begin() }
{
}
/** Allow instances of this class to be copy constructed */
iterator(const iterator &) = default;
/** Allow instances of this class to be copied */
iterator &operator=(const iterator &) = default;
/** Allow instances of this class to be move constructed */
iterator(iterator &&) = default;
/** Allow instances of this class to be moved */
iterator &operator=(iterator &&) = default;
/** Default destructor */
~iterator() = default;
/** Get the description of the current value.
*
* @return description of the current value.
*/
std::string description() const
{
return _iter1.description() + ":" + _iter2.description();
}
/** Get the value of the iterator.
*
* @return the value of the iterator.
*/
CartesianProductDataset::type operator*() const
{
return std::tuple_cat(*_iter1, *_iter2);
}
/** Inrement the iterator.
*
* @return *this;
*/
iterator &operator++()
{
++_second_pos;
if(_second_pos < _dataset2->size())
{
++_iter2;
}
else
{
_second_pos = 0;
_iter2 = _dataset2->begin();
++_iter1;
}
return *this;
}
private:
iter1_type _iter1;
const U_noref *_dataset2;
iter2_type _iter2;
int _first_pos{ 0 };
int _second_pos{ 0 };
};
/** Iterator pointing at the begin of the dataset.
*
* @return Iterator for the dataset.
*/
iterator begin() const
{
return iterator(&_dataset1, &_dataset2);
}
/** Size of the dataset.
*
* @return Number of values in the dataset.
*/
int size() const
{
return _dataset1.size() * _dataset2.size();
}
private:
T _dataset1;
U _dataset2;
};
/** Helper function to create a @ref CartesianProductDataset.
*
* @param[in] dataset1 First dataset.
* @param[in] dataset2 Second dataset.
*
* @return A grid dataset.
*/
template <typename T, typename U>
CartesianProductDataset<T, U> combine(T &&dataset1, U &&dataset2)
{
return CartesianProductDataset<T, U>(std::forward<T>(dataset1), std::forward<U>(dataset2));
}
/** Helper function to create a @ref CartesianProductDataset.
*
* @param[in] dataset1 First dataset.
* @param[in] dataset2 Second dataset.
*
* @return A grid dataset.
*/
template <typename T, typename U>
CartesianProductDataset<T, U>
operator*(T &&dataset1, U &&dataset2)
{
return CartesianProductDataset<T, U>(std::forward<T>(dataset1), std::forward<U>(dataset2));
}
} // namespace dataset
} // namespace framework
} // namespace test
} // namespace arm_compute
#endif /* ARM_COMPUTE_TEST_DATASET_CARTESIAN_PRODUCT */
|
