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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkExtractBlock.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.
=========================================================================*/
/**
* @class vtkExtractBlock
* @brief extracts blocks from a multiblock dataset.
*
* vtkExtractBlock is a filter that extracts blocks from a multiblock dataset.
* Each node in the multi-block tree is identified by an \c index. The index can
* be obtained by performing a preorder traversal of the tree (including empty
* nodes). eg. A(B (D, E), C(F, G)).
* Inorder traversal yields: A, B, D, E, C, F, G
* Index of A is 0, while index of C is 4.
*/
#ifndef vtkExtractBlock_h
#define vtkExtractBlock_h
#include "vtkFiltersExtractionModule.h" // For export macro
#include "vtkMultiBlockDataSetAlgorithm.h"
class vtkDataObjectTreeIterator;
class vtkMultiPieceDataSet;
class VTKFILTERSEXTRACTION_EXPORT vtkExtractBlock : public vtkMultiBlockDataSetAlgorithm
{
public:
static vtkExtractBlock* New();
vtkTypeMacro(vtkExtractBlock, vtkMultiBlockDataSetAlgorithm);
void PrintSelf(ostream& os, vtkIndent indent);
//@{
/**
* Select the block indices to extract.
* Each node in the multi-block tree is identified by an \c index. The index can
* be obtained by performing a preorder traversal of the tree (including empty
* nodes). eg. A(B (D, E), C(F, G)).
* Inorder traversal yields: A, B, D, E, C, F, G
* Index of A is 0, while index of C is 4.
*/
void AddIndex(unsigned int index);
void RemoveIndex(unsigned int index);
void RemoveAllIndices();
//@}
//@{
/**
* When set, the output mutliblock dataset will be pruned to remove empty
* nodes. On by default.
*/
vtkSetMacro(PruneOutput, int);
vtkGetMacro(PruneOutput, int);
vtkBooleanMacro(PruneOutput, int);
//@}
//@{
/**
* This is used only when PruneOutput is ON. By default, when pruning the
* output i.e. remove empty blocks, if node has only 1 non-null child block,
* then that node is removed. To preserve these parent nodes, set this flag to
* true. Off by default.
*/
vtkSetMacro(MaintainStructure, int);
vtkGetMacro(MaintainStructure, int);
vtkBooleanMacro(MaintainStructure, int);
//@}
protected:
vtkExtractBlock();
~vtkExtractBlock();
/**
* Internal key, used to avoid pruning of a branch.
*/
static vtkInformationIntegerKey* DONT_PRUNE();
/// Implementation of the algorithm.
virtual int RequestData(vtkInformation *,
vtkInformationVector **,
vtkInformationVector *);
/// Extract subtree
void CopySubTree(vtkDataObjectTreeIterator* loc,
vtkMultiBlockDataSet* output, vtkMultiBlockDataSet* input);
bool Prune(vtkMultiBlockDataSet* mblock);
bool Prune(vtkMultiPieceDataSet* mblock);
bool Prune(vtkDataObject* mblock);
int PruneOutput;
int MaintainStructure;
private:
vtkExtractBlock(const vtkExtractBlock&) VTK_DELETE_FUNCTION;
void operator=(const vtkExtractBlock&) VTK_DELETE_FUNCTION;
class vtkSet;
vtkSet *Indices;
vtkSet *ActiveIndices;
};
#endif
|
