VTK-m  2.0
InitializeIntrinsicVertexCountInitalizeCountsWorklet.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_distributed_hierarchical_hyper_sweeper_initialize_intrinsic_vertex_count_initialize_counts_worklet_h
54 #define vtk_m_worklet_contourtree_distributed_hierarchical_hyper_sweeper_initialize_intrinsic_vertex_count_initialize_counts_worklet_h
55 
58 
59 namespace vtkm
60 {
61 namespace worklet
62 {
63 namespace contourtree_distributed
64 {
65 namespace hierarchical_hyper_sweeper
66 {
67 
71 {
72 public:
73  using ControlSignature = void(WholeArrayIn superparents, WholeArrayInOut superarcRegularCounts);
74  using ExecutionSignature = void(InputIndex, _1, _2);
75  using InputDomain = _1;
76 
77  // Default Constructor
80 
81  template <typename InFieldPortalType, typename InOutFieldPortalType>
82  VTKM_EXEC void operator()(const vtkm::Id& vertex,
83  const InFieldPortalType superparentsPortal,
84  const InOutFieldPortalType superarcRegularCountsPortal) const
85  {
86  // per vertex
87  // retrieve the superparent
88  vtkm::Id superparent = superparentsPortal.Get(vertex);
89 
90  // if it's NSE, ignore (should never happen, but . . . )
92  {
93  return;
94  }
95  // if its the last element, always write
96  if (vertex == superparentsPortal.GetNumberOfValues() - 1)
97  {
98  superarcRegularCountsPortal.Set(superparent, vertex + 1);
99  }
100  // otherwise, only write if different from next one
101  else
102  {
103  if (superparentsPortal.Get(vertex + 1) != superparent)
104  {
105  superarcRegularCountsPortal.Set(superparent, vertex + 1);
106  }
107  }
108 
109  // In serial this worklet implements the following operation
110  /*
111  for (vtkm::Id vertex = 0; vertex < superparents.size(); vertex++)
112  { // per vertex
113  // retrieve the superparent
114  vtkm::Id superparent = superparents[vertex];
115 
116  // if it's NSE, ignore (should never happen, but . . . )
117  if (noSuchElement(superparent))
118  continue;
119 
120  // if its the last element, always write
121  if (vertex == superparents.size() - 1)
122  superarcRegularCounts[superparent] = vertex+1;
123  // otherwise, only write if different from next one
124  else
125  if (superparents[vertex+1] != superparent)
126  superarcRegularCounts[superparent] = vertex+1;
127  } // per vertex
128  */
129  } // operator()()
130 
131 }; // InitializeIntrinsicVertexCountInitalizeCountsWorklet
132 
133 } // namespace hierarchical_hyper_sweeper
134 } // namespace contourtree_distributed
135 } // namespace worklet
136 } // namespace vtkm
137 
138 #endif
VTKM_EXEC
#define VTKM_EXEC
Definition: ExportMacros.h:51
vtkm
Groups connected points that have the same field value.
Definition: Atomic.h:19
WorkletMapField.h
VTKM_EXEC_CONT
#define VTKM_EXEC_CONT
Definition: ExportMacros.h:52
vtkm::worklet::contourtree_distributed::hierarchical_hyper_sweeper::InitializeIntrinsicVertexCountInitalizeCountsWorklet::ControlSignature
void(WholeArrayIn superparents, WholeArrayInOut superarcRegularCounts) ControlSignature
Definition: InitializeIntrinsicVertexCountInitalizeCountsWorklet.h:73
vtkm::worklet::contourtree_distributed::hierarchical_hyper_sweeper::InitializeIntrinsicVertexCountInitalizeCountsWorklet::InputDomain
_1 InputDomain
Definition: InitializeIntrinsicVertexCountInitalizeCountsWorklet.h:75
vtkm::Id
vtkm::Int32 Id
Represents an ID (index into arrays).
Definition: Types.h:191
vtkm::worklet::contourtree_distributed::hierarchical_hyper_sweeper::InitializeIntrinsicVertexCountInitalizeCountsWorklet::operator()
VTKM_EXEC void operator()(const vtkm::Id &vertex, const InFieldPortalType superparentsPortal, const InOutFieldPortalType superarcRegularCountsPortal) const
Definition: InitializeIntrinsicVertexCountInitalizeCountsWorklet.h:82
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_distributed::hierarchical_hyper_sweeper::InitializeIntrinsicVertexCountInitalizeCountsWorklet
Worklet used in HierarchicalHyperSweeper.InitializeIntrinsicVertexCount(...) to set the count to the ...
Definition: InitializeIntrinsicVertexCountInitalizeCountsWorklet.h:70
vtkm::worklet::contourtree_distributed::hierarchical_hyper_sweeper::InitializeIntrinsicVertexCountInitalizeCountsWorklet::InitializeIntrinsicVertexCountInitalizeCountsWorklet
VTKM_EXEC_CONT InitializeIntrinsicVertexCountInitalizeCountsWorklet()
Definition: InitializeIntrinsicVertexCountInitalizeCountsWorklet.h:79
vtkm::worklet::contourtree_distributed::hierarchical_hyper_sweeper::InitializeIntrinsicVertexCountInitalizeCountsWorklet::ExecutionSignature
void(InputIndex, _1, _2) ExecutionSignature
Definition: InitializeIntrinsicVertexCountInitalizeCountsWorklet.h:74
Types.h
vtkm::exec::arg::InputIndex
The ExecutionSignature tag to use to get the input index.
Definition: InputIndex.h:42
vtkm::worklet::WorkletMapField
Base class for worklets that do a simple mapping of field arrays.
Definition: WorkletMapField.h:38