<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><meta name="robots" content="noindex">
<meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>ITK: itkPreOrderTreeIterator.h Source File</title>
<link href="DoxygenStyle.css" rel="stylesheet" type="text/css">
</head><body bgcolor="#ffffff">
<!-- Section customized for INSIGHT : Tue Jul 17 01:02:45 2001 -->
<center>
<a href="index.html" class="qindex">Main Page</a>
<a href="modules.html" class="qindex">Groups</a>
<a href="namespaces.html" class="qindex">Namespace List</a>
<a href="hierarchy.html" class="qindex">Class Hierarchy</a>
<a href="classes.html" class="qindex">Alphabetical List</a>
<a href="annotated.html" class="qindex">Compound List</a>
<a href="files.html" class="qindex">File
List</a>
<a href="namespacemembers.html" class="qindex">Namespace Members</a>
<a href="functions.html" class="qindex">Compound Members</a>
<a href="globals.html" class="qindex">File Members</a>
<a href="pages.html" class="qindex">Concepts</a></center>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navpath"><a class="el" href="dir_02e23d841c198393a6e961e9a0678fff.html">Code</a> » <a class="el" href="dir_ea7fc529ede9a38b0438cf13831ae873.html">Common</a>
</div>
<div class="contents">
<h1>itkPreOrderTreeIterator.h</h1><a href="itkPreOrderTreeIterator_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*=========================================================================</span>
<a name="l00002"></a>00002 <span class="comment"></span>
<a name="l00003"></a>00003 <span class="comment"> Program: Insight Segmentation & Registration Toolkit</span>
<a name="l00004"></a>00004 <span class="comment"> Module: $RCSfile: itkPreOrderTreeIterator.h,v $</span>
<a name="l00005"></a>00005 <span class="comment"> Language: C++</span>
<a name="l00006"></a>00006 <span class="comment"> Date: $Date: 2008-06-20 20:28:42 $</span>
<a name="l00007"></a>00007 <span class="comment"> Version: $Revision: 1.4 $</span>
<a name="l00008"></a>00008 <span class="comment"></span>
<a name="l00009"></a>00009 <span class="comment"> Copyright (c) Insight Software Consortium. All rights reserved.</span>
<a name="l00010"></a>00010 <span class="comment"> See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.</span>
<a name="l00011"></a>00011 <span class="comment"></span>
<a name="l00012"></a>00012 <span class="comment"> This software is distributed WITHOUT ANY WARRANTY; without even </span>
<a name="l00013"></a>00013 <span class="comment"> the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR </span>
<a name="l00014"></a>00014 <span class="comment"> PURPOSE. See the above copyright notices for more information.</span>
<a name="l00015"></a>00015 <span class="comment"></span>
<a name="l00016"></a>00016 <span class="comment">=========================================================================*/</span>
<a name="l00017"></a>00017 <span class="preprocessor">#ifndef __itkPreOrderTreeIterator_h</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor">#define __itkPreOrderTreeIterator_h</span>
<a name="l00019"></a>00019 <span class="preprocessor"></span>
<a name="l00020"></a>00020 <span class="preprocessor">#include <<a class="code" href="itkTreeIteratorBase_8h.html">itkTreeIteratorBase.h</a>></span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="keyword">namespace </span>itk{
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00025"></a><a class="code" href="classitk_1_1PreOrderTreeIterator.html">00025</a> <span class="keyword">class </span><a class="code" href="classitk_1_1PreOrderTreeIterator.html">PreOrderTreeIterator</a> : <span class="keyword">public</span> <a class="code" href="classitk_1_1TreeIteratorBase.html" title="TreeIteratorBase class.">TreeIteratorBase</a><TTreeType>
<a name="l00026"></a>00026 {
<a name="l00027"></a>00027 <span class="keyword">public</span>:
<a name="l00028"></a>00028
<a name="l00030"></a><a class="code" href="classitk_1_1PreOrderTreeIterator.html#5d9babbc07d1f307cdc9e26e96f7d8da">00030</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> TTreeType::ValueType <a class="code" href="classitk_1_1PreOrderTreeIterator.html#5d9babbc07d1f307cdc9e26e96f7d8da">ValueType</a>;
<a name="l00031"></a><a class="code" href="classitk_1_1PreOrderTreeIterator.html#de772864ad2f66f1dc428a4f3387d241">00031</a> <span class="keyword">typedef</span> <a class="code" href="classitk_1_1TreeIteratorBase.html">TreeIteratorBase<TTreeType></a> <a class="code" href="classitk_1_1TreeIteratorBase.html">Superclass</a>;
<a name="l00032"></a><a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">00032</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classitk_1_1TreeIteratorBase.html#7ade8934dd14587151817bc7d4a30e1b">Superclass::TreeNodeType</a> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>;
<a name="l00033"></a>00033
<a name="l00035"></a>00035 <a class="code" href="classitk_1_1PreOrderTreeIterator.html#7d6a2c7ee06f1fb2f2d3cafdb882c3c1">PreOrderTreeIterator</a>( <span class="keyword">const</span> TTreeType* tree,<span class="keyword">const</span> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>* start = <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> );
<a name="l00036"></a>00036
<a name="l00038"></a>00038 <span class="keywordtype">int</span> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#6da1863c6da92c8146c4fb46ef98df39">GetType</a>() <span class="keyword">const</span>;
<a name="l00039"></a>00039
<a name="l00041"></a>00041 <a class="code" href="classitk_1_1TreeIteratorBase.html">TreeIteratorBase<TTreeType></a>* <a class="code" href="classitk_1_1PreOrderTreeIterator.html#eaa826cfba441c82565b86d6ec54a6f2">Clone</a>();
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="keyword">protected</span>:
<a name="l00045"></a>00045 <span class="keyword">const</span> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#5d9babbc07d1f307cdc9e26e96f7d8da">ValueType</a>& <a class="code" href="classitk_1_1PreOrderTreeIterator.html#89ccdea2d5230e3ed6c2058081a40fa5">Next</a>();
<a name="l00046"></a>00046
<a name="l00048"></a>00048 <span class="keywordtype">bool</span> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#d377db92a9fcc3876959378880da5b9b">HasNext</a>() <span class="keyword">const</span>;
<a name="l00049"></a>00049
<a name="l00050"></a>00050 <span class="keyword">private</span>:
<a name="l00051"></a>00051
<a name="l00053"></a>00053 <span class="keyword">const</span> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>* FindNextNode() <span class="keyword">const</span>;
<a name="l00054"></a>00054
<a name="l00055"></a>00055 };
<a name="l00056"></a>00056
<a name="l00057"></a>00057
<a name="l00059"></a>00059 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00060"></a><a class="code" href="classitk_1_1PreOrderTreeIterator.html#7d6a2c7ee06f1fb2f2d3cafdb882c3c1">00060</a> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#7d6a2c7ee06f1fb2f2d3cafdb882c3c1">PreOrderTreeIterator<TTreeType>::PreOrderTreeIterator</a>( <span class="keyword">const</span> TTreeType* tree, <span class="keyword">const</span> TreeNodeType* start )
<a name="l00061"></a>00061 :<a class="code" href="classitk_1_1TreeIteratorBase.html" title="TreeIteratorBase class.">TreeIteratorBase</a><TTreeType>(tree,start)
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063
<a name="l00064"></a>00064 }
<a name="l00065"></a>00065
<a name="l00067"></a>00067 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00068"></a>00068 <span class="keywordtype">int</span>
<a name="l00069"></a><a class="code" href="classitk_1_1PreOrderTreeIterator.html#6da1863c6da92c8146c4fb46ef98df39">00069</a> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#6da1863c6da92c8146c4fb46ef98df39">PreOrderTreeIterator<TTreeType>::GetType</a>()<span class="keyword"> const </span>
<a name="l00070"></a>00070 <span class="keyword"></span>{
<a name="l00071"></a>00071 <span class="keywordflow">return</span> <a class="code" href="classitk_1_1TreeIteratorBase.html" title="TreeIteratorBase class.">TreeIteratorBase<TTreeType>::PREORDER</a>;
<a name="l00072"></a>00072 }
<a name="l00073"></a>00073
<a name="l00075"></a>00075 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00076"></a>00076 <span class="keywordtype">bool</span>
<a name="l00077"></a><a class="code" href="classitk_1_1PreOrderTreeIterator.html#d377db92a9fcc3876959378880da5b9b">00077</a> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#d377db92a9fcc3876959378880da5b9b">PreOrderTreeIterator<TTreeType>::HasNext</a>()<span class="keyword"> const</span>
<a name="l00078"></a>00078 <span class="keyword"></span>{
<a name="l00079"></a>00079 <span class="keywordflow">if</span> ( const_cast<TreeNodeType* >(FindNextNode()) != <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> )
<a name="l00080"></a>00080 {
<a name="l00081"></a>00081 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00082"></a>00082 }
<a name="l00083"></a>00083 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00084"></a>00084 }
<a name="l00086"></a>00086
<a name="l00088"></a>00088 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00089"></a>00089 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classitk_1_1PreOrderTreeIterator.html">PreOrderTreeIterator<TTreeType>::ValueType</a>&
<a name="l00090"></a><a class="code" href="classitk_1_1PreOrderTreeIterator.html#89ccdea2d5230e3ed6c2058081a40fa5">00090</a> <a class="code" href="classitk_1_1PreOrderTreeIterator.html#89ccdea2d5230e3ed6c2058081a40fa5">PreOrderTreeIterator<TTreeType>::Next</a>()
<a name="l00091"></a>00091 {
<a name="l00092"></a>00092 this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a> = <span class="keyword">const_cast<</span><a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>* <span class="keyword">></span>(FindNextNode());
<a name="l00093"></a>00093 <span class="keywordflow">return</span> this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>->Get();
<a name="l00094"></a>00094 }
<a name="l00096"></a>00096
<a name="l00098"></a>00098 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00099"></a>00099 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classitk_1_1PreOrderTreeIterator.html">PreOrderTreeIterator<TTreeType>::TreeNodeType</a>*
<a name="l00100"></a>00100 <a class="code" href="classitk_1_1PreOrderTreeIterator.html">PreOrderTreeIterator<TTreeType>::FindNextNode</a>()<span class="keyword"> const</span>
<a name="l00101"></a>00101 <span class="keyword"></span>{
<a name="l00102"></a>00102 <span class="keywordflow">if</span> ( this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a> == <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> )
<a name="l00103"></a>00103 {
<a name="l00104"></a>00104 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00105"></a>00105 }
<a name="l00106"></a>00106 <span class="keywordflow">if</span> ( this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>->HasChildren() )
<a name="l00107"></a>00107 {
<a name="l00108"></a>00108 <span class="keywordflow">return</span> <span class="keyword">dynamic_cast<</span><span class="keyword">const </span><a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>*<span class="keyword">></span>(this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>->GetChild(0));
<a name="l00109"></a>00109 }
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <span class="keywordflow">if</span> ( !this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>->HasParent() )
<a name="l00113"></a>00113 {
<a name="l00114"></a>00114 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00115"></a>00115 }
<a name="l00116"></a>00116
<a name="l00117"></a>00117 <a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>* child = this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>;
<a name="l00118"></a>00118 <a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>* parent = <span class="keyword">dynamic_cast<</span><a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>*<span class="keyword">></span>(this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>->GetParent());
<a name="l00119"></a>00119
<a name="l00120"></a>00120 <span class="comment">// Are we a subtree? Then we are done.</span>
<a name="l00121"></a>00121 <span class="keywordflow">if</span>( parent && parent->ChildPosition( this->m_Root ) >= 0 )
<a name="l00122"></a>00122 {
<a name="l00123"></a>00123 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00124"></a>00124 }
<a name="l00125"></a>00125
<a name="l00126"></a>00126 <span class="keywordtype">int</span> childPosition = parent->ChildPosition( child );
<a name="l00127"></a>00127 <span class="keywordtype">int</span> lastChildPosition = parent->CountChildren() - 1;
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="keywordflow">while</span> ( childPosition < lastChildPosition )
<a name="l00130"></a>00130 {
<a name="l00131"></a>00131 <a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>* help = <span class="keyword">dynamic_cast<</span><a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>*<span class="keyword">></span>(parent->GetChild( childPosition + 1 ));
<a name="l00132"></a>00132
<a name="l00133"></a>00133 <span class="keywordflow">if</span> ( help != <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> )
<a name="l00134"></a>00134 {
<a name="l00135"></a>00135 <span class="keywordflow">return</span> help;
<a name="l00136"></a>00136 }
<a name="l00137"></a>00137 childPosition++;
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="keywordflow">while</span> ( parent->HasParent() )
<a name="l00141"></a>00141 {
<a name="l00142"></a>00142 child = parent;
<a name="l00143"></a>00143 parent = <span class="keyword">dynamic_cast<</span><a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>*<span class="keyword">></span>(parent->GetParent());
<a name="l00144"></a>00144
<a name="l00145"></a>00145 <span class="comment">// Subtree</span>
<a name="l00146"></a>00146 <span class="keywordflow">if</span>( parent->ChildPosition( this->m_Root ) >= 0 )
<a name="l00147"></a>00147 {
<a name="l00148"></a>00148 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150
<a name="l00151"></a>00151 childPosition = parent->ChildPosition(child);
<a name="l00152"></a>00152 lastChildPosition = parent->CountChildren() - 1;
<a name="l00153"></a>00153
<a name="l00154"></a>00154 <span class="keywordflow">while</span> ( childPosition < lastChildPosition )
<a name="l00155"></a>00155 {
<a name="l00156"></a>00156 <a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>* help = <span class="keyword">dynamic_cast<</span><a class="code" href="classitk_1_1PreOrderTreeIterator.html#fa6c10e1c51bde48b02570e0905f166d">TreeNodeType</a>*<span class="keyword">></span>(parent->GetChild( childPosition + 1 ));
<a name="l00157"></a>00157
<a name="l00158"></a>00158 <span class="keywordflow">if</span> ( help != <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> )
<a name="l00159"></a>00159 {
<a name="l00160"></a>00160 <span class="keywordflow">return</span> help;
<a name="l00161"></a>00161 }
<a name="l00162"></a>00162 }
<a name="l00163"></a>00163 }
<a name="l00164"></a>00164 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00165"></a>00165 }
<a name="l00166"></a>00166
<a name="l00168"></a>00168 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00169"></a><a class="code" href="classitk_1_1PreOrderTreeIterator.html#eaa826cfba441c82565b86d6ec54a6f2">00169</a> <a class="code" href="classitk_1_1TreeIteratorBase.html">TreeIteratorBase<TTreeType></a>* <a class="code" href="classitk_1_1PreOrderTreeIterator.html#eaa826cfba441c82565b86d6ec54a6f2">PreOrderTreeIterator<TTreeType>::Clone</a>()
<a name="l00170"></a>00170 {
<a name="l00171"></a>00171 <a class="code" href="classitk_1_1PreOrderTreeIterator.html">PreOrderTreeIterator<TTreeType></a>* clone = <span class="keyword">new</span> <a class="code" href="classitk_1_1PreOrderTreeIterator.html">PreOrderTreeIterator<TTreeType></a>( this-><a class="code" href="classitk_1_1TreeIteratorBase.html#f76505d30f77905f8aa6d8861154d162">m_Tree</a>, this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a> );
<a name="l00172"></a>00172 *clone = *<span class="keyword">this</span>;
<a name="l00173"></a>00173 <span class="keywordflow">return</span> clone;
<a name="l00174"></a>00174 }
<a name="l00176"></a>00176
<a name="l00177"></a>00177 } <span class="comment">// end namespace itk</span>
<a name="l00178"></a>00178
<a name="l00179"></a>00179 <span class="preprocessor">#endif</span>
<a name="l00180"></a>00180 <span class="preprocessor"></span>
</pre></div></div>
<hr><address><small>
Generated at Thu May 7 23:53:02 2009 for ITK by <a href="http://www.stack.nl/~dimitri/doxygen/index.html"> <img
src="http://www.stack.nl/~dimitri/doxygen/doxygen.png" alt="doxygen"
align="middle" border=0 width=110 height=53>
</a> 1.5.9 written by <a href="mailto:dimitri@stack.nl">Dimitri van Heesch</a>,
© 1997-2000</small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
d5e74628f0e673bb8680aebce32b2c04
>
files
>
16925
