226 lines
6.9 KiB
C++
226 lines
6.9 KiB
C++
/*
|
|
* This file is part of libgim.
|
|
*
|
|
* libgim is free software: you can redistribute it and/or modify it under the
|
|
* terms of the GNU General Public License as published by the Free Software
|
|
* Foundation, either version 3 of the License, or (at your option) any later
|
|
* version.
|
|
*
|
|
* libgim is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
|
|
* details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with libgim. If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
* Copyright 2011 Danny Robson <danny@nerdcruft.net>
|
|
*/
|
|
|
|
#include "point.hpp"
|
|
|
|
#include "debug.hpp"
|
|
#include "maths.hpp"
|
|
|
|
#include <cmath>
|
|
#include <cstdlib>
|
|
|
|
using namespace std;
|
|
|
|
#if defined(COMPILER_GCC)
|
|
#pragma GCC optimize("-O3")
|
|
#endif
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
util::point<S,T>::point ()
|
|
{ ; }
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
util::point<S,T>&
|
|
util::point<S,T>::operator*= (T f) {
|
|
for (auto &i: this->data)
|
|
i *= f;
|
|
|
|
return *this;
|
|
}
|
|
|
|
|
|
template <size_t S, typename T>
|
|
util::point<S,T>
|
|
util::point<S,T>::operator* (T f) const {
|
|
util::point<S,T> out;
|
|
|
|
for (size_t i = 0; i < S; ++i)
|
|
out.data[i] = this->data[i] * f;
|
|
return out;
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
util::point<S,T>
|
|
util::point<S,T>::operator- (const vector<S,T> &rhs) const {
|
|
util::point<S,T> out;
|
|
|
|
for (size_t i = 0; i < S; ++i)
|
|
out.data[i] = this->data[i] - rhs.data[i];
|
|
return out;
|
|
}
|
|
|
|
|
|
template <size_t S, typename T>
|
|
util::point<S,T>&
|
|
util::point<S,T>::operator-= (const util::vector<S,T> &rhs) {
|
|
for (size_t i = 0; i < S; ++i)
|
|
this->data[i] -= rhs.data[i];
|
|
return *this;
|
|
}
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
util::point<S,T>
|
|
util::point<S,T>::operator+ (const vector<S,T> &rhs) const {
|
|
util::point<S,T> out;
|
|
|
|
for (size_t i = 0; i < S; ++i)
|
|
out.data[i] = this->data[i] + rhs.data[i];
|
|
return out;
|
|
}
|
|
|
|
|
|
template <size_t S, typename T>
|
|
util::point<S,T>&
|
|
util::point<S,T>::operator+= (const util::vector<S,T> &rhs) {
|
|
for (size_t i = 0; i < S; ++i)
|
|
this->data[i] += rhs.data[i];
|
|
return *this;
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
util::point<S,T>
|
|
util::point<S,T>::operator- (const point<S,T> &rhs) const {
|
|
util::point<S,T> out;
|
|
|
|
for (size_t i = 0; i < S; ++i)
|
|
out.data[i] = this->data[i] - rhs.data[i];
|
|
return out;
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
util::vector<S,T>
|
|
util::point<S,T>::to (const point<S,T> &rhs) const {
|
|
util::vector<S,T> out;
|
|
|
|
for (size_t i = 0; i < S; ++i)
|
|
out.data[i] = rhs.data[i] - this->data[i];
|
|
return out;
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
bool
|
|
util::point<S,T>::operator== (const util::point<S,T> &rhs) const
|
|
{
|
|
return std::equal (std::begin (this->data),
|
|
std::end (this->data),
|
|
std::begin (rhs.data));
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
void
|
|
util::point<S,T>::sanity (void) const {
|
|
CHECK_SOFT (std::all_of (begin (this->data),
|
|
end (this->data),
|
|
[] (double i) { return !std::isnan (i); }));
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
const util::point<S,T> util::point<S,T>::ORIGIN (T {0});
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
util::point<S,T>
|
|
util::operator* (const vector<S,T> &v, const point<S,T> &p) {
|
|
point<S,T> out;
|
|
for (size_t i = 0; i < S; ++i)
|
|
out.data[i] = p.data[i] + v.data[i];
|
|
|
|
return out;
|
|
}
|
|
|
|
|
|
template util::point<1,float> util::operator* (const vector<1,float>&, const point<1,float>&);
|
|
template util::point<2,float> util::operator* (const vector<2,float>&, const point<2,float>&);
|
|
template util::point<3,float> util::operator* (const vector<3,float>&, const point<3,float>&);
|
|
|
|
template util::point<1,double> util::operator* (const vector<1,double>&, const point<1,double>&);
|
|
template util::point<2,double> util::operator* (const vector<2,double>&, const point<2,double>&);
|
|
template util::point<3,double> util::operator* (const vector<3,double>&, const point<3,double>&);
|
|
|
|
|
|
template <size_t S, typename T>
|
|
util::point<S,T>
|
|
util::operator* (const point<S,T> &p, const vector<S,T> &v)
|
|
{ return v * p; }
|
|
|
|
|
|
template util::point<1,float> util::operator* (const point<1,float>&, const vector<1,float>&);
|
|
template util::point<2,float> util::operator* (const point<2,float>&, const vector<2,float>&);
|
|
template util::point<3,float> util::operator* (const point<3,float>&, const vector<3,float>&);
|
|
|
|
template util::point<1,double> util::operator* (const point<1,double>&, const vector<1,double>&);
|
|
template util::point<2,double> util::operator* (const point<2,double>&, const vector<2,double>&);
|
|
template util::point<3,double> util::operator* (const point<3,double>&, const vector<3,double>&);
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
template <size_t S, typename T>
|
|
std::ostream&
|
|
util::operator<< (std::ostream &os, const util::point<S,T> &p) {
|
|
os << "point" << S << "(";
|
|
os << p.data[0];
|
|
|
|
for (size_t i = 1; i < S; ++i)
|
|
os << ", " << p.data[i];
|
|
|
|
os << ")";
|
|
return os;
|
|
}
|
|
|
|
|
|
template std::ostream& util::operator<< (std::ostream &os, const util::point<1,float>&);
|
|
template std::ostream& util::operator<< (std::ostream &os, const util::point<2,float>&);
|
|
template std::ostream& util::operator<< (std::ostream &os, const util::point<3,float>&);
|
|
|
|
template std::ostream& util::operator<< (std::ostream &os, const util::point<1,double>&);
|
|
template std::ostream& util::operator<< (std::ostream &os, const util::point<2,double>&);
|
|
template std::ostream& util::operator<< (std::ostream &os, const util::point<3,double>&);
|
|
|
|
template std::ostream& util::operator<< (std::ostream &os, const util::point<1,size_t>&);
|
|
template std::ostream& util::operator<< (std::ostream &os, const util::point<2,size_t>&);
|
|
template std::ostream& util::operator<< (std::ostream &os, const util::point<3,size_t>&);
|
|
|
|
#define INSTANTIATE(T) \
|
|
template struct util::point<1,T>; \
|
|
template struct util::point<2,T>; \
|
|
template struct util::point<3,T>;
|
|
|
|
INSTANTIATE(int32_t)
|
|
INSTANTIATE(uint32_t)
|
|
INSTANTIATE(int64_t)
|
|
INSTANTIATE(uint64_t)
|
|
INSTANTIATE(float)
|
|
INSTANTIATE(double)
|