Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > 54cac1c2268db633d66eeff1b4faa585 > files > 545

frepple-doc-0.8.1-3.fc15.noarch.rpm

<!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"/>
<title>C++ API frePPLe: problems_operationplan.cpp Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="../styles.css" rel="stylesheet"  type="text/css">
</head>
<body>
<div id="container">

<div id="menubar"> 
<div id="logo" align="center">
<br/><img src='../frepple.bmp' alt="frepple" /><br/>
<a href='http://www.frepple.com/'>
<strong>a Free<br/>Production Planning<br/>Library</strong>
</a>
</div>
<div id="menu">
<br/>
<h3><a href='../Main/HomePage.html'>Main</a></h3>
<h3><a href='../UI/Main.html'>User Manual</a></h3>
<h3><a href='../Tutorial/Main.html'>Tutorial</a></h3>
<h3><a href='../Frepple/Main.html'>Reference Manual</a></h3>
<h3><a href='../Main/FAQ.html'>FAQ</a></h3>
<h3><a href='index.html'>C++ API</a></h3>
<br/>
</div>  
</div>

<div id="content">
<br/>
<!-- Generated by Doxygen 1.6.1 -->
<div class="navigation" id="top">
  <div class="tabs">
    <ul>
      <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
      <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</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>
      <li><a href="dirs.html"><span>Directories</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>
  <div class="navpath"><a class="el" href="dir_88117dff2735251a69c8eb9084477714.html">src</a>&nbsp;&raquo&nbsp;<a class="el" href="dir_25032d30b6d615a661c02e2ac1394b01.html">model</a>
  </div>
