File: vtkLabelHierarchyCompositeIterator.h

package info (click to toggle)
paraview 5.11.0%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 497,236 kB
  • sloc: cpp: 3,171,290; ansic: 1,315,072; python: 134,290; xml: 103,324; sql: 65,887; sh: 5,286; javascript: 4,901; yacc: 4,383; java: 3,977; perl: 2,363; lex: 1,909; f90: 1,255; objc: 143; makefile: 119; tcl: 59; pascal: 50; fortran: 29
file content (127 lines) | stat: -rw-r--r-- 3,949 bytes parent folder | download
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
/*=========================================================================

  Program:   Visualization Toolkit
  Module:    vtkLabelHierarchyCompositeIterator.h

  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.

=========================================================================*/
/*-------------------------------------------------------------------------
  Copyright 2008 Sandia Corporation.
  Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
  the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
/**
 * @class   vtkLabelHierarchyCompositeIterator
 * @brief   Iterator over sub-iterators
 *
 *
 * Iterates over child iterators in a round-robin order. Each iterator may
 * have its own count, which is the number of times it is repeated until
 * moving to the next iterator.
 *
 * For example, if you initialize the iterator with
 * <pre>
 * it->AddIterator(A, 1);
 * it->AddIterator(B, 3);
 * </pre>
 * The order of iterators will be A,B,B,B,A,B,B,B,...
 */

#ifndef vtkLabelHierarchyCompositeIterator_h
#define vtkLabelHierarchyCompositeIterator_h

#include "vtkLabelHierarchyIterator.h"
#include "vtkRenderingLabelModule.h" // For export macro

VTK_ABI_NAMESPACE_BEGIN
class vtkIdTypeArray;
class vtkLabelHierarchy;
class vtkPolyData;

class VTKRENDERINGLABEL_EXPORT vtkLabelHierarchyCompositeIterator : public vtkLabelHierarchyIterator
{
public:
  vtkTypeMacro(vtkLabelHierarchyCompositeIterator, vtkLabelHierarchyIterator);
  void PrintSelf(ostream& os, vtkIndent indent) override;
  static vtkLabelHierarchyCompositeIterator* New();

  /**
   * Adds a label iterator to this composite iterator.
   * The second optional argument is the number of times to repeat the iterator
   * before moving to the next one round-robin style. Default is 1.
   */
  virtual void AddIterator(vtkLabelHierarchyIterator* it) { this->AddIterator(it, 1); }
  virtual void AddIterator(vtkLabelHierarchyIterator* it, int count);

  /**
   * Remove all iterators from this composite iterator.
   */
  virtual void ClearIterators();

  /**
   * Initializes the iterator. lastLabels is an array holding labels
   * which should be traversed before any other labels in the hierarchy.
   * This could include labels placed during a previous rendering or
   * a label located under the mouse pointer. You may pass a null pointer.
   */
  void Begin(vtkIdTypeArray*) override;

  /**
   * Advance the iterator.
   */
  void Next() override;

  /**
   * Returns true if the iterator is at the end.
   */
  bool IsAtEnd() override;

  /**
   * Retrieves the current label id.
   */
  vtkIdType GetLabelId() override;

  /**
   * Retrieve the current label hierarchy.
   */
  vtkLabelHierarchy* GetHierarchy() override;

  /**
   * Retrieve the coordinates of the center of the current hierarchy node
   * and the size of the node.
   * Nodes are n-cubes, so the size is the length of any edge of the cube.
   * This is used by BoxNode().
   */
  void GetNodeGeometry(double ctr[3], double& size) override;

  /**
   * Not implemented.
   */
  void BoxNode() override {}

  /**
   * Not implemented.
   */
  void BoxAllNodes(vtkPolyData*) override {}

protected:
  vtkLabelHierarchyCompositeIterator();
  ~vtkLabelHierarchyCompositeIterator() override;

  class Internal;
  Internal* Implementation;

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

VTK_ABI_NAMESPACE_END
#endif // vtkLabelHierarchyCompositeIterator_h