Paradiseo-eo sources added
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@40 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
bc1f453978
commit
c3aec878e5
3609 changed files with 342772 additions and 0 deletions
95
trunk/paradiseo-eo/doc/html/_bounds_check_8cpp-source.html
Normal file
95
trunk/paradiseo-eo/doc/html/_bounds_check_8cpp-source.html
Normal file
|
|
@ -0,0 +1,95 @@
|
|||
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||||
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
|
||||
<title>EO: BoundsCheck.cpp Source File</title>
|
||||
<link href="doxygen.css" rel="stylesheet" type="text/css">
|
||||
</head><body>
|
||||
<!-- Generated by Doxygen 1.3.9.1 -->
|
||||
<div class="qindex"> <form class="search" action="search.php" method="get">
|
||||
<a class="qindex" href="main.html">Main Page</a> | <a class="qindex" href="modules.html">Modules</a> | <a class="qindex" href="namespaces.html">Namespace List</a> | <a class="qindex" href="hierarchy.html">Class Hierarchy</a> | <a class="qindex" href="classes.html">Alphabetical List</a> | <a class="qindex" href="annotated.html">Class List</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="namespacemembers.html">Namespace Members</a> | <a class="qindex" href="functions.html">Class Members</a> | <a class="qindex" href="pages.html">Related Pages</a> | <span class="search"><u>S</u>earch for <input class="search" type="text" name="query" value="" size="20" accesskey="s"/></span></form></div>
|
||||
<div class="nav">
|
||||
<a class="el" href="dir_000007.html">contrib</a> / <a class="el" href="dir_000008.html">mathsym</a> / <a class="el" href="dir_000009.html">eval</a></div>
|
||||
<h1>BoundsCheck.cpp</h1><div class="fragment"><pre class="fragment">00001 <span class="comment">/* </span>
|
||||
00002 <span class="comment"> * Copyright (C) 2005 Maarten Keijzer</span>
|
||||
00003 <span class="comment"> *</span>
|
||||
00004 <span class="comment"> * This program is free software; you can redistribute it and/or modify</span>
|
||||
00005 <span class="comment"> * it under the terms of version 2 of the GNU General Public License as </span>
|
||||
00006 <span class="comment"> * published by the Free Software Foundation. </span>
|
||||
00007 <span class="comment"> *</span>
|
||||
00008 <span class="comment"> * This program is distributed in the hope that it will be useful,</span>
|
||||
00009 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
|
||||
00010 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
|
||||
00011 <span class="comment"> * GNU General Public License for more details.</span>
|
||||
00012 <span class="comment"> *</span>
|
||||
00013 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
|
||||
00014 <span class="comment"> * along with this program; if not, write to the Free Software</span>
|
||||
00015 <span class="comment"> * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</span>
|
||||
00016 <span class="comment"> */</span>
|
||||
00017
|
||||
00018 <span class="preprocessor">#include <vector></span>
|
||||
00019
|
||||
00020 <span class="preprocessor">#include "BoundsCheck.h"</span>
|
||||
00021 <span class="preprocessor">#include <Sym.h></span>
|
||||
00022 <span class="preprocessor">#include <FunDef.h></span>
|
||||
00023 <span class="preprocessor">#include <sstream></span>
|
||||
00024
|
||||
00025 <span class="keyword">using</span> <span class="keyword">namespace </span>std;
|
||||
00026
|
||||
00027 <span class="keyword">class </span>IntervalBoundsCheckImpl {
|
||||
00028 <span class="keyword">public</span> :
|
||||
00029 vector<Interval> bounds;
|
||||
00030 };
|
||||
00031
|
||||
00032 IntervalBoundsCheck::IntervalBoundsCheck(<span class="keyword">const</span> vector<double>& mins, <span class="keyword">const</span> vector<double>& maxes) {
|
||||
00033 pimpl = <span class="keyword">new</span> IntervalBoundsCheckImpl;
|
||||
00034 vector<Interval>& b = pimpl->bounds;
|
||||
00035
|
||||
00036 b.resize( mins.size());
|
||||
00037
|
||||
00038 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < b.size(); ++i) {
|
||||
00039 b[i] = Interval(mins[i], maxes[i]);
|
||||
00040 }
|
||||
00041
|
||||
00042 }
|
||||
00043
|
||||
00044 IntervalBoundsCheck::~IntervalBoundsCheck() { <span class="keyword">delete</span> pimpl; }
|
||||
00045 IntervalBoundsCheck::IntervalBoundsCheck(<span class="keyword">const</span> IntervalBoundsCheck& that) { pimpl = <span class="keyword">new</span> IntervalBoundsCheckImpl(*that.pimpl); }
|
||||
00046 IntervalBoundsCheck& IntervalBoundsCheck::operator=(<span class="keyword">const</span> IntervalBoundsCheck& that) { *pimpl = *that.pimpl; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
|
||||
00047
|
||||
00048 <span class="keywordtype">bool</span> IntervalBoundsCheck::in_bounds(<span class="keyword">const</span> Sym& sym)<span class="keyword"> const </span>{
|
||||
00049 Interval bounds;
|
||||
00050
|
||||
00051 <span class="keywordflow">try</span> {
|
||||
00052 bounds = eval(sym, pimpl->bounds);
|
||||
00053 <span class="keywordflow">if</span> (!valid(bounds)) <span class="keywordflow">return</span> <span class="keyword">false</span>;
|
||||
00054 } <span class="keywordflow">catch</span> (interval_error) {
|
||||
00055 <span class="keywordflow">return</span> <span class="keyword">false</span>;
|
||||
00056 }
|
||||
00057 <span class="keywordflow">return</span> <span class="keyword">true</span>;
|
||||
00058 }
|
||||
00059
|
||||
00060 std::string IntervalBoundsCheck::get_bounds(<span class="keyword">const</span> Sym& sym)<span class="keyword"> const </span>{
|
||||
00061
|
||||
00062 <span class="keywordflow">try</span> {
|
||||
00063 Interval bounds = eval(sym, pimpl->bounds);
|
||||
00064 <span class="keywordflow">if</span> (!valid(bounds)) <span class="keywordflow">return</span> <span class="stringliteral">"err"</span>;
|
||||
00065 ostringstream os;
|
||||
00066 os << bounds;
|
||||
00067 <span class="keywordflow">return</span> os.str();
|
||||
00068 } <span class="keywordflow">catch</span> (interval_error) {
|
||||
00069 <span class="keywordflow">return</span> <span class="stringliteral">"err"</span>;
|
||||
00070 }
|
||||
00071 }
|
||||
00072
|
||||
00073
|
||||
00074 std::pair<double, double> IntervalBoundsCheck::calc_bounds(<span class="keyword">const</span> Sym& sym)<span class="keyword"> const </span>{
|
||||
00075
|
||||
00076 Interval bounds = eval(sym, pimpl->bounds);
|
||||
00077 <span class="keywordflow">return</span> make_pair(bounds.lower(), bounds.upper());
|
||||
00078 }
|
||||
00079
|
||||
00080
|
||||
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Thu Oct 19 05:06:34 2006 for EO by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.3.9.1 </small></address>
|
||||
</body>
|
||||
</html>
|
||||
Loading…
Add table
Add a link
Reference in a new issue