<!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: itkLeafTreeIterator.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>itkLeafTreeIterator.h</h1><a href="itkLeafTreeIterator_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: itkLeafTreeIterator.h,v $</span>
<a name="l00005"></a>00005 <span class="comment"> Language: C++</span>
<a name="l00006"></a>00006 <span class="comment"> Date: $Date: 2009-02-05 19:05:00 $</span>
<a name="l00007"></a>00007 <span class="comment"> Version: $Revision: 1.6 $</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 __itkLeafTreeIterator_h</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor">#define __itkLeafTreeIterator_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 <span class="preprocessor">#include <<a class="code" href="itkPreOrderTreeIterator_8h.html">itkPreOrderTreeIterator.h</a>></span>
<a name="l00022"></a>00022
<a name="l00023"></a>00023 <span class="keyword">namespace </span>itk {
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00026"></a><a class="code" href="classitk_1_1LeafTreeIterator.html">00026</a> <span class="keyword">class </span><a class="code" href="classitk_1_1LeafTreeIterator.html">LeafTreeIterator</a> : <span class="keyword">public</span> <a class="code" href="classitk_1_1TreeIteratorBase.html" title="TreeIteratorBase class.">TreeIteratorBase</a><TTreeType>
<a name="l00027"></a>00027 {
<a name="l00028"></a>00028 <span class="keyword">public</span>:
<a name="l00029"></a>00029
<a name="l00031"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#91cd9b14e27f6b09007619a07a7600da">00031</a> <span class="keyword">typedef</span> <a class="code" href="classitk_1_1LeafTreeIterator.html">LeafTreeIterator</a> <a class="code" href="classitk_1_1LeafTreeIterator.html">Self</a>;
<a name="l00032"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#17fd5a1567a930b8e05a7fa129dda1d0">00032</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="l00033"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#ee237c4a12fa158f0f447b7248ba52bc">00033</a> <span class="keyword">typedef</span> TTreeType <a class="code" href="classitk_1_1LeafTreeIterator.html#ee237c4a12fa158f0f447b7248ba52bc">TreeType</a>;
<a name="l00034"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#81b4ec53ec8ec477b75896f137211e7c">00034</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> TreeType::ValueType <a class="code" href="classitk_1_1LeafTreeIterator.html#81b4ec53ec8ec477b75896f137211e7c">ValueType</a>;
<a name="l00035"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#7ce3cb64bd8f4608a72a849d71266b4b">00035</a> <span class="keyword">typedef</span> <a class="code" href="classitk_1_1TreeNode.html">TreeNode<ValueType></a> <a class="code" href="classitk_1_1TreeNode.html">TreeNodeType</a>;
<a name="l00036"></a>00036
<a name="l00038"></a>00038 <a class="code" href="classitk_1_1LeafTreeIterator.html#b14a66b25f82e7f465e0a0a8ac0182ec">LeafTreeIterator</a>( <span class="keyword">const</span> <a class="code" href="classitk_1_1LeafTreeIterator.html#ee237c4a12fa158f0f447b7248ba52bc">TreeType</a>* tree );
<a name="l00039"></a>00039
<a name="l00041"></a>00041 <a class="code" href="classitk_1_1LeafTreeIterator.html#b14a66b25f82e7f465e0a0a8ac0182ec">LeafTreeIterator</a>( <a class="code" href="classitk_1_1LeafTreeIterator.html#ee237c4a12fa158f0f447b7248ba52bc">TreeType</a>* tree );
<a name="l00042"></a>00042
<a name="l00044"></a>00044 <span class="keyword">virtual</span> <a class="code" href="classitk_1_1LeafTreeIterator.html#535fbe3bb9bc9524f4fa724c6c6b028d">~LeafTreeIterator</a>();
<a name="l00045"></a>00045
<a name="l00047"></a>00047 <span class="keywordtype">int</span> <a class="code" href="classitk_1_1LeafTreeIterator.html#77103460651cc87800c1c29e855ba1c6">GetType</a>() <span class="keyword">const</span>;
<a name="l00048"></a>00048
<a name="l00050"></a>00050 <a class="code" href="classitk_1_1TreeIteratorBase.html">TreeIteratorBase<TTreeType></a>* <a class="code" href="classitk_1_1LeafTreeIterator.html#9cd738203f93a5f12832b5fc8c69e430">Clone</a>();
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="keyword">protected</span>:
<a name="l00053"></a>00053
<a name="l00055"></a>00055 <span class="keyword">const</span> <a class="code" href="classitk_1_1LeafTreeIterator.html#81b4ec53ec8ec477b75896f137211e7c">ValueType</a>& <a class="code" href="classitk_1_1LeafTreeIterator.html#8f954f7f10c62dd8c88696623d7a0d21">Next</a>();
<a name="l00056"></a>00056
<a name="l00058"></a>00058 <span class="keywordtype">bool</span> <a class="code" href="classitk_1_1LeafTreeIterator.html#3d30049c151346d7d9dc64edfc7d6cee">HasNext</a>() <span class="keyword">const</span>;
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="keyword">private</span>:
<a name="l00061"></a>00061
<a name="l00063"></a>00063 <span class="keyword">const</span> <a class="code" href="classitk_1_1TreeNode.html">TreeNodeType</a>* FindNextNode() <span class="keyword">const</span>;
<a name="l00064"></a>00064
<a name="l00065"></a>00065 };
<a name="l00066"></a>00066
<a name="l00068"></a>00068 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00069"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#b14a66b25f82e7f465e0a0a8ac0182ec">00069</a> <a class="code" href="classitk_1_1LeafTreeIterator.html#b14a66b25f82e7f465e0a0a8ac0182ec">LeafTreeIterator<TTreeType>::LeafTreeIterator</a>( <span class="keyword">const</span> TTreeType* tree )
<a name="l00070"></a>00070 :<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="l00071"></a>00071 {
<a name="l00072"></a>00072 this-><a class="code" href="classitk_1_1TreeIteratorBase.html#da80a6676b8e57dcfb7fc42807dc971f">m_Begin</a> = <span class="keyword">const_cast<</span><a class="code" href="classitk_1_1TreeNode.html">TreeNodeType</a>* <span class="keyword">></span>(this->FindNextNode()); <span class="comment">// Position the iterator to the first leaf;</span>
<a name="l00073"></a>00073 }
<a name="l00074"></a>00074
<a name="l00076"></a>00076 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00077"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#6be8f8f1be9cef160f006eac377ed87e">00077</a> <a class="code" href="classitk_1_1LeafTreeIterator.html#b14a66b25f82e7f465e0a0a8ac0182ec">LeafTreeIterator<TTreeType>::LeafTreeIterator</a>( TTreeType* tree )
<a name="l00078"></a>00078 :<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="l00079"></a>00079 {
<a name="l00080"></a>00080 this-><a class="code" href="classitk_1_1TreeIteratorBase.html#da80a6676b8e57dcfb7fc42807dc971f">m_Begin</a> = <span class="keyword">const_cast<</span><a class="code" href="classitk_1_1TreeNode.html">TreeNodeType</a>* <span class="keyword">></span>(this->FindNextNode()); <span class="comment">// Position the iterator to the first leaf;</span>
<a name="l00081"></a>00081 }
<a name="l00082"></a>00082
<a name="l00084"></a>00084 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00085"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#535fbe3bb9bc9524f4fa724c6c6b028d">00085</a> <a class="code" href="classitk_1_1LeafTreeIterator.html#535fbe3bb9bc9524f4fa724c6c6b028d">LeafTreeIterator<TTreeType>::~LeafTreeIterator</a>()
<a name="l00086"></a>00086 {
<a name="l00087"></a>00087 }
<a name="l00088"></a>00088
<a name="l00090"></a>00090 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00091"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#77103460651cc87800c1c29e855ba1c6">00091</a> <span class="keywordtype">int</span> <a class="code" href="classitk_1_1LeafTreeIterator.html#77103460651cc87800c1c29e855ba1c6">LeafTreeIterator<TTreeType>::GetType</a>()<span class="keyword"> const </span>
<a name="l00092"></a>00092 <span class="keyword"></span>{
<a name="l00093"></a>00093 <span class="keywordflow">return</span> <a class="code" href="classitk_1_1TreeIteratorBase.html" title="TreeIteratorBase class.">TreeIteratorBase<TTreeType>::LEAF</a>;
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095
<a name="l00097"></a>00097 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00098"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#3d30049c151346d7d9dc64edfc7d6cee">00098</a> <span class="keywordtype">bool</span> <a class="code" href="classitk_1_1LeafTreeIterator.html#3d30049c151346d7d9dc64edfc7d6cee">LeafTreeIterator<TTreeType>::HasNext</a>()<span class="keyword"> const</span>
<a name="l00099"></a>00099 <span class="keyword"></span>{
<a name="l00100"></a>00100 <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="l00101"></a>00101 {
<a name="l00102"></a>00102 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104 <span class="keywordflow">if</span> ( const_cast<TreeNodeType* >(FindNextNode()) != <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a> )
<a name="l00105"></a>00105 {
<a name="l00106"></a>00106 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00107"></a>00107 }
<a name="l00108"></a>00108 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00109"></a>00109 }
<a name="l00111"></a>00111
<a name="l00113"></a>00113 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00114"></a>00114 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classitk_1_1LeafTreeIterator.html">LeafTreeIterator<TTreeType>::ValueType</a>&
<a name="l00115"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#8f954f7f10c62dd8c88696623d7a0d21">00115</a> <a class="code" href="classitk_1_1LeafTreeIterator.html#8f954f7f10c62dd8c88696623d7a0d21">LeafTreeIterator<TTreeType>::Next</a>()
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 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">TreeNodeType</a>* <span class="keyword">></span>(FindNextNode());
<a name="l00118"></a>00118 <span class="keywordflow">return</span> this-><a class="code" href="classitk_1_1TreeIteratorBase.html#1f8dc297bede328c8cb023c8a2bd856f">m_Position</a>-><a class="code" href="classitk_1_1TreeNode.html#9ad991167a2051ccc55f2d299d811f7d">Get</a>();
<a name="l00119"></a>00119 }
<a name="l00121"></a>00121
<a name="l00123"></a>00123 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00124"></a>00124 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classitk_1_1TreeNode.html">LeafTreeIterator<TTreeType>::TreeNodeType</a>*
<a name="l00125"></a>00125 <a class="code" href="classitk_1_1LeafTreeIterator.html">LeafTreeIterator<TTreeType>::FindNextNode</a>()<span class="keyword"> const </span>
<a name="l00126"></a>00126 <span class="keyword"></span>{
<a name="l00127"></a>00127 <a class="code" href="classitk_1_1PreOrderTreeIterator.html">PreOrderTreeIterator<TTreeType></a> it(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="l00128"></a>00128 ++it; <span class="comment">// go next</span>
<a name="l00129"></a>00129 <span class="keywordflow">if</span>(it.IsAtEnd())
<a name="l00130"></a>00130 {
<a name="l00131"></a>00131 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00132"></a>00132 }
<a name="l00134"></a>00134
<a name="l00135"></a>00135 <span class="keywordflow">if</span>(!it.HasChild())
<a name="l00136"></a>00136 {
<a name="l00137"></a>00137 <span class="keywordflow">return</span> it.GetNode();
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="keywordflow">while</span>( !it.IsAtEnd() )
<a name="l00141"></a>00141 {
<a name="l00142"></a>00142 <span class="keywordflow">if</span>(!it.HasChild())
<a name="l00143"></a>00143 {
<a name="l00144"></a>00144 <span class="keywordflow">return</span> it.GetNode();
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146 ++it;
<a name="l00147"></a>00147 }
<a name="l00148"></a>00148
<a name="l00149"></a>00149 <span class="keywordflow">return</span> <a class="code" href="itkVoronoiDiagram2D_8h.html#070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;
<a name="l00150"></a>00150 }
<a name="l00151"></a>00151
<a name="l00153"></a>00153 <span class="keyword">template</span> <<span class="keyword">class</span> TTreeType>
<a name="l00154"></a><a class="code" href="classitk_1_1LeafTreeIterator.html#9cd738203f93a5f12832b5fc8c69e430">00154</a> <a class="code" href="classitk_1_1TreeIteratorBase.html">TreeIteratorBase<TTreeType></a>* <a class="code" href="classitk_1_1LeafTreeIterator.html#9cd738203f93a5f12832b5fc8c69e430">LeafTreeIterator<TTreeType>::Clone</a>()
<a name="l00155"></a>00155 {
<a name="l00156"></a>00156 <a class="code" href="classitk_1_1LeafTreeIterator.html">LeafTreeIterator<TTreeType></a>* clone = <span class="keyword">new</span> <a class="code" href="classitk_1_1LeafTreeIterator.html">LeafTreeIterator<TTreeType></a>( this-><a class="code" href="classitk_1_1TreeIteratorBase.html#f76505d30f77905f8aa6d8861154d162">m_Tree</a> );
<a name="l00157"></a>00157 *clone = *<span class="keyword">this</span>;
<a name="l00158"></a>00158 <span class="keywordflow">return</span> clone;
<a name="l00159"></a>00159 }
<a name="l00161"></a>00161
<a name="l00162"></a>00162 } <span class="comment">// end namespace itk</span>
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="preprocessor">#endif</span>
<a name="l00165"></a>00165 <span class="preprocessor"></span>
</pre></div></div>
<hr><address><small>
Generated at Thu May 7 23:24:42 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
>
16314
