/usr/include/ITK-4.5/itkInOrderTreeIterator.h is in libinsighttoolkit4-dev 4.5.0-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 165 166 167 168 169 170 171 172 173 174 | /*=========================================================================
*
* 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 __itkInOrderTreeIterator_h
#define __itkInOrderTreeIterator_h
#include "itkTreeIteratorBase.h"
namespace itk
{
template< typename TTreeType >
class InOrderTreeIterator:public TreeIteratorBase< TTreeType >
{
public:
/** Typedefs */
typedef InOrderTreeIterator Self;
typedef TreeIteratorBase< TTreeType > Superclass;
typedef TTreeType TreeType;
typedef typename TTreeType::ValueType ValueType;
typedef typename Superclass::TreeNodeType TreeNodeType;
typedef typename Superclass::NodeType NodeType;
/** Constructors */
InOrderTreeIterator(TreeType & start);
InOrderTreeIterator(TreeType *tree, TreeNodeType *start = NULL);
/** Get the type of iterator */
NodeType GetType() const;
/** Clone function */
TreeIteratorBase< TTreeType > * Clone();
protected:
/** Return the next node */
const ValueType & Next();
/** Return true if the next node exists */
bool HasNext() const;
private:
/** Find the next node */
const TreeNodeType * FindNextNode() const;
};
/** Constructor */
template< typename TTreeType >
InOrderTreeIterator< TTreeType >::InOrderTreeIterator(TTreeType & start):
TreeIteratorBase< TTreeType >(start)
{}
/** Constructor */
template< typename TTreeType >
InOrderTreeIterator< TTreeType >::InOrderTreeIterator(TTreeType *tree, TreeNodeType *start):
TreeIteratorBase< TTreeType >(tree, start)
{}
/** Get the type of the iterator */
template< typename TTreeType >
typename InOrderTreeIterator< TTreeType >::NodeType
InOrderTreeIterator< TTreeType >::GetType() const
{
return TreeIteratorBase< TTreeType >::INORDER;
}
/** Return true if the next node exists */
template< typename TTreeType >
bool InOrderTreeIterator< TTreeType >::HasNext() const
{
if ( const_cast< TreeNodeType * >( FindNextNode() ) != NULL )
{
return true;
}
return false;
}
/** Return the next node */
template< typename TTreeType >
const typename InOrderTreeIterator< TTreeType >::ValueType &
InOrderTreeIterator< TTreeType >::Next()
{
this->m_Position = const_cast< TreeNodeType * >( FindNextNode() );
return this->m_Position->Get();
}
/** Find the next node */
template< typename TTreeType >
const typename InOrderTreeIterator< TTreeType >::TreeNodeType *
InOrderTreeIterator< TTreeType >::FindNextNode() const
{
if ( this->m_Position == NULL )
{
return NULL;
}
if ( this->m_Position->HasChildren() )
{
return this->m_Position->GetChild(0);
}
if ( !this->m_Position->HasParent() )
{
return NULL;
}
TreeNodeType *child = this->m_Position;
TreeNodeType *parent = this->m_Position->GetParent();
int childPosition = parent->ChildPosition(child);
int lastChildPosition = parent->CountChildren() - 1;
while ( childPosition < lastChildPosition )
{
TreeNodeType *help = parent->GetChild(childPosition + 1);
if ( help != NULL )
{
return help;
}
childPosition++;
}
while ( parent->HasParent() )
{
child = parent;
parent = parent->GetParent();
// Subtree
if ( parent->ChildPosition(this->m_Root) >= 0 )
{
return NULL;
}
childPosition = parent->ChildPosition(child);
lastChildPosition = parent->CountChildren() - 1;
while ( childPosition < lastChildPosition )
{
TreeNodeType *help = parent->GetChild(childPosition + 1);
if ( help != NULL )
{
return help;
}
}
}
return NULL;
}
/** Clone function */
template< typename TTreeType >
TreeIteratorBase< TTreeType > *InOrderTreeIterator< TTreeType >::Clone()
{
InOrderTreeIterator *clone = new InOrderTreeIterator( const_cast< TTreeType * >( this->m_Tree ) );
*clone = *this;
return clone;
}
} // end namespace itk
#endif
|