Sophie

Sophie

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

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: DFSAPHeuristicTest.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>DFSAPHeuristicTest.h</h1><a href="DFSAPHeuristicTest_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_DFSAPHEURISTICTEST_H</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define SH_DFSAPHEURISTICTEST_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="keyword">class </span><a class="code" href="classDFSAPHeuristic.html" title="a matching algorithm implementing a heuristic search for augmenting paths">DFSAPHeuristic</a> ;
<a name="l00025"></a>00025 <span class="keyword">class </span><a class="code" href="classBitString.html" title="a string of bits">BitString</a> ;
<a name="l00026"></a>00026 <span class="keyword">class </span><a class="code" href="classCvrStgFile.html" title="a cover-/stego-file">CvrStgFile</a> ;
<a name="l00027"></a>00027 <span class="keyword">class </span><a class="code" href="classMatching.html" title="represent a matching on a graph">Matching</a> ;
<a name="l00028"></a>00028 <span class="keyword">class </span><a class="code" href="classSelector.html" title="a random permutation of a random combination">Selector</a> ;
<a name="l00029"></a>00029 
<a name="l00030"></a>00030 <span class="preprocessor">#include "<a class="code" href="UnitTest_8h.html">UnitTest.h</a>"</span>
<a name="l00031"></a>00031 <span class="preprocessor">#include "<a class="code" href="TestSuite_8h.html">TestSuite.h</a>"</span>
<a name="l00032"></a>00032 
<a name="l00033"></a><a class="code" href="classDFSAPHeuristicTest.html">00033</a> <span class="keyword">class </span><a class="code" href="classDFSAPHeuristicTest.html">DFSAPHeuristicTest</a> : <span class="keyword">public</span> <a class="code" href="classUnitTest.html">UnitTest</a> {
<a name="l00034"></a>00034         <span class="keyword">public</span>:
<a name="l00035"></a>00035         <a class="code" href="classDFSAPHeuristicTest.html#0c88853d5a6970d6f44b9b173c1656cc">DFSAPHeuristicTest</a> (<a class="code" href="classTestSuite.html">TestSuite</a>* s) ;
<a name="l00036"></a>00036 
<a name="l00037"></a>00037         <span class="keywordtype">void</span> <a class="code" href="classDFSAPHeuristicTest.html#72fb16e54187758148f9e2b18687d5ac">setup</a> (<span class="keywordtype">void</span>) ;
<a name="l00038"></a>00038         <span class="keywordtype">void</span> <a class="code" href="classDFSAPHeuristicTest.html#fab26fa7135d6b59edaaa83aadb60e8c">cleanup</a> (<span class="keywordtype">void</span>) ;
<a name="l00039"></a>00039 
<a name="l00040"></a>00040         <span class="keywordtype">void</span> <a class="code" href="classDFSAPHeuristicTest.html#f357c71961ce93f7fac19d15663cab0d">testAlgorithm</a> (<span class="keywordtype">void</span>) ;
<a name="l00041"></a>00041 
<a name="l00042"></a>00042         <span class="keyword">private</span>:
<a name="l00043"></a><a class="code" href="classDFSAPHeuristicTest.html#54a6b61cb6fedeeab8da72483bfabfe9">00043</a>         <a class="code" href="classBitString.html" title="a string of bits">BitString</a> *<a class="code" href="classDFSAPHeuristicTest.html#9cb4b8bd67faf3200b3e9f5b5098d261">bs1</a>, *<a class="code" href="classDFSAPHeuristicTest.html#9c54dce23421ea72cbb1bfc20ffe01a6">bs2</a>, *<a class="code" href="classDFSAPHeuristicTest.html#0b180d8c1402e6a2611de3476f0d4192">bs3</a>, *<a class="code" href="classDFSAPHeuristicTest.html#d09dc7433ac3bea7840321913f04e4d6">bs4</a>, *<a class="code" href="classDFSAPHeuristicTest.html#54a6b61cb6fedeeab8da72483bfabfe9">bs5</a> ;
<a name="l00044"></a><a class="code" href="classDFSAPHeuristicTest.html#95fc33a20618864c9c6ab3680fde212b">00044</a>         <a class="code" href="classCvrStgFile.html" title="a cover-/stego-file">CvrStgFile</a> *<a class="code" href="classDFSAPHeuristicTest.html#d39016bfec1ddc30a5a8b12547127bb7">f1</a>, *<a class="code" href="classDFSAPHeuristicTest.html#b3c090f1e0fb8cc94ba5aa24e108d911">f2</a>, *<a class="code" href="classDFSAPHeuristicTest.html#4f3bd4adc52c876e27305340f5a767bc">f3</a>, *<a class="code" href="classDFSAPHeuristicTest.html#dea9c84cbf1a16e43566b20706e76aa6">f4</a>, *<a class="code" href="classDFSAPHeuristicTest.html#95fc33a20618864c9c6ab3680fde212b">f5</a> ;
<a name="l00045"></a><a class="code" href="classDFSAPHeuristicTest.html#907cb1cef464a67b4c7fc4e49ae5b816">00045</a>         <a class="code" href="classSelector.html" title="a random permutation of a random combination">Selector</a> *<a class="code" href="classDFSAPHeuristicTest.html#4b0f9f1686a94735088d9294a9e7b852">s1</a>, *<a class="code" href="classDFSAPHeuristicTest.html#d5f21777b7aad6a9d7d2ab0b6cf34f54">s2</a>, *<a class="code" href="classDFSAPHeuristicTest.html#ea19a197ecaaea9e5c5145d971372512">s3</a>, *<a class="code" href="classDFSAPHeuristicTest.html#28fb4d21e1834bcebaa662e2ff68657d">s4</a>, *<a class="code" href="classDFSAPHeuristicTest.html#907cb1cef464a67b4c7fc4e49ae5b816">s5</a> ;
<a name="l00046"></a><a class="code" href="classDFSAPHeuristicTest.html#d9095b72adfb580a2b5377812299a3d6">00046</a>         <a class="code" href="classGraph.html" title="a graph constructed from a cover file and a message to be embedded">Graph</a> *<a class="code" href="classDFSAPHeuristicTest.html#10c1ef014864145669b3954e051eb11d">g1</a>, *<a class="code" href="classDFSAPHeuristicTest.html#f556454fc58bedef72091c54a1d41d4a">g2</a>, *<a class="code" href="classDFSAPHeuristicTest.html#a854b0f32aa95b09a6c58776a0cdb1f7">g3</a>, *<a class="code" href="classDFSAPHeuristicTest.html#bd740fc738f2042954e196131c33281b">g4</a>, *<a class="code" href="classDFSAPHeuristicTest.html#d9095b72adfb580a2b5377812299a3d6">g5</a> ;
<a name="l00047"></a><a class="code" href="classDFSAPHeuristicTest.html#c8c42fa30b7978c4fa81978eb3108852">00047</a>         <a class="code" href="classMatching.html" title="represent a matching on a graph">Matching</a> *<a class="code" href="classDFSAPHeuristicTest.html#36eb9d26f9f798cd6837c05eb90b488f">m1</a>, *<a class="code" href="classDFSAPHeuristicTest.html#fd68cc22cf66a94151561d0fa892e776">m2</a>, *<a class="code" href="classDFSAPHeuristicTest.html#74e012e13a1ad3c338e6f7a998478592">m3</a>, *<a class="code" href="classDFSAPHeuristicTest.html#579c73d20cd35846074d422a6eab33e8">m4</a>, *<a class="code" href="classDFSAPHeuristicTest.html#c8c42fa30b7978c4fa81978eb3108852">m5</a> ;
<a name="l00048"></a><a class="code" href="classDFSAPHeuristicTest.html#314b35dc7e51ccc1dd546c055674f08a">00048</a>         <a class="code" href="classDFSAPHeuristic.html" title="a matching algorithm implementing a heuristic search for augmenting paths">DFSAPHeuristic</a> *<a class="code" href="classDFSAPHeuristicTest.html#59e5bf3f83027c0d8ca29f4449066201">aph1</a>, *<a class="code" href="classDFSAPHeuristicTest.html#331faa236ff9ca867700bfa85143fe16">aph2</a>, *<a class="code" href="classDFSAPHeuristicTest.html#e2d7e723f34c59735e7266c8d0609c57">aph3</a>, *<a class="code" href="classDFSAPHeuristicTest.html#3bb3b90515559f05916d67f59c2c92a1">aph4</a>, *<a class="code" href="classDFSAPHeuristicTest.html#314b35dc7e51ccc1dd546c055674f08a">aph5</a> ;
<a name="l00049"></a><a class="code" href="classDFSAPHeuristicTest.html#f7796cfba9ddfa8604dde2b71bafcbf6">00049</a>         <a class="code" href="classGlobals.html" title="some useful pointers that should be global">Globals</a> <a class="code" href="classDFSAPHeuristicTest.html#49a5590afbf1d14868129a53ffe6ba57">gl1</a>, <a class="code" href="classDFSAPHeuristicTest.html#782af69af851dd301b86974fdf0363c1">gl2</a>, <a class="code" href="classDFSAPHeuristicTest.html#5ddfc1fd24b051d2e5d789a9146f9023">gl3</a>, <a class="code" href="classDFSAPHeuristicTest.html#f11bbf9da5a42d45873e74da308b6296">gl4</a>, <a class="code" href="classDFSAPHeuristicTest.html#f7796cfba9ddfa8604dde2b71bafcbf6">gl5</a> ;
<a name="l00050"></a>00050 } ;
<a name="l00051"></a>00051 
<a name="l00052"></a>00052 <span class="preprocessor">#endif // ndef SH_DFSAPHEURISTICTEST_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>