33#include "core/array.h"
34#include "core/geometry3D.h"
39template <
typename _Tp, std::
size_t _Nm>
40struct Array :
public std::array<_Tp, _Nm> {
45 Array(
const std::initializer_list<_Tp> & il) {
46 std::copy_n(il.begin(), il.size() < _Nm ? il.size() : _Nm, this->begin());
48 Array(
const plb::Array<_Tp, _Nm> & ext) {
49 for (std::size_t i = 0; i < _Nm; i++) { (*this)[i] = ext[i]; }
53 for (std::size_t i = 0; i < _Nm; i++) { (*this)[i] += __two[i]; }
58 for (std::size_t i = 0; i < _Nm; i++) { (*this)[i] -= __two[i]; }
63 for (std::size_t i = 0; i < _Nm; i++) { (*this)[i] += __two[i]; }
68 static_assert(_Nm == 3,
"Adding a plb::Dot3D requires a 3-element array");
69 (*this)[0] += __two.x;
70 (*this)[1] += __two.y;
71 (*this)[2] += __two.z;
75 for (std::size_t i = 0; i < _Nm; i++) { (*this)[i] *= mul; }
80 for (std::size_t i = 0; i < _Nm; i++) { (*this)[i] /= div; }
87 std::copy_n(c.begin(), c.size() < _Nm ? c.size() : _Nm, this->begin());
93template <
typename _Tp, std::
size_t _Nm>
96 for (std::size_t i = 0; i < _Nm; i++) { ret[i] = one[i] + two[i]; }
100template <
typename _Tp, std::
size_t _Nm>
103 for (std::size_t i = 0; i < _Nm; i++) { ret[i] = one[i] + two[i]; }
106template <
typename _Tp, std::
size_t _Nm>
109 for (std::size_t i = 0; i < _Nm; i++) { ret[i] = one[i] + two; }
112template <
typename _Tp, std::
size_t _Nm>
115 for (std::size_t i = 0; i < _Nm; i++) { ret[i] = one[i] - two[i]; }
118template <
typename _Tp,
typename _Tp2, std::
size_t _Nm>
121 for (std::size_t i = 0; i < _Nm; i++) { ret[i] = one[i] - two[i]; }
124template <
typename _Tp, std::
size_t _Nm>
127 for (std::size_t i = 0; i < _Nm; i++) { ret[i] = -one[i]; }
131template <
typename _Tp, std::
size_t _Nm,
typename _Tp2>
134 for (std::size_t i = 0; i < _Nm; i++) { ret[i] = one[i] / div; }
138template <
typename _Tp, std::
size_t _Nm,
typename _Tp2>
141 for (std::size_t i = 0; i < _Nm; i++) { ret[i] = one[i] * mul; }
145template <
typename _Tp, std::
size_t _Nm,
typename _Tp2>
148 for (std::size_t i = 0; i < _Nm; i++) { ret[i] = one[i] * mul; }
152template <
typename _Tp>
155 ret[0] = one[0] - two.x;
156 ret[1] = one[1] - two.y;
157 ret[2] = one[2] - two.z;
161template <
typename _Tp,
typename _Tp2,
typename _Tp3>
163 result[0] = one[1] * two[2] - one[2] * two[1];
164 result[1] = one[2] * two[0] - one[0] * two[2];
165 result[2] = one[0] * two[1] - one[1] * two[0];
168template <
typename _Tp>
175template <
typename _Tp,
typename _Tp2>
182template <
typename _Tp, std::
size_t _Nm>
185 for (std::size_t i = 0; i < _Nm; i++) { ret += one[i] * two[i]; }
189template <
typename _Tp,
typename _Tp2, std::
size_t _Nm>
192 for (std::size_t i = 0; i < _Nm; i++) { ret += one[i] * two[i]; }
196template <
typename _Tp, std::
size_t _Nm>
199 for (std::size_t i = 0; i < _Nm; i++) { ret += (one[i]) * (one[i]); }
200 return std::sqrt(ret);
203template <
typename _Tp>
207 return std::atan2(
norm(cross),
dot(one, two));
210template <
typename _Tp>
217 return (_Tp)0.5 *
norm(cross);
220template <
typename _Tp>
222 return sqrt(v[0] * v[0] + v[1] * v[1] + v[2] * v[2]);
225template <
typename _Tp>
232 _Tp normN =
norm(unitNormal);
234 area = (_Tp)0.5 * normN;
242template <
typename _Tp>
244 bool isAreaWeighted) {
250 if (!isAreaWeighted) {
261template <
typename _Tp>
263 const _Tp adj_norm =
dot(a, b) /
norm(b);
265 const _Tp hyp_norm =
norm(a);
266 const _Tp opp_norm = std::sqrt(std::pow(hyp_norm, 2) - std::pow(adj_norm, 2));
267 return adj_norm / opp_norm;
270template <
typename _Tp>
275 b_l = std::sqrt(std::pow(c_l, 2) - std::pow(a_l, 2));
double T
Definition constant_defaults.h:137
void crossProduct(const Array< _Tp, 3 > &one, const Array< _Tp2, 3 > &two, Array< _Tp3, 3 > &result)
Definition array.h:162
_Tp angleBetweenVectors(const Array< _Tp, 3 > &one, const Array< _Tp, 3 > &two)
Definition array.h:204
Array< _Tp, _Nm > operator/(const Array< _Tp, _Nm > &one, const _Tp2 div)
Definition array.h:132
Array< _Tp, _Nm > operator-(const Array< _Tp, _Nm > &one, const Array< _Tp, _Nm > &two)
Definition array.h:113
_Tp computeCotangentFromVectors(const Array< _Tp, 3 > &a, const Array< _Tp, 3 > &b)
Definition array.h:262
void computeTriangleAreaAndUnitNormal(const Array< _Tp, 3 > &v0, const Array< _Tp, 3 > &v1, const Array< _Tp, 3 > &v2, _Tp &area, Array< _Tp, 3 > &unitNormal)
Definition array.h:226
Array< _Tp, _Nm > operator*(const Array< _Tp, _Nm > &one, const _Tp2 mul)
Definition array.h:139
_Tp computeLength(const Array< _Tp, 3 > &v)
Definition array.h:221
_Tp norm(const Array< _Tp, _Nm > &one)
Definition array.h:197
Array< _Tp, 3 > computeTriangleNormal(const Array< _Tp, 3 > &v0, const Array< _Tp, 3 > &v1, const Array< _Tp, 3 > &v2, bool isAreaWeighted)
Definition array.h:243
Array< _Tp, _Nm > operator+(const Array< _Tp, _Nm > &one, const Array< _Tp, _Nm > &two)
Definition array.h:94
_Tp dot(const Array< _Tp, _Nm > &one, const Array< _Tp, _Nm > &two)
Definition array.h:183
void computeLengthsPythagoras(const Array< _Tp, 3 > &a, const Array< _Tp, 3 > &b, _Tp &a_l, _Tp &b_l, _Tp &c_l)
Definition array.h:271
_Tp computeTriangleArea(const Array< _Tp, 3 > &v0, const Array< _Tp, 3 > &v1, const Array< _Tp, 3 > &v2)
Definition array.h:211
Array()
Elements are left uninitialised (deliberately, for speed).
Definition array.h:42
Array< _Tp, _Nm > & operator/=(const _Tp &div)
Definition array.h:79
Array< _Tp, _Nm > & operator*=(const _Tp &mul)
Definition array.h:74
Array(const std::initializer_list< _Tp > &il)
Definition array.h:45
Array< _Tp, _Nm > & operator+=(const plb::Dot3D &__two)
Definition array.h:67
Array< _Tp, _Nm > & operator+=(const plb::Array< _Tp, _Nm > &__two)
Definition array.h:62
Array(const plb::Array< _Tp, _Nm > &ext)
Definition array.h:48
void resetToZero()
Definition array.h:90
Array< _Tp, _Nm > & operator=(const std::initializer_list< _Tp > &c)
Definition array.h:85
Array< _Tp, _Nm > & operator+=(const hemo::Array< _Tp, _Nm > &__two)
Definition array.h:52
Array< _Tp, _Nm > & operator-=(const hemo::Array< _Tp, _Nm > &__two)
Definition array.h:57