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
204
205
206
207
208
209
210
211
212
213
|
/*
* Copyright (c) 2017-2019 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_MISC_UTILITY_H__
#define __ARM_COMPUTE_MISC_UTILITY_H__
#include <algorithm>
#include <array>
#include <limits>
#include <numeric>
#include <vector>
namespace arm_compute
{
namespace utility
{
/** @cond */
template <std::size_t...>
struct index_sequence
{
};
template <std::size_t N, std::size_t... S>
struct index_sequence_generator : index_sequence_generator < N - 1, N - 1, S... >
{
};
template <std::size_t... S>
struct index_sequence_generator<0u, S...> : index_sequence<S...>
{
using type = index_sequence<S...>;
};
template <std::size_t N>
using index_sequence_t = typename index_sequence_generator<N>::type;
template <typename T, std::size_t N, T val, T... vals>
struct generate_array : generate_array < T, N - 1, val, val, vals... >
{
};
template <typename T, T val, T... vals>
struct generate_array<T, 0, val, vals...>
{
static constexpr std::array<T, sizeof...(vals)> value{ vals... };
};
template <typename T, T val, T... vals>
constexpr std::array<T, sizeof...(vals)> generate_array<T, 0, val, vals...>::value;
/** @endcond */
namespace detail
{
template <std::size_t... S,
typename Iterator,
typename T = std::array<typename std::iterator_traits<Iterator>::value_type, sizeof...(S)>>
T make_array(Iterator first, index_sequence<S...>)
{
return T{ { first[S]... } };
}
} // namespace detail
template <std::size_t N, typename Iterator>
std::array<typename std::iterator_traits<Iterator>::value_type, N> make_array(Iterator first, Iterator last)
{
ARM_COMPUTE_UNUSED(last);
return detail::make_array(first, index_sequence_t<N> {});
}
/** Performs clamping among a lower and upper value.
*
* @param[in] n Value to clamp.
* @param[in] lower Lower threshold.
* @param[in] upper Upper threshold.
*
* @return Clamped value.
*/
template <typename DataType, typename RangeType = DataType>
inline DataType clamp(const DataType &n,
const DataType &lower = std::numeric_limits<RangeType>::lowest(),
const DataType &upper = std::numeric_limits<RangeType>::max())
{
return std::max(lower, std::min(n, upper));
}
/** Base case of for_each. Does nothing. */
template <typename F>
inline void for_each(F &&)
{
}
/** Call the function for each of the arguments
*
* @param[in] func Function to be called
* @param[in] arg Argument passed to the function
* @param[in] args Remaining arguments
*/
template <typename F, typename T, typename... Ts>
inline void for_each(F &&func, T &&arg, Ts &&... args)
{
func(std::forward<T>(arg));
for_each(std::forward<F>(func), std::forward<Ts>(args)...);
}
/** Base case of foldl.
*
* @return value.
*/
template <typename F, typename T>
inline T &&foldl(F &&, T &&value)
{
return std::forward<T>(value);
}
/** Fold left.
*
* @param[in] func Function to be called
* @param[in] initial Initial value
* @param[in] value Argument passed to the function
* @param[in] values Remaining arguments
*/
template <typename F, typename T, typename U, typename... Us>
inline auto foldl(F &&func, T &&initial, U &&value, Us &&... values) -> decltype(func(std::forward<T>(initial), std::forward<U>(value)))
{
return foldl(std::forward<F>(func), func(std::forward<T>(initial), std::forward<U>(value)), std::forward<Us>(values)...);
}
/** Perform an index sort of a given vector.
*
* @param[in] v Vector to sort
*
* @return Sorted index vector.
*/
template <typename T>
std::vector<size_t> sort_indices(const std::vector<T> &v)
{
std::vector<size_t> idx(v.size());
std::iota(idx.begin(), idx.end(), 0);
std::sort(idx.begin(), idx.end(),
[&v](size_t i1, size_t i2)
{
return v[i1] < v[i2];
});
return idx;
}
/** Checks if a string contains a given suffix
*
* @param[in] str Input string
* @param[in] suffix Suffix to check for
*
* @return True if the string ends with the given suffix else false
*/
inline bool endswith(const std::string &str, const std::string &suffix)
{
if(str.size() < suffix.size())
{
return false;
}
return std::equal(suffix.rbegin(), suffix.rend(), str.rbegin());
}
/** Checks if a pointer complies with a given alignment
*
* @param[in] ptr Pointer to check
* @param[in] alignment Alignment value
*
* @return True if the pointer is aligned else false
*/
inline bool check_aligned(void *ptr, const size_t alignment)
{
return (reinterpret_cast<std::uintptr_t>(ptr) % alignment) == 0;
}
/** Convert string to lower case.
*
* @param[in] string To be converted string.
*
* @return Lower case string.
*/
inline std::string tolower(std::string string)
{
std::transform(string.begin(), string.end(), string.begin(), [](unsigned char c)
{
return std::tolower(c);
});
return string;
}
} // namespace utility
} // namespace arm_compute
#endif /* __ARM_COMPUTE_MISC_UTILITY_H__ */
|
