VTK-m
2.0
Main Page
Related Pages
Classes
Class List
Class Index
Class Hierarchy
Class Members
All
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
~
Functions
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
z
~
Variables
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
~
Typedefs
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
r
s
t
u
v
w
Enumerations
Enumerator
Related Functions
Files
File List
File Members
All
a
b
c
d
e
f
g
h
i
j
k
m
n
o
p
q
r
s
t
u
v
w
x
y
z
Functions
g
v
Variables
Typedefs
Macros
b
c
d
e
i
k
m
n
p
q
r
s
t
u
v
x
z
vtkm
filter
scalar_topology
worklet
contourtree_augmented
contourtreemaker
MoveNoSuchElementToBackComparator.h
Go to the documentation of this file.
1
//============================================================================
2
// Copyright (c) Kitware, Inc.
3
// All rights reserved.
4
// See LICENSE.txt for details.
5
//
6
// This software is distributed WITHOUT ANY WARRANTY; without even
7
// the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
8
// PURPOSE. See the above copyright notice for more information.
9
//============================================================================
10
// Copyright (c) 2018, The Regents of the University of California, through
11
// Lawrence Berkeley National Laboratory (subject to receipt of any required approvals
12
// from the U.S. Dept. of Energy). All rights reserved.
13
//
14
// Redistribution and use in source and binary forms, with or without modification,
15
// are permitted provided that the following conditions are met:
16
//
17
// (1) Redistributions of source code must retain the above copyright notice, this
18
// list of conditions and the following disclaimer.
19
//
20
// (2) Redistributions in binary form must reproduce the above copyright notice,
21
// this list of conditions and the following disclaimer in the documentation
22
// and/or other materials provided with the distribution.
23
//
24
// (3) Neither the name of the University of California, Lawrence Berkeley National
25
// Laboratory, U.S. Dept. of Energy nor the names of its contributors may be
26
// used to endorse or promote products derived from this software without
27
// specific prior written permission.
28
//
29
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
30
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
31
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
32
// IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
33
// INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
34
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
36
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
37
// OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
38
// OF THE POSSIBILITY OF SUCH DAMAGE.
39
//
40
//=============================================================================
41
//
42
// This code is an extension of the algorithm presented in the paper:
43
// Parallel Peak Pruning for Scalable SMP Contour Tree Computation.
44
// Hamish Carr, Gunther Weber, Christopher Sewell, and James Ahrens.
45
// Proceedings of the IEEE Symposium on Large Data Analysis and Visualization
46
// (LDAV), October 2016, Baltimore, Maryland.
47
//
48
// The PPP2 algorithm and software were jointly developed by
49
// Hamish Carr (University of Leeds), Gunther H. Weber (LBNL), and
50
// Oliver Ruebel (LBNL)
51
//==============================================================================
52
53
#ifndef vtk_m_worklet_contourtree_augmented_contourtree_maker_inc_move_no_such_element_to_back_comparator_h
54
#define vtk_m_worklet_contourtree_augmented_contourtree_maker_inc_move_no_such_element_to_back_comparator_h
55
56
#include <
vtkm/cont/ExecutionObjectBase.h
>
57
#include <
vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h
>
58
59
namespace
vtkm
60
{
61
namespace
worklet
62
{
63
namespace
contourtree_augmented
64
{
65
namespace
contourtree_maker_inc
66
{
67
68
struct
MoveNoSuchElementToBackComparator
69
{
70
VTKM_EXEC
71
bool
operator()
(
const
vtkm::Id
& leftNode,
const
vtkm::Id
& rightNode)
const
72
{
73
if
(!
vtkm::worklet::contourtree_augmented::NoSuchElement
(leftNode) &&
74
vtkm::worklet::contourtree_augmented::NoSuchElement
(rightNode))
75
{
76
return
true
;
77
}
78
else
if
(
vtkm::worklet::contourtree_augmented::NoSuchElement
(leftNode) &&
79
!
vtkm::worklet::contourtree_augmented::NoSuchElement
(rightNode))
80
{
81
return
false
;
82
}
83
else
84
{
85
return
vtkm::worklet::contourtree_augmented::MaskedIndex
(leftNode) <
86
vtkm::worklet::contourtree_augmented::MaskedIndex
(rightNode);
87
}
88
}
89
};
90
91
}
// namespace contourtree_maker_inc
92
}
// namespace contourtree_augmented
93
}
// namespace worklet
94
}
// namespace vtkm
95
96
#endif
VTKM_EXEC
#define VTKM_EXEC
Definition:
ExportMacros.h:51
vtkm
Groups connected points that have the same field value.
Definition:
Atomic.h:19
vtkm::worklet::contourtree_augmented::MaskedIndex
VTKM_EXEC_CONT vtkm::Id MaskedIndex(vtkm::Id flaggedIndex)
Definition:
filter/scalar_topology/worklet/contourtree_augmented/Types.h:127
vtkm::Id
vtkm::Int32 Id
Represents an ID (index into arrays).
Definition:
Types.h:191
vtkm::worklet::contourtree_augmented::NoSuchElement
VTKM_EXEC_CONT bool NoSuchElement(vtkm::Id flaggedIndex)
Definition:
filter/scalar_topology/worklet/contourtree_augmented/Types.h:97
vtkm::worklet::contourtree_augmented::contourtree_maker_inc::MoveNoSuchElementToBackComparator
Definition:
MoveNoSuchElementToBackComparator.h:68
Types.h
vtkm::worklet::contourtree_augmented::contourtree_maker_inc::MoveNoSuchElementToBackComparator::operator()
VTKM_EXEC bool operator()(const vtkm::Id &leftNode, const vtkm::Id &rightNode) const
Definition:
MoveNoSuchElementToBackComparator.h:71
ExecutionObjectBase.h
Generated by
1.8.17