forked from kokkos/kokkos
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Kokkos_MinMax.hpp
183 lines (165 loc) · 5.17 KB
/
Kokkos_MinMax.hpp
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
//@HEADER
// ************************************************************************
//
// Kokkos v. 4.0
// Copyright (2022) National Technology & Engineering
// Solutions of Sandia, LLC (NTESS).
//
// Under the terms of Contract DE-NA0003525 with NTESS,
// the U.S. Government retains certain rights in this software.
//
// Part of Kokkos, under the Apache License v2.0 with LLVM Exceptions.
// See https://kokkos.org/LICENSE for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//@HEADER
#ifndef KOKKOS_MIN_MAX_HPP
#define KOKKOS_MIN_MAX_HPP
#include <Kokkos_Macros.hpp>
#include <Kokkos_Pair.hpp>
#include <initializer_list>
namespace Kokkos {
// max
template <class T>
constexpr KOKKOS_INLINE_FUNCTION const T& max(const T& a, const T& b) {
return (a < b) ? b : a;
}
template <class T, class ComparatorType>
constexpr KOKKOS_INLINE_FUNCTION const T& max(const T& a, const T& b,
ComparatorType comp) {
return comp(a, b) ? b : a;
}
template <class T>
KOKKOS_INLINE_FUNCTION constexpr T max(std::initializer_list<T> ilist) {
auto first = ilist.begin();
auto const last = ilist.end();
auto result = *first;
if (first == last) return result;
while (++first != last) {
if (result < *first) result = *first;
}
return result;
}
template <class T, class Compare>
KOKKOS_INLINE_FUNCTION constexpr T max(std::initializer_list<T> ilist,
Compare comp) {
auto first = ilist.begin();
auto const last = ilist.end();
auto result = *first;
if (first == last) return result;
while (++first != last) {
if (comp(result, *first)) result = *first;
}
return result;
}
// min
template <class T>
constexpr KOKKOS_INLINE_FUNCTION const T& min(const T& a, const T& b) {
return (b < a) ? b : a;
}
template <class T, class ComparatorType>
constexpr KOKKOS_INLINE_FUNCTION const T& min(const T& a, const T& b,
ComparatorType comp) {
return comp(b, a) ? b : a;
}
template <class T>
KOKKOS_INLINE_FUNCTION constexpr T min(std::initializer_list<T> ilist) {
auto first = ilist.begin();
auto const last = ilist.end();
auto result = *first;
if (first == last) return result;
while (++first != last) {
if (*first < result) result = *first;
}
return result;
}
template <class T, class Compare>
KOKKOS_INLINE_FUNCTION constexpr T min(std::initializer_list<T> ilist,
Compare comp) {
auto first = ilist.begin();
auto const last = ilist.end();
auto result = *first;
if (first == last) return result;
while (++first != last) {
if (comp(*first, result)) result = *first;
}
return result;
}
// minmax
template <class T>
constexpr KOKKOS_INLINE_FUNCTION auto minmax(const T& a, const T& b) {
using return_t = ::Kokkos::pair<const T&, const T&>;
return (b < a) ? return_t{b, a} : return_t{a, b};
}
template <class T, class ComparatorType>
constexpr KOKKOS_INLINE_FUNCTION auto minmax(const T& a, const T& b,
ComparatorType comp) {
using return_t = ::Kokkos::pair<const T&, const T&>;
return comp(b, a) ? return_t{b, a} : return_t{a, b};
}
template <class T>
KOKKOS_INLINE_FUNCTION constexpr Kokkos::pair<T, T> minmax(
std::initializer_list<T> ilist) {
auto first = ilist.begin();
auto const last = ilist.end();
auto next = first;
Kokkos::pair<T, T> result{*first, *first};
if (first == last || ++next == last) return result;
if (*next < *first)
result.first = *next;
else
result.second = *next;
first = next;
while (++first != last) {
if (++next == last) {
if (*first < result.first)
result.first = *first;
else if (!(*first < result.second))
result.second = *first;
break;
}
if (*next < *first) {
if (*next < result.first) result.first = *next;
if (!(*first < result.second)) result.second = *first;
} else {
if (*first < result.first) result.first = *first;
if (!(*next < result.second)) result.second = *next;
}
first = next;
}
return result;
}
template <class T, class Compare>
KOKKOS_INLINE_FUNCTION constexpr Kokkos::pair<T, T> minmax(
std::initializer_list<T> ilist, Compare comp) {
auto first = ilist.begin();
auto const last = ilist.end();
auto next = first;
Kokkos::pair<T, T> result{*first, *first};
if (first == last || ++next == last) return result;
if (comp(*next, *first))
result.first = *next;
else
result.second = *next;
first = next;
while (++first != last) {
if (++next == last) {
if (comp(*first, result.first))
result.first = *first;
else if (!comp(*first, result.second))
result.second = *first;
break;
}
if (comp(*next, *first)) {
if (comp(*next, result.first)) result.first = *next;
if (!comp(*first, result.second)) result.second = *first;
} else {
if (comp(*first, result.first)) result.first = *first;
if (!comp(*next, result.second)) result.second = *next;
}
first = next;
}
return result;
}
} // namespace Kokkos
#endif