1 // Copyright (C) 2007-2022 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License, or (at your option) any later version.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
19 // Author : Anthony Geay (CEA/DEN)
21 #include "InterpKernelUnit.hxx"
22 #include "InterpKernelExprParser.hxx"
30 using namespace INTERP_KERNEL;
32 const UnitDataBase& UnitDataBase::GetUniqueMapForExpr()
34 static UnitDataBase db;
38 static const char InterpKernelMuAscii[2]={-0x4B,0x0};
40 static const char InterpKernelMuUnicode[3]={-0x3E,-0x4B,0x0};
42 const char *UnitDataBase::PREF_POW10[NB_OF_PREF_POW10]={"y","z","a","f","p","n",InterpKernelMuAscii,InterpKernelMuUnicode,"u","m","c","d",
43 "da","h","k","M","G","T","P","E","Z","Y"};
45 const double UnitDataBase::POW10[NB_OF_PREF_POW10]={1e-24,1e-21,1e-18,1e-15,1e-12,1e-9,1e-6,1e-6,1e-6,1e-3,1e-2,1e-1,
46 1e1,1e2,1e3,1e6,1e9,1e12,1e15,1e18,1e21,1e24};
48 static const char InterpKernelDegreeCAscii[3]={-0x50,0x43,0x0};
50 static const char InterpKernelDegreeCUnicode[4]={-0x3E,-0x50,0x43,0x0};
52 static const char InterpKernelDegreeCUnicodeWin[3]={-0x08,0x43,0x0};
54 const char *UnitDataBase::UNITS_RECOGN[NB_OF_UNITS_RECOGN]={"g","m","s","A","K",
55 "W","J","Hz","V","h","min","t","N","dyn",
56 "eV","Pa","atm","bar",InterpKernelDegreeCAscii,"C","ohm","F","S",
57 "T","H","P","St",InterpKernelDegreeCUnicode,InterpKernelDegreeCUnicodeWin};
59 const short UnitDataBase::PROJ_IN_BASE[NB_OF_UNITS_RECOGN][SIZE_OF_UNIT_BASE]=
79 {0,0,0,0,1},//degree C
88 {0,0,0,0,1},//degree C
92 const double UnitDataBase::MUL_COEFF[NB_OF_UNITS_RECOGN]=
94 1000.,1000.,1.,1000.,3600.,3600.,1e6,1000.,1e-2,
95 1.60217733e-16,1000.,1.01325e8,1e8,1.,1.,1000.,1e-3,
96 1000.,1000.,100.,1.,1.,1.,1.};
98 const double UnitDataBase::ADD_COEFF[NB_OF_UNITS_RECOGN]=
99 { 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 273.15, 0., 0., 0., 0., 0., 0., 0., 0., 273.15 ,273.15};
101 UnitDataBase::UnitDataBase()
103 for(int i=0;i<NB_OF_PREF_POW10;i++)
104 _prefix_pow_10[PREF_POW10[i]]=POW10[i];
105 for(int i=0;i<NB_OF_UNITS_RECOGN;i++)
107 _units_semantic[UNITS_RECOGN[i]]=PROJ_IN_BASE[i];
108 _units_mul[UNITS_RECOGN[i]]=MUL_COEFF[i];
109 _units_add[UNITS_RECOGN[i]]=ADD_COEFF[i];
113 const short *UnitDataBase::getInfoForUnit(const std::string& unit, double& addFact, double& mFact) const
115 std::size_t lgth=unit.length();
116 std::string work,work2;
118 for(std::size_t i=0;i<lgth && !ret;i++)
121 std::map<std::string,const short *>::const_iterator iter=_units_semantic.find(work);
122 if(iter!=_units_semantic.end())
125 std::map<std::string,double>::const_iterator iter2=_units_add.find(work);
126 addFact=(*iter2).second;
127 std::map<std::string,double>::const_iterator iter3=_units_mul.find(work);
128 mFact=(*iter3).second;
129 work2=unit.substr(0,i);
134 std::ostringstream os;
135 os << "Unit : " << unit << " not recognized !";
136 throw INTERP_KERNEL::Exception(os.str().c_str());
140 std::map<std::string,double>::const_iterator iter4=_prefix_pow_10.find(work2);
141 if(iter4==_prefix_pow_10.end())
143 std::ostringstream os;
144 os << "Unit : " << unit << " not fully recognized : \"" << work << "\" detected as core unit and \"";
145 os << work2 << "\" not recognized prefix !";
146 throw INTERP_KERNEL::Exception(os.str().c_str());
149 mFact*=(*iter4).second;
154 DecompositionInUnitBase::DecompositionInUnitBase():_add_to_base(0.),_mult_fact_to_base(1.)
163 void DecompositionInUnitBase::setInfo(const short *vals, double addFact, double mFact)
165 _add_to_base=addFact;
166 _mult_fact_to_base=mFact;
174 bool DecompositionInUnitBase::operator==(const DecompositionInUnitBase& other) const
176 return _value[0]==other._value[0] && _value[1]==other._value[1] && _value[2]==other._value[2] && _value[3]==other._value[3] && _value[4]==other._value[4];
179 void DecompositionInUnitBase::getTranslationParams(const DecompositionInUnitBase& other, double& mul, double& add) const
183 mul=_mult_fact_to_base/other._mult_fact_to_base;
184 add=_add_to_base/other._mult_fact_to_base-other._add_to_base;
188 mul=std::numeric_limits<double>::max();
189 add=std::numeric_limits<double>::max();
193 bool DecompositionInUnitBase::isEqual(short mass, short lgth, short time, short intensity, short temp, double add, double mult)
195 bool ret1=mass==_value[0];
196 bool ret2=lgth==_value[1];
197 bool ret3=time==_value[2];
198 bool ret4=intensity==_value[3];
199 bool ret5=temp==_value[4];
200 bool ret6=areDoubleEquals(add,_add_to_base);
201 bool ret7=areDoubleEquals(mult,_mult_fact_to_base);
202 return ret1 && ret2 && ret3 && ret4 && ret5 && ret6 && ret7;
205 void DecompositionInUnitBase::negate()
207 _mult_fact_to_base=-_mult_fact_to_base;
210 bool DecompositionInUnitBase::isAdimensional() const
212 return _value[0]==0 && _value[1]==0 && _value[2]==0 && _value[3]==0 && _value[4]==0;
215 bool DecompositionInUnitBase::isUnitary() const
217 return areDoubleEquals(_add_to_base,0.) && areDoubleEquals(_mult_fact_to_base,1.);
220 void DecompositionInUnitBase::tryToConvertInUnit(double val)
223 if((val-(double)valI)!=0.)
225 std::ostringstream os;
226 os << "Double value " << val << " can't be considered as integer. Not admitable for units !";
227 throw INTERP_KERNEL::Exception(os.str().c_str());
235 _mult_fact_to_base=valI;
238 DecompositionInUnitBase &DecompositionInUnitBase::operator*(const DecompositionInUnitBase& other)
240 // += causes ' conversion to 'short int' from 'int' may alter its value [-Wconversion]'
241 _value[0]=(short)(_value[0]+other._value[0]); _value[1]=(short)(_value[1]+other._value[1]); _value[2]=(short)(_value[2]+other._value[2]); _value[3]=(short)(_value[3]+other._value[3]); _value[4]=(short)(_value[4]+other._value[4]);
242 _mult_fact_to_base*=other._mult_fact_to_base;
247 DecompositionInUnitBase &DecompositionInUnitBase::operator/(const DecompositionInUnitBase& other)
249 // -= causes ' conversion to 'short int' from 'int' may alter its value [-Wconversion]'
250 _value[0]=(short)(_value[0]-other._value[0]); _value[1]=(short)(_value[1]-other._value[1]); _value[2]=(short)(_value[2]-other._value[2]); _value[3]=(short)(_value[3]-other._value[3]); _value[4]=(short)(_value[4]-other._value[4]);
251 _mult_fact_to_base/=other._mult_fact_to_base;
256 DecompositionInUnitBase &DecompositionInUnitBase::operator^(const DecompositionInUnitBase& other)
258 if(!other.isAdimensional())
259 throw INTERP_KERNEL::Exception("Trying to execute operator ^ with a second member not adimensionnal");
260 int exp=couldItBeConsideredAsInt(other._mult_fact_to_base);
261 // *= causes ' conversion to 'short int' from 'int' may alter its value [-Wconversion]'
262 _value[0]=(short)(_value[0]*exp); _value[1]=(short)(_value[1]*exp); _value[2]=(short)(_value[2]*exp); _value[3]=(short)(_value[3]*exp); _value[4]=(short)(_value[4]*exp);
263 _mult_fact_to_base=powInt(_mult_fact_to_base,exp);
268 void DecompositionInUnitBase::dealWithAddFactor(const DecompositionInUnitBase& other)
270 if(!areDoubleEquals(_add_to_base,0.))
271 if(other.isAdimensional())
272 if(areDoubleEquals(other._mult_fact_to_base,1.))
274 if(!other.areDoubleEquals(_add_to_base,0.))
276 if(areDoubleEquals(_mult_fact_to_base,1.))
281 double DecompositionInUnitBase::powInt(double val, int exp)
287 for(int i=0;i<exp;i++)
292 for(int i=0;i<tmp;i++)
298 bool DecompositionInUnitBase::areDoubleEquals(double a, double b)
302 double ref=std::max(a,b);
303 return fabs((a-b)/ref)<1e-7;
306 int DecompositionInUnitBase::couldItBeConsideredAsInt(double val)
309 double valT=(double) ret;
314 std::ostringstream stream; stream << "Invalid double number " << std::setprecision(16) << val << " can's be considered for ^ operation on unit.";
315 throw INTERP_KERNEL::Exception(stream.str().c_str());
319 Unit::Unit(const char *reprC, bool tryToInterp):_coarse_repr(reprC),
320 _is_interpreted(false),
321 _is_interpretation_ok(false)
327 Unit::Unit(const char *reprFortran, int sizeOfRepr, bool tryToInterp):_coarse_repr(ExprParser::buildStringFromFortran(reprFortran,sizeOfRepr)),
328 _is_interpreted(false),
329 _is_interpretation_ok(false)
333 void Unit::tryToInterprate() const
337 _is_interpreted=true;
338 _is_interpretation_ok=false;
341 ExprParser expr(_coarse_repr.c_str());
343 _decomp_in_base=expr.evaluateUnit();
344 _is_interpretation_ok=true;
346 catch(INTERP_KERNEL::Exception&) { }
350 bool Unit::isInterpretationOK() const
352 return _is_interpretation_ok;
355 bool Unit::isCompatibleWith(const Unit& other) const
358 other.tryToInterprate();
359 if(_is_interpretation_ok && other._is_interpretation_ok)
360 return _decomp_in_base==other._decomp_in_base;
365 double Unit::convert(const Unit& target, double sourceVal) const
367 if(isCompatibleWith(target))
370 _decomp_in_base.getTranslationParams(target._decomp_in_base,mult,add);
371 return mult*sourceVal+add;
374 return std::numeric_limits<double>::max();
377 std::string Unit::getCoarseRepr() const