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
|
/*=========================================================================
*
* Copyright NumFOCUS
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef itkChildTreeIterator_hxx
#define itkChildTreeIterator_hxx
namespace itk
{
template <typename TTreeType>
ChildTreeIterator<TTreeType>::ChildTreeIterator(TTreeType * tree, const TreeNodeType * start)
: TreeIteratorBase<TTreeType>(tree, start)
{
m_ListPosition = 0;
m_ParentNode = this->m_Position;
this->m_Position = m_ParentNode->GetChild(m_ListPosition);
this->m_Begin = this->m_Position;
}
template <typename TTreeType>
ChildTreeIterator<TTreeType>::ChildTreeIterator(const TreeIteratorBase<TTreeType> & iterator)
: TreeIteratorBase<TTreeType>(iterator.GetTree(), iterator.GetNode())
{
m_ListPosition = 0;
m_ParentNode = this->m_Position;
this->m_Position = m_ParentNode->GetChild(m_ListPosition);
}
template <typename TTreeType>
bool
ChildTreeIterator<TTreeType>::GoToChild(ChildIdentifier number)
{
if (m_ParentNode->GetChild(number) == nullptr)
{
return false;
}
m_ListPosition = 0;
m_ParentNode = m_ParentNode->GetChild(number);
this->m_Position = m_ParentNode->GetChild(m_ListPosition);
this->m_Begin = this->m_Position;
return true;
}
template <typename TTreeType>
bool
ChildTreeIterator<TTreeType>::GoToParent()
{
TreeNodeType * parent = m_ParentNode->GetParent();
if (parent == nullptr)
{
return false;
}
m_ListPosition = 0;
m_ParentNode = parent;
this->m_Position = m_ParentNode->GetChild(m_ListPosition);
this->m_Begin = this->m_Position;
return true;
}
template <typename TTreeType>
auto
ChildTreeIterator<TTreeType>::GetType() const -> NodeType
{
return TreeIteratorBaseEnums::TreeIteratorBaseNode::CHILD;
}
template <typename TTreeType>
bool
ChildTreeIterator<TTreeType>::HasNext() const
{
if (m_ListPosition < m_ParentNode->CountChildren() - 1)
{
return true;
}
else
{
return false;
}
}
template <typename TTreeType>
auto
ChildTreeIterator<TTreeType>::Next() -> const ValueType &
{
++m_ListPosition;
this->m_Position = m_ParentNode->GetChild(m_ListPosition);
if (this->m_Position == nullptr)
{
return this->m_Root->Get(); // value irrelevant, but we have to return something
}
return this->m_Position->Get();
}
template <typename TTreeType>
TreeIteratorBase<TTreeType> *
ChildTreeIterator<TTreeType>::Clone()
{
auto * clone = new ChildTreeIterator<TTreeType>(const_cast<TTreeType *>(this->m_Tree), this->m_Position);
*clone = *this;
return clone;
}
} // namespace itk
#endif
|
