File: vtkHyperTreeGridNonOrientedSuperCursor.h

package info (click to toggle)
vtk9 9.5.2%2Bdfsg3-6
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 205,984 kB
  • sloc: cpp: 2,336,570; ansic: 327,116; python: 111,200; yacc: 4,104; java: 3,977; sh: 3,032; xml: 2,771; perl: 2,189; lex: 1,787; makefile: 181; javascript: 165; objc: 153; tcl: 59
file content (328 lines) | stat: -rw-r--r-- 8,907 bytes parent folder | download | duplicates (2)
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
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
/**
 * @class   vtkHyperTreeGridNonOrientedSuperCursor
 * @brief   Objects for traversal a HyperTreeGrid.
 *
 * Objects that can perform depth traversal of a hyper tree grid,
 * take into account more parameters (related to the grid structure) than
 * the compact hyper tree cursor implemented in vtkHyperTree can.
 * This is an abstract class.
 * Cursors are created by the HyperTreeGrid implementation.
 *
 * Supercursor allows to retrieve various kind of cursor for any childs.
 * This class is also a building block for Moore and VonNeumann SuperCursor,
 * which have neighborhood traversal abilities.
 *
 * @sa
 * vtkHyperTree vtkHyperTreeGrid
 *
 * @par Thanks:
 * This class was written by Guenole Harel and Jacques-Bernard Lekien, 2014.
 * This class was re-written by Philippe Pebay, 2016.
 * This class was re-written and optimized by Jacques-Bernard Lekien,
 * Guenole Harel and Jerome Dubois, 2018.
 * This work was supported by Commissariat a l'Energie Atomique
 * CEA, DAM, DIF, F-91297 Arpajon, France.
 */

#ifndef vtkHyperTreeGridNonOrientedSuperCursor_h
#define vtkHyperTreeGridNonOrientedSuperCursor_h

#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkObject.h"
#include "vtkSmartPointer.h" // Used internally

#include "vtkHyperTreeGridGeometryLevelEntry.h" // Used Internally

#include <vector> // For std::vector

VTK_ABI_NAMESPACE_BEGIN
class vtkHyperTree;
class vtkHyperTreeGrid;
class vtkHyperTreeGridNonOrientedGeometryCursor;
class vtkHyperTreeGridOrientedGeometryCursor;

class VTKCOMMONDATAMODEL_EXPORT vtkHyperTreeGridNonOrientedSuperCursor : public vtkObject
{
public:
  vtkTypeMacro(vtkHyperTreeGridNonOrientedSuperCursor, vtkObject);
  void PrintSelf(ostream& os, vtkIndent indent) override;

  /**
   * Create a copy of `this'.
   * \post results_exists:result!=0
   */
  virtual vtkHyperTreeGridNonOrientedSuperCursor* Clone();

  /**
   * Initialize cursor at root of given tree index in grid.
   * The create option only applies to the central HT.
   */
  virtual void Initialize(vtkHyperTreeGrid* grid, vtkIdType treeIndex, bool create = false) = 0;

  ///@{
  /**
   * Set the hyper tree grid to which the cursor is pointing.
   */
  vtkHyperTreeGrid* GetGrid();
  ///@}

  ///@{
  /**
   * Return if a Tree pointing exist.
   */
  bool HasTree();
  ///@}

  /**
   * Return if a HyperTree pointing exist.
   */
  bool HasTree(unsigned int icursor);

  ///@{
  /**
   * Set the hyper tree to which the cursor is pointing.
   */
  vtkHyperTree* GetTree();
  vtkHyperTree* GetTree(unsigned int icursor);
  ///@}

  /**
   * Return the index of the current vertex in the tree.
   */
  vtkIdType GetVertexId();
  vtkIdType GetVertexId(unsigned int icursor);

  /**
   * Return the global index (relative to the hypertree grid and
   * defined by server) of the current vertex in the tree.
   */
  vtkIdType GetGlobalNodeIndex();

  /**
   * Return the global index (relative to the hypertree grid and
   * defined by server) of the neighbor icursor current vertex in
   * the tree.
   */
  vtkIdType GetGlobalNodeIndex(unsigned int icursor);

  /**
   * Combine three get information into one
   */
  vtkHyperTree* GetInformation(
    unsigned int icursor, unsigned int& level, bool& leaf, vtkIdType& id);

  /**
   * Return the dimension of the tree.
   * \post positive_result: result>0
   */
  unsigned char GetDimension();

  /**
   * Return the number of children for each node (non-vertex leaf) of the tree.
   * \post positive_number: result>0
   */
  unsigned char GetNumberOfChildren();

  /**
   * Calls this method once per HyperTree to set the global index of the first cell.
   * This initializes implicit indexing.
   * /!\ This appeal is inconsistent with SetGlobalIndexFromLocal's appeal.
   */
  void SetGlobalIndexStart(vtkIdType index);

  /**
   * Calls this method for each cell in the HT to set the global index
   * associated with them. This initializes explicit indexing.
   * /!\ This appeal is inconsistent with SetGlobalIndexStart's appeal.
   */
  void SetGlobalIndexFromLocal(vtkIdType index);

  /**
   * Get the origin cell
   */
  double* GetOrigin();
  double* GetOrigin(unsigned int icursor);

