forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkDataArrayPrivate.txx
581 lines (537 loc) · 16.3 KB
/
vtkDataArrayPrivate.txx
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
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
/*=========================================================================
Program: Visualization Toolkit
Module: vtkDataArrayPrivate.txx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
#ifndef vtkDataArrayPrivate_txx
#define vtkDataArrayPrivate_txx
#ifndef VTK_GDA_TEMPLATE_EXTERN
#include "vtkAssume.h"
#include "vtkDataArray.h"
#include "vtkDataArrayRange.h"
#include "vtkSMPThreadLocal.h"
#include "vtkSMPTools.h"
#include "vtkTypeTraits.h"
#include <algorithm>
#include <array>
#include <cassert> // for assert()
#include <limits>
#include <vector>
namespace vtkDataArrayPrivate
{
#if (defined(_MSC_VER) && (_MSC_VER < 2000)) || \
(defined(__INTEL_COMPILER) && (__INTEL_COMPILER < 1700))
namespace msvc
{
//----------------------------------------------------------------------------
// Those min and max functions replace std ones because their
// implementation used to generate very slow code with MSVC.
// See https://randomascii.wordpress.com/2013/11/24/stdmin-causing-three-times-slowdown-on-vc/
// The comparison expression in min/max are written so that if the "condition" is false,
// the "left" value is returned. This is consistent with STL's implementations
// and also handles the cases where the right value may be a NaN properly.
// All code using these methods should ensure that the "left" value is never
// NaN.
// We use _MSC_VER < 2000 instead of 1900 not due to performance issues, but
// because MSVC 2015 (_MSC_VER=1900) doesn't handle NaNs properly in optimized
// builds.
// icpc version 16 also doesn't handle NaNs properly.
// The order is correct in icpc version 17.
template <class ValueType>
ValueType max(const ValueType& left, const ValueType& right)
{
return right > left ? right : left;
}
template <class ValueType>
ValueType min(const ValueType& left, const ValueType& right)
{
return right <= left ? right : left;
}
}
#endif
namespace detail
{
#if (defined(_MSC_VER) && (_MSC_VER < 2000)) || \
(defined(__INTEL_COMPILER) && (__INTEL_COMPILER < 1700))
using msvc::max;
using msvc::min;
#else
using std::max;
using std::min;
#endif
}
// avoid checking types that don't contain infinity.
namespace detail
{
template <typename T, bool>
struct has_infinity;
template <typename T>
struct has_infinity<T, true>
{
static bool isinf(T x) { return std::isinf(x); }
};
template <typename T>
struct has_infinity<T, false>
{
static bool isinf(T) { return false; }
};
template <typename T>
bool isinf(T x)
{
// Select the correct partially specialized type.
return has_infinity<T, std::numeric_limits<T>::has_infinity>::isinf(x);
}
}
template <typename APIType, int NumComps>
class MinAndMax
{
protected:
APIType ReducedRange[2 * NumComps];
vtkSMPThreadLocal<std::array<APIType, 2 * NumComps>> TLRange;
public:
MinAndMax()
{
for (int i = 0, j = 0; i < NumComps; ++i, j += 2)
{
this->ReducedRange[j] = vtkTypeTraits<APIType>::Max();
this->ReducedRange[j + 1] = vtkTypeTraits<APIType>::Min();
}
}
void Initialize()
{
auto& range = this->TLRange.Local();
for (int i = 0, j = 0; i < NumComps; ++i, j += 2)
{
range[j] = vtkTypeTraits<APIType>::Max();
range[j + 1] = vtkTypeTraits<APIType>::Min();
}
}
void Reduce()
{
for (auto itr = this->TLRange.begin(); itr != this->TLRange.end(); ++itr)
{
auto& range = *itr;
for (int i = 0, j = 0; i < NumComps; ++i, j += 2)
{
this->ReducedRange[j] = detail::min(this->ReducedRange[j], range[j]);
this->ReducedRange[j + 1] = detail::max(this->ReducedRange[j + 1], range[j + 1]);
}
}
}
template <typename T>
void CopyRanges(T* ranges)
{
for (int i = 0, j = 0; i < NumComps; ++i, j += 2)
{
ranges[j] = static_cast<T>(this->ReducedRange[j]);
ranges[j + 1] = static_cast<T>(this->ReducedRange[j + 1]);
}
}
};
template <int NumComps, typename ArrayT, typename APIType = typename vtk::GetAPIType<ArrayT>>
class AllValuesMinAndMax : public MinAndMax<APIType, NumComps>
{
private:
using MinAndMaxT = MinAndMax<APIType, NumComps>;
ArrayT* Array;
public:
AllValuesMinAndMax(ArrayT* array)
: MinAndMaxT()
, Array(array)
{
}
// Help vtkSMPTools find Initialize() and Reduce()
void Initialize() { MinAndMaxT::Initialize(); }
void Reduce() { MinAndMaxT::Reduce(); }
void operator()(vtkIdType begin, vtkIdType end)
{
const auto tuples = vtk::DataArrayTupleRange<NumComps>(this->Array, begin, end);
auto& range = MinAndMaxT::TLRange.Local();
for (const auto tuple : tuples)
{
size_t j = 0;
for (const APIType value : tuple)
{
range[j] = detail::min(range[j], value);
range[j + 1] = detail::max(range[j + 1], value);
j += 2;
}
}
}
};
template <int NumComps, typename ArrayT, typename APIType = typename vtk::GetAPIType<ArrayT>>
class FiniteMinAndMax : public MinAndMax<APIType, NumComps>
{
private:
using MinAndMaxT = MinAndMax<APIType, NumComps>;
ArrayT* Array;
public:
FiniteMinAndMax(ArrayT* array)
: MinAndMaxT()
, Array(array)
{
}
// Help vtkSMPTools find Initialize() and Reduce()
void Initialize() { MinAndMaxT::Initialize(); }
void Reduce() { MinAndMaxT::Reduce(); }
void operator()(vtkIdType begin, vtkIdType end)
{
const auto tuples = vtk::DataArrayTupleRange<NumComps>(this->Array, begin, end);
auto& range = MinAndMaxT::TLRange.Local();
for (const auto tuple : tuples)
{
size_t j = 0;
for (const APIType value : tuple)
{
if (!detail::isinf(value))
{
range[j] = detail::min(range[j], value);
range[j + 1] = detail::max(range[j + 1], value);
}
j += 2;
}
}
}
};
template <typename ArrayT, typename APIType = typename vtk::GetAPIType<ArrayT>>
class MagnitudeAllValuesMinAndMax : public MinAndMax<APIType, 1>
{
private:
using MinAndMaxT = MinAndMax<APIType, 1>;
ArrayT* Array;
public:
MagnitudeAllValuesMinAndMax(ArrayT* array)
: MinAndMaxT()
, Array(array)
{
}
// Help vtkSMPTools find Initialize() and Reduce()
void Initialize() { MinAndMaxT::Initialize(); }
void Reduce() { MinAndMaxT::Reduce(); }
template <typename T>
void CopyRanges(T* ranges)
{
MinAndMaxT::CopyRanges(ranges);
// now that we have computed the smallest and largest value, take the
// square root of that value.
ranges[0] = std::sqrt(ranges[0]);
ranges[1] = std::sqrt(ranges[1]);
}
void operator()(vtkIdType begin, vtkIdType end)
{
const auto tuples = vtk::DataArrayTupleRange(this->Array, begin, end);
auto& range = MinAndMaxT::TLRange.Local();
for (const auto tuple : tuples)
{
APIType squaredSum = 0.0;
for (const APIType value : tuple)
{
squaredSum += value * value;
}
range[0] = detail::min(range[0], squaredSum);
range[1] = detail::max(range[1], squaredSum);
}
}
};
template <typename ArrayT, typename APIType = typename vtk::GetAPIType<ArrayT>>
class MagnitudeFiniteMinAndMax : public MinAndMax<APIType, 1>
{
private:
using MinAndMaxT = MinAndMax<APIType, 1>;
ArrayT* Array;
public:
MagnitudeFiniteMinAndMax(ArrayT* array)
: MinAndMaxT()
, Array(array)
{
}
// Help vtkSMPTools find Initialize() and Reduce()
void Initialize() { MinAndMaxT::Initialize(); }
void Reduce() { MinAndMaxT::Reduce(); }
template <typename T>
void CopyRanges(T* ranges)
{
MinAndMaxT::CopyRanges(ranges);
// now that we have computed the smallest and largest value, take the
// square root of that value.
ranges[0] = std::sqrt(ranges[0]);
ranges[1] = std::sqrt(ranges[1]);
}
void operator()(vtkIdType begin, vtkIdType end)
{
const auto tuples = vtk::DataArrayTupleRange(this->Array, begin, end);
auto& range = MinAndMaxT::TLRange.Local();
for (const auto tuple : tuples)
{
APIType squaredSum = 0.0;
for (const APIType value : tuple)
{
squaredSum += value * value;
}
if (!detail::isinf(squaredSum))
{
range[0] = detail::min(range[0], squaredSum);
range[1] = detail::max(range[1], squaredSum);
}
}
}
};
//----------------------------------------------------------------------------
template <int NumComps>
struct ComputeScalarRange
{
template <class ArrayT, typename RangeValueType>
bool operator()(ArrayT* array, RangeValueType* ranges, AllValues)
{
AllValuesMinAndMax<NumComps, ArrayT> minmax(array);
vtkSMPTools::For(0, array->GetNumberOfTuples(), minmax);
minmax.CopyRanges(ranges);
return true;
}
template <class ArrayT, typename RangeValueType>
bool operator()(ArrayT* array, RangeValueType* ranges, FiniteValues)
{
FiniteMinAndMax<NumComps, ArrayT> minmax(array);
vtkSMPTools::For(0, array->GetNumberOfTuples(), minmax);
minmax.CopyRanges(ranges);
return true;
}
};
template <typename ArrayT, typename APIType>
class GenericMinAndMax
{
protected:
ArrayT* Array;
vtkIdType NumComps;
vtkSMPThreadLocal<std::vector<APIType>> TLRange;
std::vector<APIType> ReducedRange;
public:
GenericMinAndMax(ArrayT* array)
: Array(array)
, NumComps(Array->GetNumberOfComponents())
, ReducedRange(2 * NumComps)
{
for (int i = 0, j = 0; i < this->NumComps; ++i, j += 2)
{
this->ReducedRange[j] = vtkTypeTraits<APIType>::Max();
this->ReducedRange[j + 1] = vtkTypeTraits<APIType>::Min();
}
}
void Initialize()
{
auto& range = this->TLRange.Local();
range.resize(2 * this->NumComps);
for (int i = 0, j = 0; i < this->NumComps; ++i, j += 2)
{
range[j] = vtkTypeTraits<APIType>::Max();
range[j + 1] = vtkTypeTraits<APIType>::Min();
}
}
void Reduce()
{
for (auto itr = this->TLRange.begin(); itr != this->TLRange.end(); ++itr)
{
auto& range = *itr;
for (int i = 0, j = 0; i < this->NumComps; ++i, j += 2)
{
this->ReducedRange[j] = detail::min(this->ReducedRange[j], range[j]);
this->ReducedRange[j + 1] = detail::max(this->ReducedRange[j + 1], range[j + 1]);
}
}
}
template <typename T>
void CopyRanges(T* ranges)
{
for (int i = 0, j = 0; i < NumComps; ++i, j += 2)
{
ranges[j] = static_cast<T>(this->ReducedRange[j]);
ranges[j + 1] = static_cast<T>(this->ReducedRange[j + 1]);
}
}
};
template <typename ArrayT, typename APIType = typename vtk::GetAPIType<ArrayT>>
class AllValuesGenericMinAndMax : public GenericMinAndMax<ArrayT, APIType>
{
private:
using MinAndMaxT = GenericMinAndMax<ArrayT, APIType>;
public:
AllValuesGenericMinAndMax(ArrayT* array)
: MinAndMaxT(array)
{
}
// Help vtkSMPTools find Initialize() and Reduce()
void Initialize() { MinAndMaxT::Initialize(); }
void Reduce() { MinAndMaxT::Reduce(); }
void operator()(vtkIdType begin, vtkIdType end)
{
const auto tuples = vtk::DataArrayTupleRange(this->Array, begin, end);
auto& range = MinAndMaxT::TLRange.Local();
for (const auto tuple : tuples)
{
size_t j = 0;
for (const APIType value : tuple)
{
range[j] = detail::min(range[j], value);
range[j + 1] = detail::max(range[j + 1], value);
j += 2;
}
}
}
};
template <typename ArrayT, typename APIType = typename vtk::GetAPIType<ArrayT>>
class FiniteGenericMinAndMax : public GenericMinAndMax<ArrayT, APIType>
{
private:
using MinAndMaxT = GenericMinAndMax<ArrayT, APIType>;
public:
FiniteGenericMinAndMax(ArrayT* array)
: MinAndMaxT(array)
{
}
// Help vtkSMPTools find Initialize() and Reduce()
void Initialize() { MinAndMaxT::Initialize(); }
void Reduce() { MinAndMaxT::Reduce(); }
void operator()(vtkIdType begin, vtkIdType end)
{
const auto tuples = vtk::DataArrayTupleRange(this->Array, begin, end);
auto& range = MinAndMaxT::TLRange.Local();
for (const auto tuple : tuples)
{
size_t j = 0;
for (const APIType value : tuple)
{
if (!detail::isinf(value))
{
range[j] = detail::min(range[j], value);
range[j + 1] = detail::max(range[j + 1], value);
}
j += 2;
}
}
}
};
template <class ArrayT, typename RangeValueType>
bool GenericComputeScalarRange(ArrayT* array, RangeValueType* ranges, AllValues)
{
AllValuesGenericMinAndMax<ArrayT> minmax(array);
vtkSMPTools::For(0, array->GetNumberOfTuples(), minmax);
minmax.CopyRanges(ranges);
return true;
}
template <class ArrayT, typename RangeValueType>
bool GenericComputeScalarRange(ArrayT* array, RangeValueType* ranges, FiniteValues)
{
FiniteGenericMinAndMax<ArrayT> minmax(array);
vtkSMPTools::For(0, array->GetNumberOfTuples(), minmax);
minmax.CopyRanges(ranges);
return true;
}
//----------------------------------------------------------------------------
template <typename ArrayT, typename RangeValueType, typename ValueType>
bool DoComputeScalarRange(ArrayT* array, RangeValueType* ranges, ValueType tag)
{
const int numComp = array->GetNumberOfComponents();
// setup the initial ranges to be the max,min for double
for (int i = 0, j = 0; i < numComp; ++i, j += 2)
{
ranges[j] = vtkTypeTraits<RangeValueType>::Max();
ranges[j + 1] = vtkTypeTraits<RangeValueType>::Min();
}
// do this after we make sure range is max to min
if (array->GetNumberOfTuples() == 0)
{
return false;
}
// Special case for single value scalar range. This is done to help the
// compiler detect it can perform loop optimizations.
if (numComp == 1)
{
return ComputeScalarRange<1>()(array, ranges, tag);
}
else if (numComp == 2)
{
return ComputeScalarRange<2>()(array, ranges, tag);
}
else if (numComp == 3)
{
return ComputeScalarRange<3>()(array, ranges, tag);
}
else if (numComp == 4)
{
return ComputeScalarRange<4>()(array, ranges, tag);
}
else if (numComp == 5)
{
return ComputeScalarRange<5>()(array, ranges, tag);
}
else if (numComp == 6)
{
return ComputeScalarRange<6>()(array, ranges, tag);
}
else if (numComp == 7)
{
return ComputeScalarRange<7>()(array, ranges, tag);
}
else if (numComp == 8)
{
return ComputeScalarRange<8>()(array, ranges, tag);
}
else if (numComp == 9)
{
return ComputeScalarRange<9>()(array, ranges, tag);
}
else
{
return GenericComputeScalarRange(array, ranges, tag);
}
}
//----------------------------------------------------------------------------
// generic implementation that operates on ValueType.
template <typename ArrayT, typename RangeValueType>
bool DoComputeVectorRange(ArrayT* array, RangeValueType range[2], AllValues)
{
range[0] = vtkTypeTraits<RangeValueType>::Max();
range[1] = vtkTypeTraits<RangeValueType>::Min();
// do this after we make sure range is max to min
const vtkIdType numTuples = array->GetNumberOfTuples();
if (numTuples == 0)
{
return false;
}
// Always compute at double precision for vector magnitudes. This will
// give precision errors on large 64-bit ints, but magnitudes aren't usually
// computed for those.
MagnitudeAllValuesMinAndMax<ArrayT, double> MinAndMax(array);
vtkSMPTools::For(0, numTuples, MinAndMax);
MinAndMax.CopyRanges(range);
return true;
}
//----------------------------------------------------------------------------
template <typename ArrayT, typename RangeValueType>
bool DoComputeVectorRange(ArrayT* array, RangeValueType range[2], FiniteValues)
{
const vtkIdType numTuples = array->GetNumberOfTuples();
range[0] = vtkTypeTraits<RangeValueType>::Max();
range[1] = vtkTypeTraits<RangeValueType>::Min();
// do this after we make sure range is max to min
if (numTuples == 0)
{
return false;
}
// Always compute at double precision for vector magnitudes. This will
// give precision errors on large 64-bit ints, but magnitudes aren't usually
// computed for those.
MagnitudeFiniteMinAndMax<ArrayT, double> MinAndMax(array);
vtkSMPTools::For(0, numTuples, MinAndMax);
MinAndMax.CopyRanges(range);
return true;
}
} // end namespace vtkDataArrayPrivate
#endif // VTK_GDA_TEMPLATE_EXTERN
#endif
// VTK-HeaderTest-Exclude: vtkDataArrayPrivate.txx