<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.5"/>
<title>steghide: EdgeIterator Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">steghide
 <span id="projectnumber">0.5.1</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<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 id="navrow2" class="tabs2">
<ul class="tablist">
<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><!-- top -->
<div class="header">
<div class="summary">
<a href="#pub-types">Public Types</a> |
<a href="#pub-methods">Public Member Functions</a> |
<a href="#pub-static-methods">Static Public Member Functions</a> |
<a href="#pri-methods">Private Member Functions</a> |
<a href="#pri-attribs">Private Attributes</a> |
<a href="#pri-static-attribs">Static Private Attributes</a> |
<a href="classEdgeIterator-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">EdgeIterator Class Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>allows an iteration trough all edges of a vertex
<a href="classEdgeIterator.html#details">More...</a></p>
<p><code>#include <<a class="el" href="EdgeIterator_8h_source.html">EdgeIterator.h</a>></code></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:a1e6b8b43d1620445bf945f667a38f06f"><td class="memItemLeft" align="right" valign="top">enum  </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> { <a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a>,
<a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa06bb450ad4fec4b63fa6a16fa01a68d9">SAMPLEVALUE</a>
}</td></tr>
<tr class="separator:a1e6b8b43d1620445bf945f667a38f06f"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a7e5d6b76060848a91db6b0571bdadbb8"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a7e5d6b76060848a91db6b0571bdadbb8">EdgeIterator</a> (void)</td></tr>
<tr class="separator:a7e5d6b76060848a91db6b0571bdadbb8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad52ffe34e5776d9ca5daebc2c8a1762d"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#ad52ffe34e5776d9ca5daebc2c8a1762d">EdgeIterator</a> (<a class="el" href="classVertex.html">Vertex</a> *v, <a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> m=<a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a>)</td></tr>
<tr class="separator:ad52ffe34e5776d9ca5daebc2c8a1762d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8f7fdb7b330eec99bfe759e1be060dc4"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a8f7fdb7b330eec99bfe759e1be060dc4">EdgeIterator</a> (const <a class="el" href="classEdgeIterator.html">EdgeIterator</a> &eit)</td></tr>
<tr class="separator:a8f7fdb7b330eec99bfe759e1be060dc4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a19c446b13783b0db2e9330b3982c4aac"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a19c446b13783b0db2e9330b3982c4aac">~EdgeIterator</a> (void)</td></tr>
<tr class="separator:a19c446b13783b0db2e9330b3982c4aac"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2f0deb27623cdeaa1111de158464a129"><td class="memItemLeft" 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#a2f0deb27623cdeaa1111de158464a129">operator*</a> (void) const </td></tr>
<tr class="separator:a2f0deb27623cdeaa1111de158464a129"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4ddd6595ef896f8137897745883baeaf"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a4ddd6595ef896f8137897745883baeaf">operator++</a> (void)</td></tr>
<tr class="separator:a4ddd6595ef896f8137897745883baeaf"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a913b73da861648481ae7d74d927f9466"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a913b73da861648481ae7d74d927f9466">reset</a> (<a class="el" href="classVertex.html">Vertex</a> *v, <a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> m=<a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a>)</td></tr>
<tr class="separator:a913b73da861648481ae7d74d927f9466"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2db46e5ab5973dcc5ea40c9dcccdd225"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a2db46e5ab5973dcc5ea40c9dcccdd225">reset</a> (<a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> m=<a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a>)</td></tr>
<tr class="separator:a2db46e5ab5973dcc5ea40c9dcccdd225"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a50a331aec745268d42aa8ea1648296ba"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a50a331aec745268d42aa8ea1648296ba">isFinished</a> (void) const </td></tr>
<tr class="separator:a50a331aec745268d42aa8ea1648296ba"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab82df937345f9222d5d43aa70c62794e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="common_8h.html#ab9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#ab82df937345f9222d5d43aa70c62794e">getPartnerVertexLabel</a> (void) const </td></tr>
<tr class="separator:ab82df937345f9222d5d43aa70c62794e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a351a6e62bcee78b15bd39ff657b22e6a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a351a6e62bcee78b15bd39ff657b22e6a">print</a> (unsigned short spc=0) const </td></tr>
<tr class="separator:a351a6e62bcee78b15bd39ff657b22e6a"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-static-methods"></a>
Static Public Member Functions</h2></td></tr>
<tr class="memitem:a60d3b8bc61a31c440cdb3566d05cb8c8"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a60d3b8bc61a31c440cdb3566d05cb8c8">getMaxNumEdges</a> (void)</td></tr>
<tr class="separator:a60d3b8bc61a31c440cdb3566d05cb8c8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a134f9df6962195c8630db2321b3f39c4"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a134f9df6962195c8630db2321b3f39c4">setMaxNumEdges</a> (<a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> mne)</td></tr>
<tr class="separator:a134f9df6962195c8630db2321b3f39c4"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:ac311721ce85f5301e76edc29b0504d53"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#ac311721ce85f5301e76edc29b0504d53">findNextEdge</a> (void)</td></tr>
<tr class="separator:ac311721ce85f5301e76edc29b0504d53"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5784525651bdb8d0f68171378d79a337"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a5784525651bdb8d0f68171378d79a337">isDestSampleValueOK</a> (const <a class="el" href="classSampleValue.html">SampleValue</a> *sv)</td></tr>
<tr class="separator:a5784525651bdb8d0f68171378d79a337"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a5bfdc881c10c2e7f1f427143fe085319"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classEdge.html">Edge</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a5bfdc881c10c2e7f1f427143fe085319">CurrentEdge</a></td></tr>
<tr class="memdesc:a5bfdc881c10c2e7f1f427143fe085319"><td class="mdescLeft"> </td><td class="mdescRight">the current edge (is returned by operator*) <a href="#a5bfdc881c10c2e7f1f427143fe085319">More...</a><br/></td></tr>
<tr class="separator:a5bfdc881c10c2e7f1f427143fe085319"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab48d3dfdc5004cec669c9dc04c069c77"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#ab48d3dfdc5004cec669c9dc04c069c77">Mode</a></td></tr>
<tr class="memdesc:ab48d3dfdc5004cec669c9dc04c069c77"><td class="mdescLeft"> </td><td class="mdescRight">mode of iteration <a href="#ab48d3dfdc5004cec669c9dc04c069c77">More...</a><br/></td></tr>
<tr class="separator:ab48d3dfdc5004cec669c9dc04c069c77"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a15657a537da3adaba5977db8d2f30743"><td class="memItemLeft" align="right" valign="top">unsigned long * </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a15657a537da3adaba5977db8d2f30743">SVALIndices</a></td></tr>
<tr class="memdesc:a15657a537da3adaba5977db8d2f30743"><td class="mdescLeft"> </td><td class="mdescRight">contains (for every sample value) an index to the current opposite neighbour <a href="#a15657a537da3adaba5977db8d2f30743">More...</a><br/></td></tr>
<tr class="separator:a15657a537da3adaba5977db8d2f30743"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6f8659a01c46698ae37fb4a929d2bfa7"><td class="memItemLeft" align="right" valign="top"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a6f8659a01c46698ae37fb4a929d2bfa7">EdgeIndex</a></td></tr>
<tr class="memdesc:a6f8659a01c46698ae37fb4a929d2bfa7"><td class="mdescLeft"> </td><td class="mdescRight">the index/number of the edge that is currently returned by operator* <a href="#a6f8659a01c46698ae37fb4a929d2bfa7">More...</a><br/></td></tr>
<tr class="separator:a6f8659a01c46698ae37fb4a929d2bfa7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0eb7a498646e95059198ad9c6b2e4a0a"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a0eb7a498646e95059198ad9c6b2e4a0a">Finished</a></td></tr>
<tr class="memdesc:a0eb7a498646e95059198ad9c6b2e4a0a"><td class="mdescLeft"> </td><td class="mdescRight">is true iff there are no more edges for this source vertex <a href="#a0eb7a498646e95059198ad9c6b2e4a0a">More...</a><br/></td></tr>
<tr class="separator:a0eb7a498646e95059198ad9c6b2e4a0a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab23539c65c464b0f88e81f402124101c"><td class="memItemLeft" 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#ab23539c65c464b0f88e81f402124101c">SampleOccurenceIt</a></td></tr>
<tr class="separator:ab23539c65c464b0f88e81f402124101c"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-static-attribs"></a>
Static Private Attributes</h2></td></tr>
<tr class="memitem:a66f4a506bb6682d79385d89e8dcbc1d7"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classEdgeIterator.html#a66f4a506bb6682d79385d89e8dcbc1d7">MaxNumEdges</a> = <a class="el" href="common_8h.html#a7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a></td></tr>
<tr class="memdesc:a66f4a506bb6682d79385d89e8dcbc1d7"><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="#a66f4a506bb6682d79385d89e8dcbc1d7">More...</a><br/></td></tr>
<tr class="separator:a66f4a506bb6682d79385d89e8dcbc1d7"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>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>
<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>
<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. </p>
</div><h2 class="groupheader">Member Enumeration Documentation</h2>
<a class="anchor" id="a1e6b8b43d1620445bf945f667a38f06f"></a>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">enum <a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a></td>
</tr>
</table>
</div><div class="memdoc">
<table class="fieldtable">
<tr><th colspan="2">Enumerator</th></tr><tr><td class="fieldname"><em><a class="anchor" id="a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6"></a>SAMPLEOCCURENCE</em> </td><td class="fielddoc">
</td></tr>
<tr><td class="fieldname"><em><a class="anchor" id="a1e6b8b43d1620445bf945f667a38f06fa06bb450ad4fec4b63fa6a16fa01a68d9"></a>SAMPLEVALUE</em> </td><td class="fielddoc">
</td></tr>
</table>
</div>
</div>
<h2 class="groupheader">Constructor & Destructor Documentation</h2>
<a class="anchor" id="a7e5d6b76060848a91db6b0571bdadbb8"></a>
<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 </p>
</div>
</div>
<a class="anchor" id="ad52ffe34e5776d9ca5daebc2c8a1762d"></a>
<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#a1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> </td>
<td class="paramname"><em>m</em> = <code><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a></code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">v</td><td>the source vertex </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a class="anchor" id="a8f7fdb7b330eec99bfe759e1be060dc4"></a>
<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 </p>
</div>
</div>
<a class="anchor" id="a19c446b13783b0db2e9330b3982c4aac"></a>
<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">
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a class="anchor" id="ac311721ce85f5301e76edc29b0504d53"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<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></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </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 </p>
</div>
</div>
<a class="anchor" id="a60d3b8bc61a31c440cdb3566d05cb8c8"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> EdgeIterator::getMaxNumEdges </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a class="anchor" id="ab82df937345f9222d5d43aa70c62794e"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="common_8h.html#ab9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> EdgeIterator::getPartnerVertexLabel </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>get the label of the partner vertex </p>
<dl class="section return"><dt>Returns</dt><dd>the label of the vertex that builds the edge returned by operator* together with SrcVertex </dd></dl>
</div>
</div>
<a class="anchor" id="a5784525651bdb8d0f68171378d79a337"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<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></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<dl class="section return"><dt>Returns</dt><dd>true iff there is a sample with value sv that is part of an edge starting at SrcVertex </dd></dl>
</div>
</div>
<a class="anchor" id="a50a331aec745268d42aa8ea1648296ba"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<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</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<dl class="section return"><dt>Returns</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>
<a class="anchor" id="a2f0deb27623cdeaa1111de158464a129"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<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</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>get the current edge </p>
<dl class="section return"><dt>Returns</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>
<a class="anchor" id="a4ddd6595ef896f8137897745883baeaf"></a>
<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 </p>
</div>
</div>
<a class="anchor" id="a351a6e62bcee78b15bd39ff657b22e6a"></a>
<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">
</div>
</div>
<a class="anchor" id="a913b73da861648481ae7d74d927f9466"></a>
<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#a1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> </td>
<td class="paramname"><em>m</em> = <code><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a></code> </td>
</tr>
<tr>
<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 </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">v</td><td>new vertex (don't change if it is NULL) </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a class="anchor" id="a2db46e5ab5973dcc5ea40c9dcccdd225"></a>
<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#a1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> </td>
<td class="paramname"><em>m</em> = <code><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a></code></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>reset this iterator to first (shortest) edge </p>
</div>
</div>
<a class="anchor" id="a134f9df6962195c8630db2321b3f39c4"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void EdgeIterator::setMaxNumEdges </td>
<td>(</td>
<td class="paramtype"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> </td>
<td class="paramname"><em>mne</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a class="anchor" id="a5bfdc881c10c2e7f1f427143fe085319"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classEdge.html">Edge</a> EdgeIterator::CurrentEdge</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a class="anchor" id="a6f8659a01c46698ae37fb4a929d2bfa7"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> EdgeIterator::EdgeIndex</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a class="anchor" id="a0eb7a498646e95059198ad9c6b2e4a0a"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool EdgeIterator::Finished</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a class="anchor" id="a66f4a506bb6682d79385d89e8dcbc1d7"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> EdgeIterator::MaxNumEdges = <a class="el" href="common_8h.html#a7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a class="anchor" id="ab48d3dfdc5004cec669c9dc04c069c77"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> EdgeIterator::Mode</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a class="anchor" id="ab23539c65c464b0f88e81f402124101c"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::list<<a class="el" href="classSampleOccurence.html">SampleOccurence</a>>::const_iterator EdgeIterator::SampleOccurenceIt</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>contains the iterator pointing to the sample occurence that constitutes the edge together with SourceVertex/SourceSamleValueIndex </p>
</div>
</div>
<a class="anchor" id="a15657a537da3adaba5977db8d2f30743"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">unsigned long* EdgeIterator::SVALIndices</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<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>
<li><a class="el" href="EdgeIterator_8cc.html">EdgeIterator.cc</a></li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Oct 18 2013 17:59:37 for steghide by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.5
</small></address>
</body>
</html>
distrib
>
Mageia
>
4
>
i586
>
media
>
core-release
>
by-pkgid
>
2a90dcd9dfcd284ddf6dc3b0a0b0bf47
>
files
>
398
