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 |
#include "io/BendTypesSectionParser.hpp" |
27 |
#include "types/HarmonicBendType.hpp" |
28 |
#include "types/UreyBradleyBendType.hpp" |
29 |
#include "types/CubicBendType.hpp" |
30 |
#include "types/QuarticBendType.hpp" |
31 |
#include "types/PolynomialBendType.hpp" |
32 |
namespace oopse { |
33 |
|
34 |
BendTypesSectionParser::BendTypesSectionParser() { |
35 |
setSectionName("BendTypes"); |
36 |
} |
37 |
|
38 |
void BendTypesSectionParser::parseLine(ForceField& ff,const std::string& line, int lineNo){ |
39 |
StringTokenizer tokenizer(line); |
40 |
std::string at1; |
41 |
std::string at2; |
42 |
std::string at3; |
43 |
std::string bt; |
44 |
double theta0; |
45 |
BendType* bendType = NULL; |
46 |
|
47 |
int nTokens = tokenizer.countTokens(); |
48 |
|
49 |
if (nTokens < 5) { |
50 |
|
51 |
return; |
52 |
} |
53 |
|
54 |
at1 = tokenizer.nextToken(); |
55 |
at2 = tokenizer.nextToken(); |
56 |
at3 = tokenizer.nextToken(); |
57 |
bt = tokenizer.nextToken(); |
58 |
theta0 = tokenizer.nextTokenAsDouble(); |
59 |
nTokens -= 5; |
60 |
|
61 |
//switch is a maintain nightmare |
62 |
switch(bt) { |
63 |
|
64 |
case "Harmonic" : |
65 |
|
66 |
if (nTokens < 1) { |
67 |
|
68 |
} else { |
69 |
|
70 |
double ktheta = tokenizer.nextTokenAsDouble(); |
71 |
bendType = new HarmonicBendType(theta0, ktheta); |
72 |
} |
73 |
break; |
74 |
case "GhostBend" : |
75 |
if (nTokens < 1) { |
76 |
|
77 |
} else { |
78 |
double ktheta = tokenizer.nextTokenAsDouble(); |
79 |
bendType = new HarmonicBendType(theta0, ktheta); |
80 |
} |
81 |
break; |
82 |
|
83 |
case "UreyBradley" : |
84 |
if (nTokens < 3) { |
85 |
|
86 |
} else { |
87 |
double ktheta = tokenizer.nextTokenAsDouble(); |
88 |
double s0 = tokenizer.nextTokenAsDouble(); |
89 |
double kub = tokenizer.nextTokenAsDouble(); |
90 |
bendType = new UreyBradleyBendType(theta0, ktheta, s0, kub); |
91 |
} |
92 |
break; |
93 |
|
94 |
case "Cubic" : |
95 |
if (nTokens < 4) { |
96 |
|
97 |
} else { |
98 |
|
99 |
double k3 = tokenizer.nextTokenAsDouble(); |
100 |
double k2 = tokenizer.nextTokenAsDouble(); |
101 |
double k1 = tokenizer.nextTokenAsDouble(); |
102 |
double k0 = tokenizer.nextTokenAsDouble(); |
103 |
|
104 |
bendType = new CubicBendType(theta0, k3, k2, k1, k0); |
105 |
} |
106 |
break; |
107 |
|
108 |
case "Quartic" : |
109 |
if (nTokens < 5) { |
110 |
|
111 |
} else { |
112 |
|
113 |
theta0 = tokenizer.nextTokenAsDouble(); |
114 |
double k4 = tokenizer.nextTokenAsDouble(); |
115 |
double k3 = tokenizer.nextTokenAsDouble(); |
116 |
double k2 = tokenizer.nextTokenAsDouble(); |
117 |
double k1 = tokenizer.nextTokenAsDouble(); |
118 |
double k0 = tokenizer.nextTokenAsDouble(); |
119 |
|
120 |
bendType = new QuarticBendType(theta0, k4, k3, k2, k1, k0); |
121 |
} |
122 |
break; |
123 |
|
124 |
case "Polynomial" : |
125 |
if (nTokens < 2 || nTokens % 2 != 0) { |
126 |
|
127 |
} else { |
128 |
int nPairs = nTokens / 2; |
129 |
int power; |
130 |
double coefficient; |
131 |
PolynomialBendType* pbt = new PolynomialBendType(); |
132 |
|
133 |
for (int i = 0; i < nPairs; ++i) { |
134 |
power = tokenizer.nextTokenAsInt(); |
135 |
coefficient = tokenizer.nextTokenAsDouble(); |
136 |
pbt->setCoefficient(power, coefficient); |
137 |
} |
138 |
} |
139 |
|
140 |
break; |
141 |
|
142 |
default: |
143 |
|
144 |
} |
145 |
|
146 |
if (bendType != NULL) { |
147 |
ff.addBendType(at1, at2, at3, bendType); |
148 |
} |
149 |
} |
150 |
|
151 |
} //end namespace oopse |
152 |
|
153 |
|