<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>steghide: EdgeIterator Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
</div>
<div class="contents">
<h1>EdgeIterator Class Reference</h1><!-- doxytag: class="EdgeIterator" -->allows an iteration trough all edges of a vertex
<a href="#_details">More...</a>
<p>
<code>#include <<a class="el" href="EdgeIterator_8h_source.html">EdgeIterator.h</a>></code>
<p>
<p>
<a href="classEdgeIterator-members.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Types</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">enum </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> { <a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a>,
<a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f06bb450ad4fec4b63fa6a16fa01a68d9">SAMPLEVALUE</a>
}</td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#7e5d6b76060848a91db6b0571bdadbb8">EdgeIterator</a> (void)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#d52ffe34e5776d9ca5daebc2c8a1762d">EdgeIterator</a> (<a class="el" href="classVertex.html">Vertex</a> *v, <a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> m=SAMPLEOCCURENCE)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#8f7fdb7b330eec99bfe759e1be060dc4">EdgeIterator</a> (const <a class="el" href="classEdgeIterator.html">EdgeIterator</a> &eit)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#19c446b13783b0db2e9330b3982c4aac">~EdgeIterator</a> (void)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">const <a class="el" href="classEdge.html">Edge</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#2f0deb27623cdeaa1111de158464a129">operator*</a> (void) const </td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#4ddd6595ef896f8137897745883baeaf">operator++</a> (void)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#913b73da861648481ae7d74d927f9466">reset</a> (<a class="el" href="classVertex.html">Vertex</a> *v, <a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> m=SAMPLEOCCURENCE)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#2db46e5ab5973dcc5ea40c9dcccdd225">reset</a> (<a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> m=SAMPLEOCCURENCE)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#50a331aec745268d42aa8ea1648296ba">isFinished</a> (void) const </td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="common_8h.html#b9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#b82df937345f9222d5d43aa70c62794e">getPartnerVertexLabel</a> (void) const </td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#351a6e62bcee78b15bd39ff657b22e6a">print</a> (unsigned short spc=0) const </td></tr>
<tr><td colspan="2"><br><h2>Static Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#60d3b8bc61a31c440cdb3566d05cb8c8">getMaxNumEdges</a> (void)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#134f9df6962195c8630db2321b3f39c4">setMaxNumEdges</a> (<a class="el" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> mne)</td></tr>
<tr><td colspan="2"><br><h2>Private Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#c311721ce85f5301e76edc29b0504d53">findNextEdge</a> (void)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#5784525651bdb8d0f68171378d79a337">isDestSampleValueOK</a> (const <a class="el" href="classSampleValue.html">SampleValue</a> *sv)</td></tr>
<tr><td colspan="2"><br><h2>Private Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classEdge.html">Edge</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#5bfdc881c10c2e7f1f427143fe085319">CurrentEdge</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">the current edge (is returned by operator*) <a href="#5bfdc881c10c2e7f1f427143fe085319"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#b48d3dfdc5004cec669c9dc04c069c77">Mode</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">mode of iteration <a href="#b48d3dfdc5004cec669c9dc04c069c77"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long * </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#15657a537da3adaba5977db8d2f30743">SVALIndices</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">contains (for every sample value) an index to the current opposite neighbour <a href="#15657a537da3adaba5977db8d2f30743"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#6f8659a01c46698ae37fb4a929d2bfa7">EdgeIndex</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">the index/number of the edge that is currently returned by operator* <a href="#6f8659a01c46698ae37fb4a929d2bfa7"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#0eb7a498646e95059198ad9c6b2e4a0a">Finished</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">is true iff there are no more edges for this source vertex <a href="#0eb7a498646e95059198ad9c6b2e4a0a"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">std::list< <a class="el" href="classSampleOccurence.html">SampleOccurence</a> ><br class="typebreak">
::const_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#b23539c65c464b0f88e81f402124101c">SampleOccurenceIt</a></td></tr>
<tr><td colspan="2"><br><h2>Static Private Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#66f4a506bb6682d79385d89e8dcbc1d7">MaxNumEdges</a> = UWORD32_MAX</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">the maximum number of edges the <a class="el" href="classEdgeIterator.html" title="allows an iteration trough all edges of a vertex">EdgeIterator</a> should iterate through <a href="#66f4a506bb6682d79385d89e8dcbc1d7"></a><br></td></tr>
</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
The <a class="el" href="classVertex.html" title="a vertex in a graph">Vertex</a> that is the source for all edges is called "source vertex". The order of the iteration through the edges is from the shortest to the longest edge. If two edges have the same length they are ordered the same way as the corresponding entries in the sample value adjacency lists (for different sample values) respectivly the destination sample occurences in the SampleOccurences data structure (for the same sample value).<p>
<a class="el" href="classEdgeIterator.html" title="allows an iteration trough all edges of a vertex">EdgeIterator</a> uses an SampleOccurence::const_iterator to store information about the current edge. <a class="el" href="classGraph.html" title="a graph constructed from a cover file and a message to be embedded">Graph</a>::(un)markDeletedSampleOccurence can invalidate such iterators. It is therefore not a good idea to use EdgeIterators at the same time as the <a class="el" href="classGraph.html" title="a graph constructed from a cover file and a message to be embedded">Graph</a>::(un)markDeletedSampleOccurence functionality.<p>
<b>NOTE:</b> <a class="el" href="classEdgeIterator.html" title="allows an iteration trough all edges of a vertex">EdgeIterator</a> relies on the <a class="el" href="classGlobals.html" title="some useful pointers that should be global">Globals</a> object pointed to by the Globs pointer. This means that it must be set correctly before using any method of an <a class="el" href="classEdgeIterator.html" title="allows an iteration trough all edges of a vertex">EdgeIterator</a> object. <hr><h2>Member Enumeration Documentation</h2>
<a class="anchor" name="1e6b8b43d1620445bf945f667a38f06f"></a><!-- doxytag: member="EdgeIterator::ITERATIONMODE" ref="1e6b8b43d1620445bf945f667a38f06f" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">enum <a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<dl compact><dt><b>Enumerator: </b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"><em><a class="anchor" name="1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6"></a><!-- doxytag: member="SAMPLEOCCURENCE" ref="1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6" args="" -->SAMPLEOCCURENCE</em> </td><td>
</td></tr>
<tr><td valign="top"><em><a class="anchor" name="1e6b8b43d1620445bf945f667a38f06f06bb450ad4fec4b63fa6a16fa01a68d9"></a><!-- doxytag: member="SAMPLEVALUE" ref="1e6b8b43d1620445bf945f667a38f06f06bb450ad4fec4b63fa6a16fa01a68d9" args="" -->SAMPLEVALUE</em> </td><td>
</td></tr>
</table>
</dl>
</div>
</div><p>
<hr><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" name="7e5d6b76060848a91db6b0571bdadbb8"></a><!-- doxytag: member="EdgeIterator::EdgeIterator" ref="7e5d6b76060848a91db6b0571bdadbb8" args="(void)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">EdgeIterator::EdgeIterator </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
the default contructor - does not create a valid object
</div>
</div><p>
<a class="anchor" name="d52ffe34e5776d9ca5daebc2c8a1762d"></a><!-- doxytag: member="EdgeIterator::EdgeIterator" ref="d52ffe34e5776d9ca5daebc2c8a1762d" args="(Vertex *v, ITERATIONMODE m=SAMPLEOCCURENCE)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">EdgeIterator::EdgeIterator </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classVertex.html">Vertex</a> * </td>
<td class="paramname"> <em>v</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> </td>
<td class="paramname"> <em>m</em> = <code>SAMPLEOCCURENCE</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>v</em> </td><td>the source vertex </td></tr>
</table>
</dl>
</div>
</div><p>
<a class="anchor" name="8f7fdb7b330eec99bfe759e1be060dc4"></a><!-- doxytag: member="EdgeIterator::EdgeIterator" ref="8f7fdb7b330eec99bfe759e1be060dc4" args="(const EdgeIterator &eit)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">EdgeIterator::EdgeIterator </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classEdgeIterator.html">EdgeIterator</a> & </td>
<td class="paramname"> <em>eit</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
the copy constructor
</div>
</div><p>
<a class="anchor" name="19c446b13783b0db2e9330b3982c4aac"></a><!-- doxytag: member="EdgeIterator::~EdgeIterator" ref="19c446b13783b0db2e9330b3982c4aac" args="(void)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">EdgeIterator::~EdgeIterator </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="c311721ce85f5301e76edc29b0504d53"></a><!-- doxytag: member="EdgeIterator::findNextEdge" ref="c311721ce85f5301e76edc29b0504d53" args="(void)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void EdgeIterator::findNextEdge </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
find the shortest edge, starting the search at SVOppNeighsIndices[0...k] set the private variables accordingly is only called to find a new destination sample value, i.e. if one of the SVOppNeighsIndices[i] is changed
</div>
</div><p>
<a class="anchor" name="60d3b8bc61a31c440cdb3566d05cb8c8"></a><!-- doxytag: member="EdgeIterator::getMaxNumEdges" ref="60d3b8bc61a31c440cdb3566d05cb8c8" args="(void)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> EdgeIterator::getMaxNumEdges </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline, static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="b82df937345f9222d5d43aa70c62794e"></a><!-- doxytag: member="EdgeIterator::getPartnerVertexLabel" ref="b82df937345f9222d5d43aa70c62794e" args="(void) const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="common_8h.html#b9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> EdgeIterator::getPartnerVertexLabel </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
get the label of the partner vertex <dl class="return" compact><dt><b>Returns:</b></dt><dd>the label of the vertex that builds the edge returned by operator* together with SrcVertex </dd></dl>
</div>
</div><p>
<a class="anchor" name="5784525651bdb8d0f68171378d79a337"></a><!-- doxytag: member="EdgeIterator::isDestSampleValueOK" ref="5784525651bdb8d0f68171378d79a337" args="(const SampleValue *sv)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool EdgeIterator::isDestSampleValueOK </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classSampleValue.html">SampleValue</a> * </td>
<td class="paramname"> <em>sv</em> </td>
<td> ) </td>
<td><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>true iff there is a sample with value sv that is part of an edge starting at SrcVertex </dd></dl>
</div>
</div><p>
<a class="anchor" name="50a331aec745268d42aa8ea1648296ba"></a><!-- doxytag: member="EdgeIterator::isFinished" ref="50a331aec745268d42aa8ea1648296ba" args="(void) const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool EdgeIterator::isFinished </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>true iff this <a class="el" href="classEdgeIterator.html" title="allows an iteration trough all edges of a vertex">EdgeIterator</a> points to the end of the list of edges of SrcVertex </dd></dl>
</div>
</div><p>
<a class="anchor" name="2f0deb27623cdeaa1111de158464a129"></a><!-- doxytag: member="EdgeIterator::operator*" ref="2f0deb27623cdeaa1111de158464a129" args="(void) const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">const <a class="el" href="classEdge.html">Edge</a>* EdgeIterator::operator* </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"> </td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
get the current edge <dl class="return" compact><dt><b>Returns:</b></dt><dd>the edge that is described by the current status of this <a class="el" href="classEdgeIterator.html" title="allows an iteration trough all edges of a vertex">EdgeIterator</a> </dd></dl>
</div>
</div><p>
<a class="anchor" name="4ddd6595ef896f8137897745883baeaf"></a><!-- doxytag: member="EdgeIterator::operator++" ref="4ddd6595ef896f8137897745883baeaf" args="(void)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void EdgeIterator::operator++ </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
set this iterator to next edge
</div>
</div><p>
<a class="anchor" name="351a6e62bcee78b15bd39ff657b22e6a"></a><!-- doxytag: member="EdgeIterator::print" ref="351a6e62bcee78b15bd39ff657b22e6a" args="(unsigned short spc=0) const " -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void EdgeIterator::print </td>
<td>(</td>
<td class="paramtype">unsigned short </td>
<td class="paramname"> <em>spc</em> = <code>0</code> </td>
<td> ) </td>
<td> const</td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="2db46e5ab5973dcc5ea40c9dcccdd225"></a><!-- doxytag: member="EdgeIterator::reset" ref="2db46e5ab5973dcc5ea40c9dcccdd225" args="(ITERATIONMODE m=SAMPLEOCCURENCE)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void EdgeIterator::reset </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> </td>
<td class="paramname"> <em>m</em> = <code>SAMPLEOCCURENCE</code> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
reset this iterator to first (shortest) edge
</div>
</div><p>
<a class="anchor" name="913b73da861648481ae7d74d927f9466"></a><!-- doxytag: member="EdgeIterator::reset" ref="913b73da861648481ae7d74d927f9466" args="(Vertex *v, ITERATIONMODE m=SAMPLEOCCURENCE)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void EdgeIterator::reset </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classVertex.html">Vertex</a> * </td>
<td class="paramname"> <em>v</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> </td>
<td class="paramname"> <em>m</em> = <code>SAMPLEOCCURENCE</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
set this iterator to first (shortest) edge of vertex v <dl compact><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>v</em> </td><td>new vertex (don't change if it is NULL) </td></tr>
</table>
</dl>
</div>
</div><p>
<a class="anchor" name="134f9df6962195c8630db2321b3f39c4"></a><!-- doxytag: member="EdgeIterator::setMaxNumEdges" ref="134f9df6962195c8630db2321b3f39c4" args="(UWORD32 mne)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static void EdgeIterator::setMaxNumEdges </td>
<td>(</td>
<td class="paramtype"><a class="el" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> </td>
<td class="paramname"> <em>mne</em> </td>
<td> ) </td>
<td><code> [inline, static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="5bfdc881c10c2e7f1f427143fe085319"></a><!-- doxytag: member="EdgeIterator::CurrentEdge" ref="5bfdc881c10c2e7f1f427143fe085319" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classEdge.html">Edge</a> <a class="el" href="classEdgeIterator.html#5bfdc881c10c2e7f1f427143fe085319">EdgeIterator::CurrentEdge</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="6f8659a01c46698ae37fb4a929d2bfa7"></a><!-- doxytag: member="EdgeIterator::EdgeIndex" ref="6f8659a01c46698ae37fb4a929d2bfa7" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> <a class="el" href="classEdgeIterator.html#6f8659a01c46698ae37fb4a929d2bfa7">EdgeIterator::EdgeIndex</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="0eb7a498646e95059198ad9c6b2e4a0a"></a><!-- doxytag: member="EdgeIterator::Finished" ref="0eb7a498646e95059198ad9c6b2e4a0a" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classEdgeIterator.html#0eb7a498646e95059198ad9c6b2e4a0a">EdgeIterator::Finished</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="66f4a506bb6682d79385d89e8dcbc1d7"></a><!-- doxytag: member="EdgeIterator::MaxNumEdges" ref="66f4a506bb6682d79385d89e8dcbc1d7" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> <a class="el" href="classEdgeIterator.html#66f4a506bb6682d79385d89e8dcbc1d7">EdgeIterator::MaxNumEdges</a> = UWORD32_MAX<code> [static, private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="b48d3dfdc5004cec669c9dc04c069c77"></a><!-- doxytag: member="EdgeIterator::Mode" ref="b48d3dfdc5004cec669c9dc04c069c77" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> <a class="el" href="classEdgeIterator.html#b48d3dfdc5004cec669c9dc04c069c77">EdgeIterator::Mode</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="b23539c65c464b0f88e81f402124101c"></a><!-- doxytag: member="EdgeIterator::SampleOccurenceIt" ref="b23539c65c464b0f88e81f402124101c" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">std::list<<a class="el" href="classSampleOccurence.html">SampleOccurence</a>>::const_iterator <a class="el" href="classEdgeIterator.html#b23539c65c464b0f88e81f402124101c">EdgeIterator::SampleOccurenceIt</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
contains the iterator pointing to the sample occurence that constitutes the edge together with SourceVertex/SourceSamleValueIndex
</div>
</div><p>
<a class="anchor" name="15657a537da3adaba5977db8d2f30743"></a><!-- doxytag: member="EdgeIterator::SVALIndices" ref="15657a537da3adaba5977db8d2f30743" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">unsigned long* <a class="el" href="classEdgeIterator.html#15657a537da3adaba5977db8d2f30743">EdgeIterator::SVALIndices</a><code> [private]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<hr>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="EdgeIterator_8h_source.html">EdgeIterator.h</a><li><a class="el" href="EdgeIterator_8cc.html">EdgeIterator.cc</a></ul>
</div>
<hr size="1"><address style="text-align: right;"><small>Generated on Mon Aug 17 10:58:31 2009 for steghide by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.9 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
7392c77c84ff25edfeb07995a77d5148
>
files
>
394
