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 Insight Software Consortium
*
* 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
*
* http://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 itkTreeContainer_h
#define itkTreeContainer_h
#include "itkTreeContainerBase.h"
#include "itkPreOrderTreeIterator.h"
namespace itk
{
/** \class TreeContainer
* \brief A tree container.
*
* This class derives from the TreeContainerBase class.
* The class is templated over the type of the elements.
*
* \tparam TValue Element type stored at each location in the Tree.
*
* \ingroup DataRepresentation
* \ingroup ITKCommon
*/
template< typename TValue >
class ITK_TEMPLATE_EXPORT TreeContainer:public TreeContainerBase< TValue >
{
public:
/** Standard typedefs */
typedef TreeContainerBase< TValue > Superclass;
typedef TreeContainer< TValue > Self;
typedef SmartPointer< Self > Pointer;
typedef SmartPointer< const Self > ConstPointer;
typedef TValue ValueType;
typedef TreeNode< ValueType > TreeNodeType;
/** Iterators typedef */
typedef TreeIteratorBase< Self > IteratorType;
typedef PreOrderTreeIterator< Self > PreOrderIteratorType;
/** Method for creation through the object factory. */
itkNewMacro(Self);
/** Run-time type information (and related methods). */
itkTypeMacro(TreeContainer, TreeContainerBase);
/** Constructor */
TreeContainer(int defaultChildrenCount);
/** Constructor */
TreeContainer(TreeContainer< TValue > & tree);
/** Set the root as an element */
virtual bool SetRoot(const TValue element) ITK_OVERRIDE;
/** The the root as an iterator position */
bool SetRoot(IteratorType & pos);
/** Set the root as a tree node */
virtual bool SetRoot(TreeNode< TValue > *node) ITK_OVERRIDE;
/** Return true if the element is in the tree */
bool Contains(const TValue element) ITK_OVERRIDE;
/** Return the number of elements in the tree */
int Count() const ITK_OVERRIDE;
/** Return true if the element is a leaf */
bool IsLeaf(const TValue element) ITK_OVERRIDE;
/** Return true if the element is a root */
bool IsRoot(const TValue element) ITK_OVERRIDE;
/** Clear the tree */
bool Clear() ITK_OVERRIDE;
/** operator equal */
bool operator==(TreeContainer< TValue > & tree);
/** Swap the iterators */
bool Swap(IteratorType & v, IteratorType & w);
/** Get the root */
const TreeNodeType * GetRoot() const ITK_OVERRIDE { return m_Root.GetPointer(); }
/** Add a child to a given parent using values */
bool Add(const TValue child, const TValue parent);
/** Get node given a value */
const TreeNodeType * GetNode(TValue val) const;
protected:
TreeContainer();
virtual ~TreeContainer() ITK_OVERRIDE;
typename TreeNodeType::Pointer m_Root;
int m_DefaultChildrenCount;
void PrintSelf(std::ostream & os, Indent indent) const ITK_OVERRIDE;
};
} // namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
#include "itkTreeContainer.hxx"
#endif
#endif
|
