1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259 | #ifndef MB_CART_VECT_HPP
#define MB_CART_VECT_HPP
#include <cmath>
#include <iosfwd>
#include <cfloat>
namespace moab
{
/**
* \brief Cartesian Vector
*/
class CartVect
{
private:
double d[3];
public:
inline CartVect() {}
/**Initialze all three values to same scalar (typically zero)*/
explicit inline CartVect( double v )
{
d[0] = d[1] = d[2] = v;
}
inline CartVect( double i, double j, double k )
{
d[0] = i;
d[1] = j;
d[2] = k;
}
/**Initialze from array*/
explicit inline CartVect( const double a[3] )
{
d[0] = a[0];
d[1] = a[1];
d[2] = a[2];
}
inline CartVect& operator=( const double v[3] )
{
d[0] = v[0];
d[1] = v[1];
d[2] = v[2];
return *this;
}
inline double& operator[]( unsigned i )
{
return d[i];
}
inline double operator[]( unsigned i ) const
{
return d[i];
}
inline CartVect& operator+=( const CartVect& v )
{
d[0] += v.d[0];
d[1] += v.d[1];
d[2] += v.d[2];
return *this;
}
inline CartVect& operator-=( const CartVect& v )
{
d[0] -= v.d[0];
d[1] -= v.d[1];
d[2] -= v.d[2];
return *this;
}
/** Assign cross product to this */
inline CartVect& operator*=( const CartVect& v );
inline CartVect& operator+=( double s )
{
d[0] += s;
d[1] += s;
d[2] += s;
return *this;
}
inline CartVect& operator-=( double s )
{
d[0] -= s;
d[1] -= s;
d[2] -= s;
return *this;
}
inline CartVect& operator*=( double s )
{
d[0] *= s;
d[1] *= s;
d[2] *= s;
return *this;
}
inline CartVect& operator/=( double s )
{
d[0] /= s;
d[1] /= s;
d[2] /= s;
return *this;
}
inline bool operator==( const CartVect& v ) const
{
return d[0] == v[0] && d[1] == v[1] && d[2] == v[2];
}
inline bool operator==( double val ) const
{
return d[0] == val && d[1] == val && d[2] == val;
}
inline double length() const; //!< vector length
inline double length_squared() const;
inline void normalize(); //!< make unit length, or 0 if length < DBL_MIN
inline void flip(); //!< flip direction
/** per-element scalar multiply (this[0] *= v[0], this[1] *= v[1], ...) */
inline void scale( const CartVect& v )
{
d[0] *= v.d[0];
d[1] *= v.d[1];
d[2] *= v.d[2];
}
// get pointer to array of three doubles
inline double* array()
{
return d;
}
inline const double* array() const
{
return d;
}
/** initialize double array from this */
inline void get( double v[3] ) const
{
v[0] = d[0];
v[1] = d[1];
v[2] = d[2];
}
/** initialize float array from this */
inline void get( float v[3] ) const
{
v[0] = static_cast< float >( d[0] );
v[1] = static_cast< float >( d[1] );
v[2] = static_cast< float >( d[2] );
}
};
inline CartVect operator+( const CartVect& u, const CartVect& v )
{
return CartVect( u[0] + v[0], u[1] + v[1], u[2] + v[2] );
}
inline CartVect operator-( const CartVect& u, const CartVect& v )
{
return CartVect( u[0] - v[0], u[1] - v[1], u[2] - v[2] );
}
/** cross product */
inline CartVect operator*( const CartVect& u, const CartVect& v )
{
return CartVect( u[1] * v[2] - u[2] * v[1], u[2] * v[0] - u[0] * v[2], u[0] * v[1] - u[1] * v[0] );
}
//! Dot product
inline double operator%( const CartVect& u, const CartVect& v )
{
return u[0] * v[0] + u[1] * v[1] + u[2] * v[2];
}
inline CartVect& CartVect::operator*=( const CartVect& v )
{
return *this = *this * v;
}
inline double CartVect::length() const
{
return std::sqrt( *this % *this );<--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct.
}
inline double CartVect::length_squared() const
{
return d[0] * d[0] + d[1] * d[1] + d[2] * d[2];
}
inline void CartVect::normalize()
{
double tmp = length();
if( tmp < DBL_MIN )
d[0] = d[1] = d[2] = 0;
else
*this /= tmp;
}
inline void CartVect::flip()
{
d[0] = -d[0];
d[1] = -d[1];
d[2] = -d[2];
}
//! Interior angle between two vectors
inline double angle( const CartVect& u, const CartVect& v )
{
double tmp = ( u % v ) / std::sqrt( ( u % u ) * ( v % v ) );<--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct. <--- Same expression on both sides of '%'. [+]Finding the same expression on both sides of an operator is suspicious and might indicate a cut and paste or logic error. Please examine this code carefully to determine if it is correct.
if( tmp > 1. ) tmp = 1.;
if( tmp < -1. ) tmp = -1.;
return std::acos( tmp );
}
inline CartVect operator-( const CartVect& v )
{
return CartVect( -v[0], -v[1], -v[2] );
}
inline CartVect operator+( const CartVect& v, double s )
{
return CartVect( v[0] + s, v[1] + s, v[2] + s );
}
inline CartVect operator-( const CartVect& v, double s )
{
return CartVect( v[0] - s, v[1] - s, v[2] - s );
}
inline CartVect operator*( const CartVect& v, double s )
{
return CartVect( v[0] * s, v[1] * s, v[2] * s );
}
inline CartVect operator/( const CartVect& v, double s )
{
return CartVect( v[0] / s, v[1] / s, v[2] / s );
}
inline CartVect operator+( double s, const CartVect& v )
{
return CartVect( v[0] + s, v[1] + s, v[2] + s );
}
inline CartVect operator-( double s, const CartVect& v )
{
return CartVect( v[0] - s, v[1] - s, v[2] - s );
}
inline CartVect operator*( double s, const CartVect& v )
{
return CartVect( v[0] * s, v[1] * s, v[2] * s );
}
//! Get unit vector in same direction
inline CartVect unit( const CartVect& v )
{
const double len = v.length();
return CartVect( v[0] / len, v[1] / len, v[2] / len );
}
std::ostream& operator<<( std::ostream& s, const CartVect& v );
} // namespace moab
#endif
|