  /**
   * Get the size cell
   */
  double* GetSize();

  /**
   * Set the blanking mask is empty or not
   * \pre not_tree: tree
   */
  void SetMask(bool state);
  void SetMask(unsigned int icursor, bool state);

  /**
   * Determine whether blanking mask is empty or not
   */
  bool IsMasked();
  bool IsMasked(unsigned int icursor);

  ///@{
  /**
   * Returns the coordinates of the bounding box :
   *  (xmin, xmax, ymin, ymax, zmin, zmax).
   */
  void GetBounds(double bounds[6]);
  void GetBounds(unsigned int icursor, double bounds[6]);
  ///@}

  ///@{
  /**
   * Returns the coordinates cell center
   */
  void GetPoint(double point[3]);
  void GetPoint(unsigned int icursor, double point[3]);
  ///@}

  /**
   * Is the cursor pointing to a leaf?
   */
  bool IsLeaf();
  bool IsLeaf(unsigned int icursor);

  /**
   * Subdivide Leaf.
   */
  void SubdivideLeaf();

  /**
   * Answer if a cursor is root.
   */
  bool IsRoot();

  /**
   * Get the level of the tree vertex pointed by the cursor.
   */
  unsigned int GetLevel();
  unsigned int GetLevel(unsigned int icursor);

  /**
   * Move the cursor to child `child' of the current vertex.
   * \pre not_tree: HasTree()
   * \pre not_leaf: !IsLeaf()
   * \pre valid_child: ichild>=0 && ichild<GetNumberOfChildren()
   * \pre depth_limiter: GetLevel() <= GetDepthLimiter()
   */
  void ToChild(unsigned char ichild);

  /**
   * Move the cursor to the root vertex.
   * \pre can be root
   * \post is_root: IsRoot()
   */
  void ToRoot();

  /**
   * Move the cursor to the parent of the current vertex.
   * Authorized if HasHistory return true.
   * \pre Non_root: !IsRoot()
   */
  void ToParent();

  /**
   * Get the number of cursors to describe neighboring cells and the current cell
   */
  unsigned int GetNumberOfCursors() const { return this->NumberOfCursors; }

  /**
   * Get the indice of central cursor, the current cell
   */
  unsigned int GetIndiceCentralCursor() const { return this->IndiceCentralCursor; }

  /**
   * Return the cursor pointing into i-th neighbor.
   * The neighborhood definition depends on the type of cursor.
   * NB: Only super cursors keep track of neighborhoods.
   */
  vtkSmartPointer<vtkHyperTreeGridOrientedGeometryCursor> GetOrientedGeometryCursor(
    unsigned int icursor);

  /**
   * Return the cursor pointing into i-th neighbor.
   * The neighborhood definition depends on the type of cursor.
   * NB: Only super cursors keep track of neighborhoods.
   */
  vtkSmartPointer<vtkHyperTreeGridNonOrientedGeometryCursor> GetNonOrientedGeometryCursor(
    unsigned int icursor);

protected:
  /**
   * Constructor
   */
  vtkHyperTreeGridNonOrientedSuperCursor();

  /**
   * Destructor
   */
  ~vtkHyperTreeGridNonOrientedSuperCursor() override;

  /**
   * The pointer to the HyperTreeGrid instance during the crossing.
   */
  vtkHyperTreeGrid* Grid;

  /**
   * Describes the central cursor necessary an instance of
   * vtkHyperTreeGridNonOrientedGeometryCursor.
   */
  vtkSmartPointer<vtkHyperTreeGridNonOrientedGeometryCursor> CentralCursor;

  /**
   * Hyper tree grid to which the cursor is attached
   */
  unsigned int CurrentFirstNonValidEntryByLevel;
  std::vector<unsigned int> FirstNonValidEntryByLevel;
  std::vector<vtkHyperTreeGridGeometryLevelEntry> Entries;

  /**
   * The last valid reference describing neighbors.
   * It is also the offset of the first neighbor at the last level.
   */
  unsigned int FirstCurrentNeighboorReferenceEntry;
  std::vector<unsigned int> ReferenceEntries;

  /**
   * Get index entry of icursor.
   */
  unsigned int GetIndiceEntry(unsigned int icursor);

  /**
   * The previous value. In the neighborhood, it does not have to be a parent.
   */
  unsigned int GetIndicePreviousEntry(unsigned int icursor);

  /**
   * Index central cursor
   */
  unsigned int IndiceCentralCursor;

  /*
   * Number of cursors in supercursor.
   */
  unsigned int NumberOfCursors;

  /*
   * Super cursor traversal table to go retrieve the parent index for each cursor
   * of the child node. There are f^d * NumberOfCursors entries in the table.
   */
  const unsigned int* ChildCursorToParentCursorTable;

  /*
   * Super cursor traversal table to go retrieve the child index for each cursor
   * of the child node. There are f^d * NumberOfCursors entries in the table.
   */
  const unsigned int* ChildCursorToChildTable;

private:
  vtkHyperTreeGridNonOrientedSuperCursor(const vtkHyperTreeGridNonOrientedSuperCursor&) = delete;
  void operator=(const vtkHyperTreeGridNonOrientedSuperCursor&) = delete;
};

VTK_ABI_NAMESPACE_END
#endif