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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkLabelHierarchyCompositeIterator.cxx
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.
-------------------------------------------------------------------------*/
#include "vtkLabelHierarchyCompositeIterator.h"
#include "vtkObjectFactory.h"
#include "vtkSmartPointer.h"
#include <utility>
#include <vector>
vtkStandardNewMacro(vtkLabelHierarchyCompositeIterator);
class vtkLabelHierarchyCompositeIterator::Internal
{
public:
typedef std::vector<std::pair<vtkSmartPointer<vtkLabelHierarchyIterator>, int> > IteratorVector;
IteratorVector Iterators;
IteratorVector::size_type CurrentIterator;
IteratorVector::size_type InitialTraversal;
int CurrentCount;
};
vtkLabelHierarchyCompositeIterator::vtkLabelHierarchyCompositeIterator()
{
this->Implementation = new Internal();
this->Implementation->CurrentIterator = 0;
this->Implementation->InitialTraversal = 0;
this->Implementation->CurrentCount = 0;
}
vtkLabelHierarchyCompositeIterator::~vtkLabelHierarchyCompositeIterator()
{
delete this->Implementation;
}
void vtkLabelHierarchyCompositeIterator::AddIterator(vtkLabelHierarchyIterator* it, int count)
{
this->Implementation->Iterators.push_back(
std::make_pair(vtkSmartPointer<vtkLabelHierarchyIterator>(it), count));
}
void vtkLabelHierarchyCompositeIterator::ClearIterators()
{
this->Implementation->Iterators.clear();
}
void vtkLabelHierarchyCompositeIterator::Begin(vtkIdTypeArray* list)
{
this->Implementation->CurrentIterator = 0;
this->Implementation->CurrentCount = 0;
this->Implementation->InitialTraversal = 0;
// Take care of the no-iterator case
if (this->Implementation->Iterators.size() == 0)
{
return;
}
// Call Begin on each child iterator.
for (Internal::IteratorVector::size_type i = 0; i < this->Implementation->Iterators.size(); ++i)
{
this->Implementation->Iterators[i].first->Begin(list);
if (this->TraversedBounds)
{
this->Implementation->Iterators[i].first->SetTraversedBounds(this->TraversedBounds);
}
}
// Find a non-empty iterator to start at if it exists.
// If not, CurrentIterator will be past the end of the array, signaling IsAtEnd.
while (this->Implementation->CurrentIterator < this->Implementation->Iterators.size() &&
this->Implementation->Iterators[this->Implementation->CurrentIterator].first->IsAtEnd())
{
this->Implementation->CurrentIterator++;
}
}
void vtkLabelHierarchyCompositeIterator::Next()
{
Internal::IteratorVector::size_type numIterators = this->Implementation->Iterators.size();
Internal::IteratorVector::size_type numTried = 0;
vtkLabelHierarchyIterator* iter = this->Implementation->Iterators[this->Implementation->CurrentIterator].first;
int count = this->Implementation->Iterators[this->Implementation->CurrentIterator].second;
while (numTried <= numIterators && (iter->IsAtEnd() || this->Implementation->CurrentCount >= count))
{
this->Implementation->CurrentCount = 0;
this->Implementation->CurrentIterator = (this->Implementation->CurrentIterator + 1) % numIterators;
iter = this->Implementation->Iterators[this->Implementation->CurrentIterator].first;
count = this->Implementation->Iterators[this->Implementation->CurrentIterator].second;
if (!iter->IsAtEnd())
{
// Don't call Next() if this is the first time we are traversing this iterator.
if (this->Implementation->InitialTraversal < this->Implementation->CurrentIterator)
{
this->Implementation->InitialTraversal = this->Implementation->CurrentIterator;
}
else
{
iter->Next();
}
}
++numTried;
}
this->Implementation->CurrentCount++;
if (numTried > numIterators)
{
// Signal end of iterator.
this->Implementation->CurrentIterator = numIterators;
}
}
bool vtkLabelHierarchyCompositeIterator::IsAtEnd()
{
return this->Implementation->CurrentIterator >= this->Implementation->Iterators.size();
}
vtkIdType vtkLabelHierarchyCompositeIterator::GetLabelId()
{
if (this->Implementation->CurrentIterator < this->Implementation->Iterators.size())
{
return this->Implementation->Iterators[this->Implementation->CurrentIterator].first->GetLabelId();
}
return -1;
}
vtkLabelHierarchy* vtkLabelHierarchyCompositeIterator::GetHierarchy()
{
if (this->Implementation->CurrentIterator < this->Implementation->Iterators.size())
{
return this->Implementation->Iterators[this->Implementation->CurrentIterator].first->GetHierarchy();
}
return 0;
}
void vtkLabelHierarchyCompositeIterator::GetNodeGeometry(double ctr[3], double& size)
{
if (this->Implementation->CurrentIterator < this->Implementation->Iterators.size())
{
this->Implementation->Iterators[this->Implementation->CurrentIterator].first->GetNodeGeometry(ctr, size);
}
}
void vtkLabelHierarchyCompositeIterator::PrintSelf( ostream& os, vtkIndent indent )
{
this->Superclass::PrintSelf( os, indent );
}
|
