Sophie

Sophie

distrib > Mandriva > 2010.0 > i586 > media > contrib-release > by-pkgid > 7392c77c84ff25edfeb07995a77d5148 > files > 114

steghide-0.5.1-11mdv2010.0.i586.rpm

<!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.h Source File</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&nbsp;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div class="tabs">
    <ul>
      <li><a href="files.html"><span>File&nbsp;List</span></a></li>
      <li><a href="globals.html"><span>File&nbsp;Members</span></a></li>
    </ul>
  </div>
<h1>EdgeIterator.h</h1><a href="EdgeIterator_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"> * steghide 0.5.1 - a steganography program</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (C) 1999-2003 Stefan Hetzl &lt;shetzl@chello.at&gt;</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * This program is free software; you can redistribute it and/or</span>
<a name="l00006"></a>00006 <span class="comment"> * modify it under the terms of the GNU General Public License</span>
<a name="l00007"></a>00007 <span class="comment"> * as published by the Free Software Foundation; either version 2</span>
<a name="l00008"></a>00008 <span class="comment"> * of the License, or (at your option) any later version.</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * This program is distributed in the hope that it will be useful,</span>
<a name="l00011"></a>00011 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00012"></a>00012 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00013"></a>00013 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00014"></a>00014 <span class="comment"> *</span>
<a name="l00015"></a>00015 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00016"></a>00016 <span class="comment"> * along with this program; if not, write to the Free Software</span>
<a name="l00017"></a>00017 <span class="comment"> * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.</span>
<a name="l00018"></a>00018 <span class="comment"> *</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef SH_EDGEITERATOR_H</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define SH_EDGEITERATOR_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include &lt;list&gt;</span>
<a name="l00025"></a>00025 
<a name="l00026"></a>00026 <span class="preprocessor">#include "<a class="code" href="Edge_8h.html">Edge.h</a>"</span>
<a name="l00027"></a>00027 <span class="keyword">class </span><a class="code" href="classGraph.html" title="a graph constructed from a cover file and a message to be embedded">Graph</a> ;
<a name="l00028"></a>00028 <span class="preprocessor">#include "<a class="code" href="SampleOccurence_8h.html">SampleOccurence.h</a>"</span>
<a name="l00029"></a>00029 <span class="keyword">class </span><a class="code" href="classSampleValue.html" title="the value of a sample in a CvrStgFile">SampleValue</a> ;
<a name="l00030"></a>00030 <span class="keyword">class </span><a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> ;
<a name="l00031"></a>00031 
<a name="l00051"></a><a class="code" href="classEdgeIterator.html">00051</a> <span class="keyword">class </span><a class="code" href="classEdgeIterator.html" title="allows an iteration trough all edges of a vertex">EdgeIterator</a> {
<a name="l00052"></a>00052         <span class="keyword">public</span>:
<a name="l00053"></a><a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">00053</a>         <span class="keyword">enum</span> <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> {
<a name="l00054"></a><a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6">00054</a>                 <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a>,        <span class="comment">// incrementing increments to next sample occurence (possibly of the same sample value) thus using every edge of the source vertex</span>
<a name="l00055"></a><a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f06bb450ad4fec4b63fa6a16fa01a68d9">00055</a>                 <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f06bb450ad4fec4b63fa6a16fa01a68d9">SAMPLEVALUE</a>             <span class="comment">// incrementing increments to the next sample value thus not using all edges in general</span>
<a name="l00056"></a>00056         } ;
<a name="l00057"></a>00057 
<a name="l00061"></a>00061         <a class="code" href="classEdgeIterator.html#7e5d6b76060848a91db6b0571bdadbb8">EdgeIterator</a> (<span class="keywordtype">void</span>) ;
<a name="l00062"></a>00062 
<a name="l00066"></a>00066         <a class="code" href="classEdgeIterator.html#7e5d6b76060848a91db6b0571bdadbb8">EdgeIterator</a> (<a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a> *v, <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> m = <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a>) ;
<a name="l00067"></a>00067 
<a name="l00071"></a>00071         <a class="code" href="classEdgeIterator.html#7e5d6b76060848a91db6b0571bdadbb8">EdgeIterator</a> (<span class="keyword">const</span> <a class="code" href="classEdgeIterator.html" title="allows an iteration trough all edges of a vertex">EdgeIterator</a>&amp; eit) ;
<a name="l00072"></a>00072 
<a name="l00073"></a>00073         <a class="code" href="classEdgeIterator.html#19c446b13783b0db2e9330b3982c4aac">~EdgeIterator</a> (<span class="keywordtype">void</span>) ;
<a name="l00074"></a>00074 
<a name="l00079"></a><a class="code" href="classEdgeIterator.html#2f0deb27623cdeaa1111de158464a129">00079</a>         <span class="keyword">const</span> <a class="code" href="classEdge.html">Edge</a>* <a class="code" href="classEdgeIterator.html#2f0deb27623cdeaa1111de158464a129">operator* </a>(<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00080"></a>00080 <span class="keyword">                </span>{ <span class="keywordflow">return</span> ((<a class="code" href="classEdgeIterator.html#0eb7a498646e95059198ad9c6b2e4a0a" title="is true iff there are no more edges for this source vertex">Finished</a>) ? NULL : &amp;<a class="code" href="classEdgeIterator.html#5bfdc881c10c2e7f1f427143fe085319" title="the current edge (is returned by operator*)">CurrentEdge</a>) ; }
<a name="l00081"></a>00081 
<a name="l00085"></a>00085         <span class="keywordtype">void</span> <a class="code" href="classEdgeIterator.html#4ddd6595ef896f8137897745883baeaf">operator++ </a>(<span class="keywordtype">void</span>) ;
<a name="l00086"></a>00086 
<a name="l00091"></a>00091         <span class="keywordtype">void</span> <a class="code" href="classEdgeIterator.html#913b73da861648481ae7d74d927f9466">reset</a> (<a class="code" href="classVertex.html" title="a vertex in a graph">Vertex</a>* v, <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> m = <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a>) ;
<a name="l00092"></a>00092 
<a name="l00096"></a>00096         <span class="keywordtype">void</span> <a class="code" href="classEdgeIterator.html#913b73da861648481ae7d74d927f9466">reset</a> (<a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> m = <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f6406f55724d4783ed9a29dc26ffbafc6">SAMPLEOCCURENCE</a>) ;
<a name="l00097"></a>00097 
<a name="l00101"></a><a class="code" href="classEdgeIterator.html#50a331aec745268d42aa8ea1648296ba">00101</a>         <span class="keywordtype">bool</span> <a class="code" href="classEdgeIterator.html#50a331aec745268d42aa8ea1648296ba">isFinished</a> (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00102"></a>00102 <span class="keyword">                </span>{ <span class="keywordflow">return</span> <a class="code" href="classEdgeIterator.html#0eb7a498646e95059198ad9c6b2e4a0a" title="is true iff there are no more edges for this source vertex">Finished</a> ; } ;
<a name="l00103"></a>00103 
<a name="l00108"></a><a class="code" href="classEdgeIterator.html#b82df937345f9222d5d43aa70c62794e">00108</a>         <a class="code" href="common_8h.html#b9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> <a class="code" href="classEdgeIterator.html#b82df937345f9222d5d43aa70c62794e">getPartnerVertexLabel</a> (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00109"></a>00109 <span class="keyword">                </span>{ <span class="keywordflow">return</span> <a class="code" href="classEdgeIterator.html#b23539c65c464b0f88e81f402124101c">SampleOccurenceIt</a>-&gt;getVertex()-&gt;getLabel() ; } ;
<a name="l00110"></a>00110 
<a name="l00111"></a><a class="code" href="classEdgeIterator.html#60d3b8bc61a31c440cdb3566d05cb8c8">00111</a>         <span class="keyword">static</span> <a class="code" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> <a class="code" href="classEdgeIterator.html#60d3b8bc61a31c440cdb3566d05cb8c8">getMaxNumEdges</a> (<span class="keywordtype">void</span>)
<a name="l00112"></a>00112                 { <span class="keywordflow">return</span> <a class="code" href="classEdgeIterator.html#66f4a506bb6682d79385d89e8dcbc1d7" title="the maximum number of edges the EdgeIterator should iterate through">MaxNumEdges</a> ; } ;
<a name="l00113"></a>00113 
<a name="l00114"></a><a class="code" href="classEdgeIterator.html#134f9df6962195c8630db2321b3f39c4">00114</a>         <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classEdgeIterator.html#134f9df6962195c8630db2321b3f39c4">setMaxNumEdges</a> (<a class="code" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> mne)
<a name="l00115"></a>00115                 { <a class="code" href="classEdgeIterator.html#66f4a506bb6682d79385d89e8dcbc1d7" title="the maximum number of edges the EdgeIterator should iterate through">MaxNumEdges</a> = mne ; } ;
<a name="l00116"></a>00116 
<a name="l00117"></a>00117         <span class="keywordtype">void</span> <a class="code" href="classEdgeIterator.html#351a6e62bcee78b15bd39ff657b22e6a">print</a> (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> spc = 0) <span class="keyword">const</span> ;
<a name="l00118"></a>00118 
<a name="l00119"></a>00119         <span class="keyword">private</span>:
<a name="l00121"></a><a class="code" href="classEdgeIterator.html#5bfdc881c10c2e7f1f427143fe085319">00121</a>         <a class="code" href="classEdge.html">Edge</a> <a class="code" href="classEdgeIterator.html#5bfdc881c10c2e7f1f427143fe085319" title="the current edge (is returned by operator*)">CurrentEdge</a> ;
<a name="l00122"></a>00122 
<a name="l00124"></a><a class="code" href="classEdgeIterator.html#b48d3dfdc5004cec669c9dc04c069c77">00124</a>         <a class="code" href="classEdgeIterator.html#1e6b8b43d1620445bf945f667a38f06f">ITERATIONMODE</a> <a class="code" href="classEdgeIterator.html#b48d3dfdc5004cec669c9dc04c069c77" title="mode of iteration">Mode</a> ;
<a name="l00125"></a>00125 
<a name="l00127"></a><a class="code" href="classEdgeIterator.html#15657a537da3adaba5977db8d2f30743">00127</a>         <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>* <a class="code" href="classEdgeIterator.html#15657a537da3adaba5977db8d2f30743" title="contains (for every sample value) an index to the current opposite neighbour">SVALIndices</a> ;
<a name="l00128"></a>00128 
<a name="l00130"></a><a class="code" href="classEdgeIterator.html#66f4a506bb6682d79385d89e8dcbc1d7">00130</a>         <span class="keyword">static</span> <a class="code" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> <a class="code" href="classEdgeIterator.html#66f4a506bb6682d79385d89e8dcbc1d7" title="the maximum number of edges the EdgeIterator should iterate through">MaxNumEdges</a> ;
<a name="l00131"></a>00131 
<a name="l00133"></a><a class="code" href="classEdgeIterator.html#6f8659a01c46698ae37fb4a929d2bfa7">00133</a>         <a class="code" href="common_8h.html#6b8592979b076e06aa233e3f586ac999">UWORD32</a> <a class="code" href="classEdgeIterator.html#6f8659a01c46698ae37fb4a929d2bfa7" title="the index/number of the edge that is currently returned by operator*">EdgeIndex</a> ;
<a name="l00134"></a>00134 
<a name="l00136"></a><a class="code" href="classEdgeIterator.html#0eb7a498646e95059198ad9c6b2e4a0a">00136</a>         <span class="keywordtype">bool</span> <a class="code" href="classEdgeIterator.html#0eb7a498646e95059198ad9c6b2e4a0a" title="is true iff there are no more edges for this source vertex">Finished</a> ;
<a name="l00137"></a>00137 
<a name="l00142"></a><a class="code" href="classEdgeIterator.html#b23539c65c464b0f88e81f402124101c">00142</a>         std::list&lt;SampleOccurence&gt;::const_iterator <a class="code" href="classEdgeIterator.html#b23539c65c464b0f88e81f402124101c">SampleOccurenceIt</a> ;
<a name="l00143"></a>00143 
<a name="l00150"></a>00150         <span class="keywordtype">void</span> <a class="code" href="classEdgeIterator.html#c311721ce85f5301e76edc29b0504d53">findNextEdge</a> (<span class="keywordtype">void</span>) ;
<a name="l00151"></a>00151 
<a name="l00155"></a>00155         <span class="keywordtype">bool</span> <a class="code" href="classEdgeIterator.html#5784525651bdb8d0f68171378d79a337">isDestSampleValueOK</a> (<span class="keyword">const</span> <a class="code" href="classSampleValue.html" title="the value of a sample in a CvrStgFile">SampleValue</a> *sv) ;
<a name="l00156"></a>00156 } ;
<a name="l00157"></a>00157 
<a name="l00158"></a>00158 <span class="preprocessor">#endif // ndef SH_EDGEITERATOR_H</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Mon Aug 17 10:58:29 2009 for steghide by&nbsp;
<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>

Perl :: Catalyst :: PostgreSQL :: RPM Valid HTML 4.01 Transitional