1 // Copyright 2003 "Gilles Degottex"
3 // This file is part of "CppAddons"
5 // "CppAddons" is free software; you can redistribute it and/or modify
6 // it under the terms of the GNU Lesser General Public License as published by
7 // the Free Software Foundation; either version 2.1 of the License, or
8 // (at your option) any later version.
10 // "CppAddons" is distributed in the hope that it will be useful,
11 // but WITHOUT ANY WARRANTY; without even the implied warranty of
12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 // GNU Lesser General Public License for more details.
15 // You should have received a copy of the GNU Lesser General Public License
16 // along with this program; if not, write to the Free Software
17 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
33 template<typename TypeData> inline TypeData sgn(TypeData a) {return (a<0)?-1:1;}
35 static const double Pi = 2*acos(0);
36 static const float fPi = 2*acos(0);
38 static const double E = exp(1);
39 static const float fE = exp(1);
41 // résoud une equation du 2ème degré
45 enum ENError{NE_OK=0, NE_DISCRIMINENT_NEG, NE_A_AND_B_EQ_ZERO, NE_RACINE_NEG, NE_X1_AND_X2_NEG, NE_X1_AND_X2_POS};
54 double getX1(){return x1;}
55 double getX2(){return x2;}
58 SolOfEq2(double a, double b, double c);
61 // calcul l'intérale de f sur [a;b] avec un pas de h
63 template<class Function>
64 double Simpson(double a, double b, Function f, double h)
66 double I4=f(a+h/2.0), I2=0;
67 for(double x4=a+(h/2.0)+h, x2=a+h; x4<b; x4+=h, x2+=h)
72 return (h/6.0)*(f(a)+4*I4+2*I2+f(b));
75 template<typename Type> std::complex<Type> make_complex(Type value[]){return std::complex<Type>(value[0], value[1]);}
77 inline double modulo(double d1, double d2)
79 return d1-int(d1/d2)*d2;
81 inline double mod2(const double c[2])
83 return c[0]*c[0]+c[1]*c[1];
85 inline double mod(const double c[2])
89 inline double mod2(const std::complex<double>& c)
91 return c.real()*c.real()+c.imag()*c.imag();
93 inline double mod(const std::complex<double>& c)
98 inline double mod_equal(double& d1, double d2)
100 return d1 -= int(d1/d2)*d2;
105 * \param x \f$\in ]-\infty,\infty[\f$
107 inline double gauss(double x)
109 return exp(-Math::Pi*x*x);
112 inline double sinc(double t)
114 if(t==0.0) return 1.0;
116 return sin(Math::Pi*t)/(Math::Pi*t);
119 /* doesn't need for Linux for sure, seems to be probelatic under win32 (macro ambiquity)
120 template<typename TypeData1, typename TypeData2>
121 TypeData1 max(const TypeData1& a, const TypeData2& b)
126 template<typename TypeData1, typename TypeData2>
127 TypeData1 min(const TypeData1& a, const TypeData2& b)
132 // template<typename TypeData> TypeData abs(const TypeData& a) {return (a<0)?-a:a;} // include <cmath> instead
133 // template<typename TypeData> TypeData abs(TypeData a) {return (a<0)?-a:a;} // include <cmath> instead