<!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: itkPostOrderTreeIterator.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>itkPostOrderTreeIterator.h</h1><a href="itkPostOrderTreeIterator_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: itkPostOrderTreeIterator.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-01-29 15:27: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 __itkPostOrderTreeIterator_h</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor">#define __itkPostOrderTreeIterator_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_1PostOrderTreeIterator.html">00025</a> <span class="keyword">class </span><a class="code" href="classitk_1_1PostOrderTreeIterator.html">PostOrderTreeIterator</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_1PostOrderTreeIterator.html#d76f5f2e04b582d37a9a8ab057d7d3a6">00030</a> <span class="keyword">typedef</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html">PostOrderTreeIterator</a> <a class="code" href="classitk_1_1PostOrderTreeIterator.html">Self</a>;
<a name="l00031"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#fe85e8be154b8cac2cc1ee80fae9e710">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_1PostOrderTreeIterator.html#76ee342101b5e97fa278d5ca7b2d6574">00032</a> <span class="keyword">typedef</span> TTreeType <a class="code" href="classitk_1_1PostOrderTreeIterator.html#76ee342101b5e97fa278d5ca7b2d6574">TreeType</a>;
<a name="l00033"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#76deb5d3a2e3c4437d8a0f98c1514fb3">00033</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> TTreeType::ValueType <a class="code" href="classitk_1_1PostOrderTreeIterator.html#76deb5d3a2e3c4437d8a0f98c1514fb3">ValueType</a>;
<a name="l00034"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">00034</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_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>;
<a name="l00035"></a>00035
<a name="l00037"></a>00037 <a class="code" href="classitk_1_1PostOrderTreeIterator.html#d29d99c1c85c5aa241ea4a4061456ae1">PostOrderTreeIterator</a>(<a class="code" href="classitk_1_1PostOrderTreeIterator.html#76ee342101b5e97fa278d5ca7b2d6574">TreeType</a>* tree);
<a name="l00038"></a>00038
<a name="l00040"></a>00040 <span class="keywordtype">int</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#bc679bee5c27e83e74286ba39f28d553">GetType</a>() <span class="keyword">const</span>;
<a name="l00041"></a>00041
<a name="l00043"></a>00043 <a class="code" href="classitk_1_1TreeIteratorBase.html">TreeIteratorBase<TTreeType></a>* <a class="code" href="classitk_1_1PostOrderTreeIterator.html#a8b64ef665202752ee7e7899f78920f9">Clone</a>();
<a name="l00044"></a>00044
<a name="l00045"></a>00045 <span class="keyword">protected</span>:
<a name="l00047"></a>00047 <span class="keyword">const</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#76deb5d3a2e3c4437d8a0f98c1514fb3">ValueType</a>& <a class="code" href="classitk_1_1PostOrderTreeIterator.html#5d26962b5604c567b83b223c8e889357">Next</a>();
<a name="l00048"></a>00048
<a name="l00050"></a>00050 <span class="keywordtype">bool</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#0852a635acad62d5edcc761145cc5e72">HasNext</a>() <span class="keyword">const</span>;
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="keyword">protected</span>:
<a name="l00053"></a>00053
<a name="l00054"></a>00054 <span class="keyword">const</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* <a class="code" href="classitk_1_1PostOrderTreeIterator.html#41ef518a4086615e3a1fd554a052801c">FindNextNode</a>() <span class="keyword">const</span>;
<a name="l00055"></a>00055 <span class="keyword">const</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* <a class="code" href="classitk_1_1PostOrderTreeIterator.html#576d206f97ad43ce9201a4c40af501ec">FindMostRightLeaf</a>(<a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* node) <span class="keyword">const</span>;
<a name="l00056"></a>00056 <span class="keyword">const</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* <a class="code" href="classitk_1_1PostOrderTreeIterator.html#4423fadbc19f82f506461b6380c5a564">FindSister</a>(<a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* node) <span class="keyword">const</span>;
<a name="l00057"></a>00057
<a name="l00058"></a>00058 };
<a name="l00059"></a>00059
<a name="l00061"></a>00061 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00062"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#d29d99c1c85c5aa241ea4a4061456ae1">00062</a> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#d29d99c1c85c5aa241ea4a4061456ae1">PostOrderTreeIterator<TTreeType>::PostOrderTreeIterator</a>( TTreeType* tree)
<a name="l00063"></a>00063 :<a class="code" href="classitk_1_1TreeIteratorBase.html" title="TreeIteratorBase class.">TreeIteratorBase</a><TTreeType>(tree,<a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>)
<a name="l00064"></a>00064 {
<a name="l00065"></a>00065 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_1TreeNode.html">TreeNode<ValueType></a>*<span class="keyword">></span>(tree->GetRoot());
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <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="l00068"></a>00068 {
<a name="l00069"></a>00069 this-><a class="code" href="classitk_1_1TreeIteratorBase.html#da80a6676b8e57dcfb7fc42807dc971f">m_Begin</a> = <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00070"></a>00070 }
<a name="l00071"></a>00071 <span class="keywordflow">else</span>
<a name="l00072"></a>00072 {
<a name="l00073"></a>00073 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_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* <span class="keyword">></span>(<a class="code" href="classitk_1_1PostOrderTreeIterator.html#576d206f97ad43ce9201a4c40af501ec">FindMostRightLeaf</a>(this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>));
<a name="l00074"></a>00074 this-><a class="code" href="classitk_1_1TreeIteratorBase.html#da80a6676b8e57dcfb7fc42807dc971f">m_Begin</a> = this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>;
<a name="l00075"></a>00075 }
<a name="l00076"></a>00076 }
<a name="l00077"></a>00077
<a name="l00078"></a>00078
<a name="l00080"></a>00080 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00081"></a>00081 <span class="keywordtype">int</span>
<a name="l00082"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#bc679bee5c27e83e74286ba39f28d553">00082</a> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#bc679bee5c27e83e74286ba39f28d553">PostOrderTreeIterator<TTreeType>::GetType</a>()<span class="keyword"> const</span>
<a name="l00083"></a>00083 <span class="keyword"></span>{
<a name="l00084"></a>00084 <span class="keywordflow">return</span> <a class="code" href="classitk_1_1TreeIteratorBase.html" title="TreeIteratorBase class.">TreeIteratorBase<TTreeType>::POSTORDER</a>;
<a name="l00085"></a>00085 }
<a name="l00086"></a>00086
<a name="l00087"></a>00087
<a name="l00089"></a>00089 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00090"></a>00090 <span class="keywordtype">bool</span>
<a name="l00091"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#0852a635acad62d5edcc761145cc5e72">00091</a> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#0852a635acad62d5edcc761145cc5e72">PostOrderTreeIterator<TTreeType>::HasNext</a>()<span class="keyword"> const</span>
<a name="l00092"></a>00092 <span class="keyword"></span>{
<a name="l00093"></a>00093 <span class="keywordflow">if</span>(const_cast<TreeNodeType* >(<a class="code" href="classitk_1_1PostOrderTreeIterator.html#41ef518a4086615e3a1fd554a052801c">FindNextNode</a>()) != <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>)
<a name="l00094"></a>00094 {
<a name="l00095"></a>00095 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00096"></a>00096 }
<a name="l00097"></a>00097 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00098"></a>00098 }
<a name="l00100"></a>00100
<a name="l00102"></a>00102 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00103"></a>00103 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html">PostOrderTreeIterator<TTreeType>::ValueType</a>&
<a name="l00104"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#5d26962b5604c567b83b223c8e889357">00104</a> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#5d26962b5604c567b83b223c8e889357">PostOrderTreeIterator<TTreeType>::Next</a>()
<a name="l00105"></a>00105 {
<a name="l00106"></a>00106 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_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>*<span class="keyword">></span>(<a class="code" href="classitk_1_1PostOrderTreeIterator.html#41ef518a4086615e3a1fd554a052801c">FindNextNode</a>());
<a name="l00107"></a>00107 <span class="keywordflow">return</span> this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>->Get();
<a name="l00108"></a>00108 }
<a name="l00110"></a>00110
<a name="l00112"></a>00112 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00113"></a>00113 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html">PostOrderTreeIterator<TTreeType>::TreeNodeType</a>*
<a name="l00114"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#41ef518a4086615e3a1fd554a052801c">00114</a> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#41ef518a4086615e3a1fd554a052801c">PostOrderTreeIterator<TTreeType>::FindNextNode</a>()<span class="keyword"> const</span>
<a name="l00115"></a>00115 <span class="keyword"></span>{
<a name="l00116"></a>00116 <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> || this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a> == this-><a class="code" href="classitk_1_1TreeIteratorBase.html#46a54d2b83228add2dda46f2b543bf10">m_Root</a> )
<a name="l00117"></a>00117 {
<a name="l00118"></a>00118 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00119"></a>00119 }
<a name="l00120"></a>00120 <a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* sister = <span class="keyword">const_cast<</span><a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>*<span class="keyword">></span>(<a class="code" href="classitk_1_1PostOrderTreeIterator.html#4423fadbc19f82f506461b6380c5a564">FindSister</a>( this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a> ));
<a name="l00122"></a>00122
<a name="l00123"></a>00123 <span class="keywordflow">if</span> ( sister != <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> )
<a name="l00124"></a>00124 {
<a name="l00125"></a>00125 <span class="keywordflow">return</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#576d206f97ad43ce9201a4c40af501ec">FindMostRightLeaf</a>( sister );
<a name="l00126"></a>00126 }
<a name="l00127"></a>00127
<a name="l00128"></a>00128 <span class="keywordflow">return</span> this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>->GetParent();
<a name="l00129"></a>00129 }
<a name="l00130"></a>00130
<a name="l00131"></a>00131
<a name="l00133"></a>00133 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00134"></a>00134 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html">PostOrderTreeIterator<TTreeType>::TreeNodeType</a>*
<a name="l00135"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#4423fadbc19f82f506461b6380c5a564">00135</a> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#4423fadbc19f82f506461b6380c5a564">PostOrderTreeIterator<TTreeType>::FindSister</a>( TreeNodeType* node )<span class="keyword"> const</span>
<a name="l00136"></a>00136 <span class="keyword"></span>{
<a name="l00137"></a>00137 <span class="keywordflow">if</span> ( !node->HasParent() )
<a name="l00138"></a>00138 {
<a name="l00139"></a>00139 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00140"></a>00140 }
<a name="l00141"></a>00141
<a name="l00142"></a>00142 <a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* parent = node->GetParent();
<a name="l00143"></a>00143 <span class="keywordtype">int</span> childPosition = parent->ChildPosition( node );
<a name="l00144"></a>00144 <span class="keywordtype">int</span> lastChildPosition = parent->CountChildren() - 1;
<a name="l00145"></a>00145
<a name="l00146"></a>00146 <span class="keywordflow">while</span> ( childPosition < lastChildPosition )
<a name="l00147"></a>00147 {
<a name="l00148"></a>00148 <a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* sister = parent->GetChild( childPosition + 1);
<a name="l00149"></a>00149
<a name="l00150"></a>00150 <span class="keywordflow">if</span> ( sister != <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> )
<a name="l00151"></a>00151 {
<a name="l00152"></a>00152 <span class="keywordflow">return</span> sister;
<a name="l00153"></a>00153 }
<a name="l00154"></a>00154 childPosition++;
<a name="l00155"></a>00155 }
<a name="l00156"></a>00156 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158
<a name="l00160"></a>00160 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00161"></a>00161 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html">PostOrderTreeIterator<TTreeType>::TreeNodeType</a>*
<a name="l00162"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#576d206f97ad43ce9201a4c40af501ec">00162</a> <a class="code" href="classitk_1_1PostOrderTreeIterator.html#576d206f97ad43ce9201a4c40af501ec">PostOrderTreeIterator<TTreeType>::FindMostRightLeaf</a>(TreeNodeType* node)<span class="keyword"> const</span>
<a name="l00163"></a>00163 <span class="keyword"></span>{
<a name="l00164"></a>00164 <span class="keywordflow">while</span> ( node->HasChildren() )
<a name="l00165"></a>00165 {
<a name="l00166"></a>00166 <a class="code" href="classitk_1_1PostOrderTreeIterator.html#dd8137439c3aedd52f19f5e976ee0739">TreeNodeType</a>* helpNode;
<a name="l00167"></a>00167 <span class="keywordtype">int</span> childCount = node->CountChildren();
<a name="l00168"></a>00168 <span class="keywordtype">int</span> i = 0;
<a name="l00170"></a>00170
<a name="l00171"></a>00171 <span class="keywordflow">do</span>
<a name="l00172"></a>00172 {
<a name="l00173"></a>00173 helpNode = node->GetChild( i );
<a name="l00174"></a>00174 i++;
<a name="l00175"></a>00175 } <span class="keywordflow">while</span> ( helpNode == <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> && i < childCount );
<a name="l00176"></a>00176
<a name="l00177"></a>00177 <span class="keywordflow">if</span> ( helpNode == <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> )
<a name="l00178"></a>00178 {
<a name="l00179"></a>00179 <span class="keywordflow">return</span> node;
<a name="l00180"></a>00180 }
<a name="l00181"></a>00181 node = helpNode;
<a name="l00182"></a>00182 }
<a name="l00183"></a>00183 <span class="keywordflow">return</span> node;
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185
<a name="l00187"></a>00187 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00188"></a><a class="code" href="classitk_1_1PostOrderTreeIterator.html#a8b64ef665202752ee7e7899f78920f9">00188</a> <a class="code" href="classitk_1_1TreeIteratorBase.html">TreeIteratorBase<TTreeType></a>* <a class="code" href="classitk_1_1PostOrderTreeIterator.html#a8b64ef665202752ee7e7899f78920f9">PostOrderTreeIterator<TTreeType>::Clone</a>()
<a name="l00189"></a>00189 {
<a name="l00190"></a>00190 <a class="code" href="classitk_1_1PostOrderTreeIterator.html">PostOrderTreeIterator<TTreeType></a>* clone = <span class="keyword">new</span> <a class="code" href="classitk_1_1PostOrderTreeIterator.html">PostOrderTreeIterator<TTreeType></a>( <span class="keyword">const_cast<</span>TTreeType*<span class="keyword">></span>(this-><a class="code" href="classitk_1_1TreeIteratorBase.html#f76505d30f77905f8aa6d8861154d162">m_Tree</a>) );
<a name="l00191"></a>00191 *clone = *<span class="keyword">this</span>;
<a name="l00192"></a>00192 <span class="keywordflow">return</span> clone;
<a name="l00193"></a>00193 }
<a name="l00195"></a>00195
<a name="l00196"></a>00196 } <span class="comment">// end namespace itk</span>
<a name="l00197"></a>00197
<a name="l00198"></a>00198 <span class="preprocessor">#endif</span>
<a name="l00199"></a>00199 <span class="preprocessor"></span>
<a name="l00200"></a>00200
</pre></div></div>
<hr><address><small>
Generated at Thu May 7 23:53:01 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
>
16921
