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 PolynomialTorsionType.hpp |
28 |
* @author teng lin |
29 |
* @date 11/16/2004 |
30 |
* @version 1.0 |
31 |
*/ |
32 |
|
33 |
#ifndef TYPES_POLYNOMIALBONDTYPE_HPP |
34 |
#define TYPES_POLYNOMIALBONDTYPE_HPP |
35 |
|
36 |
namespace oopse { |
37 |
|
38 |
#include "math/Polynomial.hpp" |
39 |
#include "types/TorsionType.hpp" |
40 |
/** |
41 |
* @class PolynomialTorsionType PolynomialTorsionType.hpp "types/PolynomialTorsionType.hpp" |
42 |
* @todo documentation |
43 |
*/ |
44 |
class PolynomialTorsionType : public TorsionType{ |
45 |
|
46 |
public: |
47 |
PolynomialTorsionType() {} |
48 |
|
49 |
double getCoefficient(int power) { |
50 |
return polynomial_.getCoefficient(power); |
51 |
} |
52 |
|
53 |
void addCoefficient(int power, double coefficient) { |
54 |
polynomial_.addCoefficient(power, coefficient); |
55 |
} |
56 |
|
57 |
void setCoefficient(int power, double coefficient) { |
58 |
polynomial_.setCoefficient(power, coefficient); |
59 |
} |
60 |
|
61 |
void setPolynomial(const DoublePolynomial& p) { |
62 |
polynomial_ = p; |
63 |
} |
64 |
|
65 |
virtual void calcForce(double cosPhi, double sinPhi, double& V, double& dVdPhi) { |
66 |
V = polynomial_.evaluate(cosPhi); |
67 |
double dVdcosPhi = polynomial_.evaluateDerivative(cosPhi); |
68 |
dVdPhi = - dVdcosPhi * sinPhi; |
69 |
} |
70 |
|
71 |
friend std::ostream& operator <<(std::ostream& os, PolynomialTorsionType& pbt); |
72 |
|
73 |
private: |
74 |
|
75 |
DoublePolynomial polynomial_; |
76 |
}; |
77 |
|
78 |
std::ostream& operator <<(std::ostream& os, PolynomialTorsionType& ptt) { |
79 |
typename DoublePolynomial::PolynomialIterator i; |
80 |
|
81 |
i = ptt.polynomial_.begin(); |
82 |
|
83 |
if (i == ptt.polynomial_.end()) { |
84 |
os << "This Polynomial contains nothing" << std::endl; |
85 |
return os; |
86 |
} |
87 |
|
88 |
os << "This Polynomial contains below terms:" << std::endl; |
89 |
|
90 |
while(true){ |
91 |
os << i->second << "*" << "(cosPhi)" << "^" << i->first; |
92 |
|
93 |
if (++i == ptt.polynomial_.end()) { |
94 |
//if we reach the end of the polynomial pair, write out a newline and then escape the loop |
95 |
os << std::endl; |
96 |
break; |
97 |
} else { |
98 |
//otherwise, write out a "+" |
99 |
os << " + "; |
100 |
} |
101 |
} |
102 |
|
103 |
os << std::endl; |
104 |
return os; |
105 |
} |
106 |
|
107 |
|
108 |
} //end namespace oopse |
109 |
#endif //TYPES_POLYNOMIALBONDTYPE_HPP |
110 |
|