| 1 |
/* |
| 2 |
* Copyright (C) 2000-2004 Object Oriented Parallel Simulation Engine (OOPSE) project |
| 3 |
* |
| 4 |
* Contact: oopse@oopse.org |
| 5 |
* |
| 6 |
* This program is free software; you can redistribute it and/or |
| 7 |
* modify it under the terms of the GNU Lesser General Public License |
| 8 |
* as published by the Free Software Foundation; either version 2.1 |
| 9 |
* of the License, or (at your option) any later version. |
| 10 |
* All we ask is that proper credit is given for our work, which includes |
| 11 |
* - but is not limited to - adding the above copyright notice to the beginning |
| 12 |
* of your source code files, and to any copyright notice that you may distribute |
| 13 |
* with programs based on this work. |
| 14 |
* |
| 15 |
* This program is distributed in the hope that it will be useful, |
| 16 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 17 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 18 |
* GNU Lesser General Public License for more details. |
| 19 |
* |
| 20 |
* You should have received a copy of the GNU Lesser General Public License |
| 21 |
* along with this program; if not, write to the Free Software |
| 22 |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
| 23 |
* |
| 24 |
*/ |
| 25 |
|
| 26 |
/** |
| 27 |
* @file PolynomialBendType.hpp |
| 28 |
* @author teng lin |
| 29 |
* @date 11/16/2004 |
| 30 |
* @version 1.0 |
| 31 |
*/ |
| 32 |
|
| 33 |
#ifndef TYPES_POLYNOMIALBENDTYPE_HPP |
| 34 |
#define TYPES_POLYNOMIALBENDTYPE_HPP |
| 35 |
#include <iostream> |
| 36 |
|
| 37 |
#include "math/Polynomial.hpp" |
| 38 |
#include "types/BendType.hpp" |
| 39 |
|
| 40 |
namespace oopse { |
| 41 |
|
| 42 |
/** |
| 43 |
* @class PolynomialBendType PolynomialBendType.hpp "types/PolynomialBendType.hpp" |
| 44 |
* @todo documentation |
| 45 |
*/ |
| 46 |
class PolynomialBendType : public BendType{ |
| 47 |
|
| 48 |
public: |
| 49 |
PolynomialBendType(double theta) : BendType(theta) {} |
| 50 |
|
| 51 |
void setCoefficient(int power, double coefficient) { |
| 52 |
polynomial_.setCoefficient(power, coefficient); |
| 53 |
} |
| 54 |
|
| 55 |
double getCoefficient(int power) { |
| 56 |
return polynomial_.getCoefficient(power); |
| 57 |
} |
| 58 |
|
| 59 |
void calcForce(double theta, double & V, double & dVdr) { |
| 60 |
double delta = theta - theta0_; |
| 61 |
V = polynomial_.evaluate(delta); |
| 62 |
dVdr = polynomial_.evaluateDerivative(delta); |
| 63 |
|
| 64 |
} |
| 65 |
|
| 66 |
friend std::ostream& operator <<(std::ostream& os, PolynomialBendType& pbt); |
| 67 |
|
| 68 |
private: |
| 69 |
|
| 70 |
DoublePolynomial polynomial_; |
| 71 |
}; |
| 72 |
|
| 73 |
std::ostream& operator <<(std::ostream& os, PolynomialBendType& pbt) { |
| 74 |
DoublePolynomial::const_iterator i; |
| 75 |
|
| 76 |
i = pbt.polynomial_.begin(); |
| 77 |
|
| 78 |
if (i == pbt.polynomial_.end()) { |
| 79 |
os << "This PolynomialBendType contains nothing" << std::endl; |
| 80 |
return os; |
| 81 |
} |
| 82 |
|
| 83 |
os << "This PolynomialBendType contains below terms:" << std::endl; |
| 84 |
|
| 85 |
while(true){ |
| 86 |
os << i->second << "*" << "(theta - " << pbt.getTheta() << ")" << "^" << i->first; |
| 87 |
|
| 88 |
if (++i == pbt.polynomial_.end()) { |
| 89 |
//if we reach the end of the polynomial pair, write out a newline and then escape the loop |
| 90 |
os << std::endl; |
| 91 |
break; |
| 92 |
} else { |
| 93 |
//otherwise, write out a "+" |
| 94 |
os << " + "; |
| 95 |
} |
| 96 |
} |
| 97 |
|
| 98 |
return os; |
| 99 |
} |
| 100 |
|
| 101 |
|
| 102 |
} //end namespace oopse |
| 103 |
#endif //TYPES_POLYNOMIALBENDTYPE_HPP |
| 104 |
|
