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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
|
// Copyright (c) 2006-2008 Max-Planck-Institute Saarbruecken (Germany)
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/Number_types/include/CGAL/utils_classes.h $
// $Id: include/CGAL/utils_classes.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Michael Hemmer <hemmer@mpi-sb.mpg.de>
#ifndef CGAL_UTILS_CLASSES_H
#define CGAL_UTILS_CLASSES_H
#include <CGAL/config.h>
#include <functional> // for std::less
#include <algorithm> // for std::min and max
#ifdef CGAL_USE_SSE2_MAX
#include <CGAL/sse2.h>
#endif
namespace CGAL {
template < class A, class B = A >
struct Equal_to : public CGAL::cpp98::binary_function< A, B, bool > {
bool operator()( const A& x, const B& y) const
{ return x == y; }
};
template < class A, class B = A >
struct Not_equal_to : public CGAL::cpp98::binary_function< A, B, bool > {
bool operator()( const A& x, const B& y) const
{ return x != y; }
};
template < class A, class B = A >
struct Greater : public CGAL::cpp98::binary_function< A, B, bool > {
bool operator()( const A& x, const B& y) const
{ return x > y; }
};
template < class A, class B = A >
struct Less : public CGAL::cpp98::binary_function< A, B, bool > {
bool operator()( const A& x, const B& y) const
{ return x < y; }
};
template < class A, class B = A >
struct Greater_equal : public CGAL::cpp98::binary_function< A, B, bool > {
bool operator()( const A& x, const B& y) const
{ return x >= y; }
};
template < class A, class B = A >
struct Less_equal : public CGAL::cpp98::binary_function< A, B, bool > {
bool operator()( const A& x, const B& y) const
{ return x <= y; }
};
template < class NT, class Less = std::less< NT > >
struct Min :public CGAL::cpp98::binary_function< NT, NT, NT > {
Min() {}
Min(const Less& c_) : c(c_) {}
NT operator()( const NT& x, const NT& y) const
{ return (std::min)( x, y, c); }
protected:
Less c;
};
template < class NT, class Less = std::less< NT > >
struct Max :public CGAL::cpp98::binary_function< NT, NT, NT > {
Max() {}
Max(const Less& c_) : c(c_) {}
NT operator()( const NT& x, const NT& y) const
{ return (std::max)( x, y, c); }
protected:
Less c;
};
#ifdef CGAL_USE_SSE2_MAX
inline double sse2max(double a, double b, double c, double d)
{
__m128d A =_mm_load_sd(&a);
__m128d B =_mm_load_sd(&b);
__m128d C =_mm_load_sd(&c);
__m128d D =_mm_load_sd(&d);
__m128d AB = _mm_max_sd(A,B);
__m128d CD = _mm_max_sd(C,D);
A = _mm_max_sd(AB,CD);
_mm_store_sd(&a, A);
return a;
}
inline double sse2max(double a, double b, double c)
{
__m128d A =_mm_load_sd(&a);
__m128d B =_mm_load_sd(&b);
__m128d C =_mm_load_sd(&c);
__m128d AB = _mm_max_sd(A,B);
A = _mm_max_sd(AB,C);
_mm_store_sd(&a, A);
return a;
}
inline double sse2max(double a, double b)
{
__m128d A =_mm_load_sd(&a);
__m128d B =_mm_load_sd(&b);
__m128d C = _mm_max_sd(A,B);
_mm_store_sd(&a, C);
return a;
}
#if 0
// Doing things in parallel seems the way to go
// but copying to/from arrays has too much overhead
// a = max(a,a2) b = max(b,b2)
inline void sse2mmax2(double& a, double a2, double& b, double b2)
{
CGAL_ALIGN_16 double res[2];
res[0] = a;
res[1] = b;
__m128d F =_mm_load_pd(res);
res[0] = a2;
res[1] = b2;
__m128d S =_mm_load_pd(res);
__m128d C = _mm_max_pd(F,S);
_mm_store_pd(res, C);
a = res[0];
b = res[1];
}
#endif
inline double sse2min(double a, double b, double c, double d)
{
__m128d A =_mm_load_sd(&a);
__m128d B =_mm_load_sd(&b);
__m128d C =_mm_load_sd(&c);
__m128d D =_mm_load_sd(&d);
__m128d AB = _mm_min_sd(A,B);
__m128d CD = _mm_min_sd(C,D);
A = _mm_min_sd(AB,CD);
_mm_store_sd(&a, A);
return a;
}
inline double sse2min(double a, double b, double c)
{
__m128d A =_mm_load_sd(&a);
__m128d B =_mm_load_sd(&b);
__m128d C =_mm_load_sd(&c);
__m128d AB = _mm_min_sd(A,B);
A = _mm_min_sd(AB,C);
_mm_store_sd(&a, A);
return a;
}
inline double sse2min(double a, double b)
{
__m128d A =_mm_load_sd(&a);
__m128d B =_mm_load_sd(&b);
__m128d C = _mm_min_sd(A,B);
_mm_store_sd(&a, C);
return a;
}
inline void sse2minmax(double& a, double b, double& c)
{
__m128d A =_mm_load_sd(&a);
__m128d B =_mm_load_sd(&b);
__m128d C =_mm_load_sd(&c);
__m128d AB = _mm_min_sd(A,B);
A = _mm_min_sd(AB,C);
_mm_store_sd(&a, A);
AB = _mm_max_pd(A,B);
C = _mm_max_sd(AB,C);
_mm_store_sd(&c, C);
}
#endif // CGAL_USE_SSE2_MAX
template <>
struct Max<double> :public CGAL::cpp98::binary_function< double, double, double > {
Max() {}
double operator()( const double& x, const double& y) const
{
#ifdef CGAL_USE_SSE2_MAX
return sse2max(x,y);
#else
return (std::max)( x, y);
#endif
}
double operator()( double x, double y, double z) const
{
#ifdef CGAL_USE_SSE2_MAX
return sse2max(x,y,z);
#else
return (std::max)((std::max)( x, y), z);
#endif
}
double operator()( double w,double x, double y, double z) const
{
#ifdef CGAL_USE_SSE2_MAX
return sse2max(w,x,y,z);
#else
return (std::max)((std::max)( x, y), (std::max)(w,z));
#endif
}
};
template <>
struct Min<double> :public CGAL::cpp98::binary_function< double, double, double > {
Min() {}
double operator()( const double& x, const double& y) const
{
#ifdef CGAL_USE_SSE2_MAX
return sse2min(x,y);
#else
return (std::min)( x, y);
#endif
}
double operator()( double x, double y, double z) const
{
#ifdef CGAL_USE_SSE2_MAX
return sse2min(x,y,z);
#else
return (std::min)((std::min)( x, y), z);
#endif
}
double operator()( double w,double x, double y, double z) const
{
#ifdef CGAL_USE_SSE2_MAX
return sse2min(w,x,y,z);
#else
return (std::min)((std::min)( x, y), (std::min)(w,z));
#endif
}
};
template< class T >
class Is_valid
: public CGAL::cpp98::unary_function< T, bool > {
public:
bool operator()( const T& ) const {
return true;
};
};
namespace internal
{
// utility class to be used for calling exact(Lazy) when doing accumulation with EPECK
template <class NT>
struct Evaluate
{
template <class T>
void operator()(const T&)
{}
};
} // internal namespace
} //namespace CGAL
#endif // CGAL_UTILS_CLASSES_H
|
