/usr/include/InsightToolkit/Common/itkLeafTreeIterator.h is in libinsighttoolkit3-dev 3.20.1-1.
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 | /*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkLeafTreeIterator.h
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/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 notices for more information.
=========================================================================*/
#ifndef __itkLeafTreeIterator_h
#define __itkLeafTreeIterator_h
#include <itkTreeIteratorBase.h>
#include <itkPreOrderTreeIterator.h>
namespace itk {
template <class TTreeType>
class LeafTreeIterator : public TreeIteratorBase<TTreeType>
{
public:
/** Typedefs */
typedef LeafTreeIterator Self;
typedef TreeIteratorBase<TTreeType> Superclass;
typedef TTreeType TreeType;
typedef typename TreeType::ValueType ValueType;
typedef TreeNode<ValueType> TreeNodeType;
/** Constructor */
LeafTreeIterator( const TreeType* tree );
/** Constructor */
LeafTreeIterator( TreeType* tree );
/** Destructor */
virtual ~LeafTreeIterator();
/** Return the type of iterator */
int GetType() const;
/** Clone function */
TreeIteratorBase<TTreeType>* Clone();
protected:
/** Return the next value */
const ValueType& Next();
/** Return true if the next value exists */
bool HasNext() const;
private:
/** Find the next node */
const TreeNodeType* FindNextNode() const;
};
/** Constructor */
template <class TTreeType>
LeafTreeIterator<TTreeType>::LeafTreeIterator( const TTreeType* tree )
:TreeIteratorBase<TTreeType>(tree,NULL)
{
this->m_Begin = const_cast<TreeNodeType* >(this->FindNextNode()); // Position the iterator to the first leaf;
}
/** Constructor */
template <class TTreeType>
LeafTreeIterator<TTreeType>::LeafTreeIterator( TTreeType* tree )
:TreeIteratorBase<TTreeType>(tree,NULL)
{
this->m_Begin = const_cast<TreeNodeType* >(this->FindNextNode()); // Position the iterator to the first leaf;
}
/** Destructor */
template <class TTreeType>
LeafTreeIterator<TTreeType>::~LeafTreeIterator()
{
}
/** Return the type of iterator */
template <class TTreeType>
int LeafTreeIterator<TTreeType>::GetType() const
{
return TreeIteratorBase<TTreeType>::LEAF;
}
/** Return true if the next value exists */
template <class TTreeType>
bool LeafTreeIterator<TTreeType>::HasNext() const
{
if(this->m_Position == NULL)
{
return false;
}
if ( const_cast<TreeNodeType* >(FindNextNode()) != NULL )
{
return true;
}
return false;
}
/** Return the next node */
template <class TTreeType>
const typename LeafTreeIterator<TTreeType>::ValueType&
LeafTreeIterator<TTreeType>::Next()
{
this->m_Position = const_cast<TreeNodeType* >(FindNextNode());
return this->m_Position->Get();
}
/** Find the next node given the position */
template <class TTreeType>
const typename LeafTreeIterator<TTreeType>::TreeNodeType*
LeafTreeIterator<TTreeType>::FindNextNode() const
{
PreOrderTreeIterator<TTreeType> it(this->m_Tree,this->m_Position);
++it; // go next
if(it.IsAtEnd())
{
return NULL;
}
if(!it.HasChild())
{
return it.GetNode();
}
while( !it.IsAtEnd() )
{
if(!it.HasChild())
{
return it.GetNode();
}
++it;
}
return NULL;
}
/** Clone function */
template <class TTreeType>
TreeIteratorBase<TTreeType>* LeafTreeIterator<TTreeType>::Clone()
{
LeafTreeIterator<TTreeType>* clone = new LeafTreeIterator<TTreeType>( this->m_Tree );
*clone = *this;
return clone;
}
} // end namespace itk
#endif
|