</div>
<div class="contents">
<h1>problems_operationplan.cpp</h1><a href="a00230.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">  file : $URL: https://frepple.svn.sourceforge.net/svnroot/frepple/trunk/src/model/problems_operationplan.cpp $</span>
<a name="l00003"></a>00003 <span class="comment">  version : $LastChangedRevision: 1315 $  $LastChangedBy: jdetaeye $</span>
<a name="l00004"></a>00004 <span class="comment">  date : $LastChangedDate: 2010-07-17 18:08:53 +0200 (Sat, 17 Jul 2010) $</span>
<a name="l00005"></a>00005 <span class="comment"> ***************************************************************************/</span>
<a name="l00006"></a>00006 
<a name="l00007"></a>00007 <span class="comment">/***************************************************************************</span>
<a name="l00008"></a>00008 <span class="comment"> *                                                                         *</span>
<a name="l00009"></a>00009 <span class="comment"> * Copyright (C) 2007-2010 by Johan De Taeye                               *</span>
<a name="l00010"></a>00010 <span class="comment"> *                                                                         *</span>
<a name="l00011"></a>00011 <span class="comment"> * This library is free software; you can redistribute it and/or modify it *</span>
<a name="l00012"></a>00012 <span class="comment"> * under the terms of the GNU Lesser General Public License as published   *</span>
<a name="l00013"></a>00013 <span class="comment"> * by the Free Software Foundation; either version 2.1 of the License, or  *</span>
<a name="l00014"></a>00014 <span class="comment"> * (at your option) any later version.                                     *</span>
<a name="l00015"></a>00015 <span class="comment"> *                                                                         *</span>
<a name="l00016"></a>00016 <span class="comment"> * This library is distributed in the hope that it will be useful,         *</span>
<a name="l00017"></a>00017 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of          *</span>
<a name="l00018"></a>00018 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser *</span>
<a name="l00019"></a>00019 <span class="comment"> * General Public License for more details.                                *</span>
<a name="l00020"></a>00020 <span class="comment"> *                                                                         *</span>
<a name="l00021"></a>00021 <span class="comment"> * You should have received a copy of the GNU Lesser General Public        *</span>
<a name="l00022"></a>00022 <span class="comment"> * License along with this library; if not, write to the Free Software     *</span>
<a name="l00023"></a>00023 <span class="comment"> * Foundation Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,*</span>
<a name="l00024"></a>00024 <span class="comment"> * USA                                                                     *</span>
<a name="l00025"></a>00025 <span class="comment"> *                                                                         *</span>
<a name="l00026"></a>00026 <span class="comment"> ***************************************************************************/</span>
<a name="l00027"></a>00027 
<a name="l00028"></a><a class="code" href="a00230.html#a342983a479ae7a921be5face83fdb029">00028</a> <span class="preprocessor">#define FREPPLE_CORE</span>
<a name="l00029"></a>00029 <span class="preprocessor"></span><span class="preprocessor">#include &quot;<a class="code" href="a00218.html">frepple/model.h</a>&quot;</span>
<a name="l00030"></a>00030 <span class="keyword">namespace </span>frepple
<a name="l00031"></a>00031 {
<a name="l00032"></a>00032 
<a name="l00033"></a>00033 
<a name="l00034"></a><a class="code" href="a00121.html#af081f3c4838de6b84d45e708001cb9c6">00034</a> <a class="code" href="a00252.html#a99b94ab8c2f2a32277559c7b2b0a054c">DECLARE_EXPORT</a> <span class="keywordtype">void</span> <a class="code" href="a00121.html#af081f3c4838de6b84d45e708001cb9c6">Operation::updateProblems</a>()
<a name="l00035"></a>00035 {
<a name="l00036"></a>00036   <span class="comment">// Find all operationplans, and delegate the problem detection to them</span>
<a name="l00037"></a>00037   <span class="keywordflow">if</span> (<a class="code" href="a00133.html#a060a1f4f9488fb2f287470127b59f5ec">getDetectProblems</a>())
<a name="l00038"></a>00038     <span class="keywordflow">for</span> (<a class="code" href="a00125.html" title="An operationplan is the key dynamic element of a plan. It represents a certain quantity...">OperationPlan</a> *o = first_opplan; o; o = o-&gt;next) o-&gt;updateProblems();
<a name="l00039"></a>00039 }
<a name="l00040"></a>00040 
<a name="l00041"></a>00041 
<a name="l00042"></a>00042 <span class="comment">//</span>
<a name="l00043"></a>00043 <span class="comment">// BEFORECURRENT, BEFOREFENCE, PRECEDENCE</span>
<a name="l00044"></a>00044 <span class="comment">//</span>
<a name="l00045"></a>00045 
<a name="l00046"></a>00046 
<a name="l00047"></a><a class="code" href="a00125.html#a065b07a37ca069de47577b2c7d009898">00047</a> <span class="keywordtype">void</span> <a class="code" href="a00125.html#a065b07a37ca069de47577b2c7d009898">OperationPlan::updateProblems</a>()
<a name="l00048"></a>00048 {
<a name="l00049"></a>00049   <span class="comment">// A flag for each problem type that may need to be created</span>
<a name="l00050"></a>00050   <span class="keywordtype">bool</span> needsBeforeCurrent(<span class="keyword">false</span>);
<a name="l00051"></a>00051   <span class="keywordtype">bool</span> needsBeforeFence(<span class="keyword">false</span>);
<a name="l00052"></a>00052   <span class="keywordtype">bool</span> needsPrecedence(<span class="keyword">false</span>);
<a name="l00053"></a>00053 
<a name="l00054"></a>00054   <span class="comment">// The following categories of operation plans can&apos;t have problems:</span>
<a name="l00055"></a>00055   <span class="comment">//  - locked opplans</span>
<a name="l00056"></a>00056   <span class="comment">//  - opplans of hidden operations</span>
<a name="l00057"></a>00057   <span class="keywordflow">if</span> (!<a class="code" href="a00125.html#ad76b43eab48c2587255ec1b460f91093">getLocked</a>() &amp;&amp; <a class="code" href="a00125.html#a2f5ae1046cd50f98e59520ed8910c458">getOperation</a>()-&gt;getDetectProblems())
<a name="l00058"></a>00058   {
<a name="l00059"></a>00059     <span class="keywordflow">if</span> (!<a class="code" href="a00125.html#a5d8b863740c3c1a948442c470e603393">getOwner</a>() || <a class="code" href="a00125.html#a2f5ae1046cd50f98e59520ed8910c458">getOperation</a>() == <a class="code" href="a00129.html#add35ebccc253401c86cc40dc2fed3f04">OperationSetup::setupoperation</a>) 
<a name="l00060"></a>00060     {
<a name="l00061"></a>00061       <span class="comment">// Avoid duplicating problems on child and owner operationplans</span>
<a name="l00062"></a>00062       <span class="comment">// Check if a BeforeCurrent problem is required.</span>
<a name="l00063"></a>00063       <span class="keywordflow">if</span> (dates.<a class="code" href="a00050.html#a73e574de7fbf5df8ebc4c5190e7d49c3">getStart</a>() &lt; <a class="code" href="a00132.html#ab297b1f299d472a457784f8022849303">Plan::instance</a>().<a class="code" href="a00132.html#a6a07002deb9c4f380a54a3e3465e487b">getCurrent</a>())
<a name="l00064"></a>00064         needsBeforeCurrent = <span class="keyword">true</span>;
<a name="l00065"></a>00065 
<a name="l00066"></a>00066       <span class="comment">// Check if a BeforeFence problem is required.</span>
<a name="l00067"></a>00067       <span class="comment">// Note that we either detect of beforeCurrent or a beforeFence problem,</span>
<a name="l00068"></a>00068       <span class="comment">// never both simultaneously.</span>
<a name="l00069"></a>00069       <span class="keywordflow">else</span> <span class="keywordflow">if</span>
<a name="l00070"></a>00070       (dates.<a class="code" href="a00050.html#a73e574de7fbf5df8ebc4c5190e7d49c3">getStart</a>() &lt; <a class="code" href="a00132.html#ab297b1f299d472a457784f8022849303">Plan::instance</a>().<a class="code" href="a00132.html#a6a07002deb9c4f380a54a3e3465e487b">getCurrent</a>() + oper-&gt;<a class="code" href="a00121.html#a0ad8ad3a837a2d93c2811cf568bf2cf0">getFence</a>())
<a name="l00071"></a>00071         needsBeforeFence = <span class="keyword">true</span>;
<a name="l00072"></a>00072     }
<a name="l00073"></a>00073     <span class="keywordflow">if</span> (nextsubopplan &amp;&amp; <a class="code" href="a00125.html#a9f19aec0a96f30616f2ee06e3c8f371a">getDates</a>().<a class="code" href="a00050.html#a165a8f748d8468e5ba8331c0e06bd3a2">getEnd</a>() &gt; nextsubopplan-&gt;<a class="code" href="a00125.html#a9f19aec0a96f30616f2ee06e3c8f371a">getDates</a>().<a class="code" href="a00050.html#a73e574de7fbf5df8ebc4c5190e7d49c3">getStart</a>())
<a name="l00074"></a>00074       needsPrecedence = <span class="keyword">true</span>;
<a name="l00075"></a>00075   }
<a name="l00076"></a>00076 
<a name="l00077"></a>00077   <span class="comment">// Loop through the existing problems</span>
<a name="l00078"></a>00078   <span class="keywordflow">for</span> (<a class="code" href="a00039.html" title="This class models an STL-like iterator that allows us to iterate over the named entities...">Problem::const_iterator</a> j = <a class="code" href="a00134.html#a1532b2bb7078ebcd527a8bf332ffb861">Problem::begin</a>(<span class="keyword">this</span>, <span class="keyword">false</span>);
<a name="l00079"></a>00079       j!=<a class="code" href="a00125.html#a0f9f6ba7d4fe7e20e9b88c765fe24f25">Problem::end</a>();)
<a name="l00080"></a>00080   {
<a name="l00081"></a>00081     <span class="comment">// Need to increment now and define a pointer to the problem, since the</span>
<a name="l00082"></a>00082     <span class="comment">// problem can be deleted soon (which invalidates the iterator).</span>
<a name="l00083"></a>00083     <a class="code" href="a00134.html" title="A problem represents infeasibilities, alerts and warnings in the plan.">Problem</a>&amp; curprob = *j;
<a name="l00084"></a>00084     ++j;
<a name="l00085"></a>00085     <span class="comment">// The if-statement keeps the problem detection code concise and</span>
<a name="l00086"></a>00086     <span class="comment">// concentrated. However, a drawback of this design is that a new problem</span>
<a name="l00087"></a>00087     <span class="comment">// subclass will also require a new demand subclass. I think such a link</span>
<a name="l00088"></a>00088     <span class="comment">// is acceptable.</span>
<a name="l00089"></a>00089     <span class="keywordflow">if</span> (<span class="keyword">typeid</span>(curprob) == <span class="keyword">typeid</span>(<a class="code" href="a00135.html" title="A problem of this class is created when an operationplan is being planned in the...">ProblemBeforeCurrent</a>))
<a name="l00090"></a>00090     {
<a name="l00091"></a>00091       <span class="comment">// if: problem needed and it exists already</span>
<a name="l00092"></a>00092       <span class="keywordflow">if</span> (needsBeforeCurrent) needsBeforeCurrent = <span class="keyword">false</span>;
<a name="l00093"></a>00093       <span class="comment">// else: problem not needed but it exists already</span>
<a name="l00094"></a>00094       <span class="keywordflow">else</span> <span class="keyword">delete</span> &amp;curprob;
<a name="l00095"></a>00095     }
<a name="l00096"></a>00096     <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">typeid</span>(curprob) == <span class="keyword">typeid</span>(<a class="code" href="a00136.html" title="A problem of this class is created when an operationplan is being planned before...">ProblemBeforeFence</a>))
<a name="l00097"></a>00097     {
<a name="l00098"></a>00098       <span class="keywordflow">if</span> (needsBeforeFence) needsBeforeFence = <span class="keyword">false</span>;
<a name="l00099"></a>00099       <span class="keywordflow">else</span> <span class="keyword">delete</span> &amp;curprob;
<a name="l00100"></a>00100     }
<a name="l00101"></a>00101     <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">typeid</span>(curprob) == <span class="keyword">typeid</span>(<a class="code" href="a00147.html" title="A problem of this class is created when the sequence of two operationplans in a routing...">ProblemPrecedence</a>))
<a name="l00102"></a>00102     {
<a name="l00103"></a>00103       <span class="keywordflow">if</span> (needsPrecedence) needsPrecedence = <span class="keyword">false</span>;
<a name="l00104"></a>00104       <span class="keywordflow">else</span> <span class="keyword">delete</span> &amp;curprob;
<a name="l00105"></a>00105     }
<a name="l00106"></a>00106   }
<a name="l00107"></a>00107 
<a name="l00108"></a>00108   <span class="comment">// Create the problems that are required but aren&apos;t existing yet.</span>
<a name="l00109"></a>00109   <span class="comment">// There is a little trick involved here... Normally problems are owned</span>
<a name="l00110"></a>00110   <span class="comment">// by objects of the Plannable class. OperationPlan isn&apos;t a subclass of</span>
<a name="l00111"></a>00111   <span class="comment">// Plannable, so we need a dirty cast.</span>
<a name="l00112"></a>00112   <span class="keywordflow">if</span> (needsBeforeCurrent) <span class="keyword">new</span> <a class="code" href="a00135.html" title="A problem of this class is created when an operationplan is being planned in the...">ProblemBeforeCurrent</a>(<span class="keyword">this</span>);
<a name="l00113"></a>00113   <span class="keywordflow">if</span> (needsBeforeFence) <span class="keyword">new</span> <a class="code" href="a00136.html" title="A problem of this class is created when an operationplan is being planned before...">ProblemBeforeFence</a>(<span class="keyword">this</span>);
<a name="l00114"></a>00114   <span class="keywordflow">if</span> (needsPrecedence) <span class="keyword">new</span> <a class="code" href="a00125.html#a927e79623bb89e4abc83bc7853ac9957">ProblemPrecedence</a>(<span class="keyword">this</span>);
<a name="l00115"></a>00115 }
<a name="l00116"></a>00116 
<a name="l00117"></a>00117 }
</pre></div></div>
<hr size="1"/><address style="align: right;"><small>Documentation generated for frePPLe by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"/></a></small></address>
</div>
</div>
</body>
</html>