Add quaternions. Move math to separate directory
This commit is contained in:
rexy712
193
include/math/vec.tpp
Normal file
193
include/math/vec.tpp
Normal file
@@ -0,0 +1,193 @@
|
||||
/**
|
||||
This file is a part of our_dick
|
||||
Copyright (C) 2020 rexy712
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU Affero General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program 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 Affero General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Affero General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef REXY_VEC_TPP
|
||||
#define REXY_VEC_TPP
|
||||
|
||||
namespace math{
|
||||
|
||||
template<typename T, size_t R>
|
||||
template<typename U>
|
||||
constexpr vector<T,R>& vector<T,R>::operator=(const vector<U,R>& m){
|
||||
base::operator=(m);
|
||||
return *this;
|
||||
}
|
||||
template<typename T, size_t R>
|
||||
constexpr auto vector<T,R>::operator[](size_type i) -> reference{
|
||||
return this->m_data[i];
|
||||
}
|
||||
template<typename T, size_t R>
|
||||
constexpr auto vector<T,R>::operator[](size_type i)const -> const_reference{
|
||||
return this->m_data[i];
|
||||
}
|
||||
|
||||
template<typename T, size_t R>
|
||||
constexpr auto vector<T,R>::x() -> reference{
|
||||
return this->m_data[0];
|
||||
}
|
||||
template<typename T, size_t R>
|
||||
constexpr auto vector<T,R>::x()const -> const_reference{
|
||||
return this->m_data[0];
|
||||
}
|
||||
template<typename T, size_t R>
|
||||
template<typename U>
|
||||
constexpr auto vector<T,R>::y() -> reference{
|
||||
static_assert(R > 1, "Vector does not contain a 2nd element");
|
||||
return this->m_data[1];
|
||||
}
|
||||
template<typename T, size_t R>
|
||||
template<typename U>
|
||||
constexpr auto vector<T,R>::y()const -> const_reference{
|
||||
static_assert(R > 1, "Vector does not contain a 2nd element");
|
||||
return this->m_data[1];
|
||||
}
|
||||
template<typename T, size_t R>
|
||||
template<typename U>
|
||||
constexpr auto vector<T,R>::z() -> reference{
|
||||
static_assert(R > 2, "Vector does not contain a 3rd element");
|
||||
return this->m_data[2];
|
||||
}
|
||||
template<typename T, size_t R>
|
||||
template<typename U>
|
||||
constexpr auto vector<T,R>::z()const -> const_reference{
|
||||
static_assert(R > 2, "Vector does not contain a 3rd element");
|
||||
return this->m_data[2];
|
||||
}
|
||||
template<typename T, size_t R>
|
||||
template<typename U>
|
||||
constexpr auto vector<T,R>::w() -> reference{
|
||||
static_assert(R > 3, "Vector does not contain a 4th element");
|
||||
return this->m_data[3];
|
||||
}
|
||||
template<typename T, size_t R>
|
||||
template<typename U>
|
||||
constexpr auto vector<T,R>::w()const -> const_reference{
|
||||
static_assert(R > 3, "Vector does not contain a 4th element");
|
||||
return this->m_data[3];
|
||||
}
|
||||
|
||||
template<typename T, typename U, size_t C, size_t R>
|
||||
constexpr auto operator*(const matrix<U,R,C>& left, const vector<T,C>& right){
|
||||
using res_t = decltype(std::declval<T>() * std::declval<U>());
|
||||
vector<res_t,R> res(zero_initialize);
|
||||
size_t index = 0;
|
||||
//columns == rows
|
||||
for(size_t i = 0;i < R;++i){
|
||||
for(size_t k = 0;k < C;++k){
|
||||
res.get(index) += left[i][k] * right[k];
|
||||
}
|
||||
++index;
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template<typename T, typename U, size_t R>
|
||||
constexpr auto operator*(const vector<T,R>& left, const vector<U,R>& right){
|
||||
using res_t = decltype(std::declval<T>() * std::declval<U>());
|
||||
res_t res = 0;
|
||||
for(size_t i = 0;i < R;++i){
|
||||
res += left[i] * right[i];
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template<typename T, typename U, size_t R, std::enable_if_t<!is_matrix<U>::value,int>>
|
||||
constexpr auto operator*(const vector<T,R>& left, U&& right){
|
||||
using res_t = decltype(std::declval<T>() * std::declval<U>());
|
||||
vector<res_t,R> res(zero_initialize);
|
||||
for(size_t i = 0;i < R;++i){
|
||||
res[i] = left[i] * std::forward<U>(right);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template<typename T, typename U, size_t R, std::enable_if_t<!is_matrix<U>::value,int>>
|
||||
constexpr auto operator*(U&& left, const vector<T,R>& right){
|
||||
using res_t = decltype(std::declval<U>() * std::declval<T>());
|
||||
vector<res_t,R> res(zero_initialize);
|
||||
for(size_t i = 0;i < R;++i){
|
||||
res[i] = std::forward<U>(right) * left[i];
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template<typename T, typename U, size_t R, std::enable_if_t<!is_matrix<U>::value,int>>
|
||||
constexpr auto operator/(const vector<T,R>& left, U&& right){
|
||||
using res_t = decltype(std::declval<T>() / std::declval<U>());
|
||||
vector<res_t,R> res(zero_initialize);
|
||||
for(size_t i = 0;i < R;++i){
|
||||
res[i] = left[i] / std::forward<U>(right);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template<typename T, typename U, size_t R>
|
||||
constexpr auto operator+(const vector<T,R>& left, const vector<U,R>& right){
|
||||
using res_t = decltype(std::declval<T>() + std::declval<U>());
|
||||
vector<res_t,R> res(zero_initialize);
|
||||
for(size_t i = 0;i < R;++i){
|
||||
res[i] = left[i] + right[i];
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template<typename T, typename U, size_t R>
|
||||
constexpr auto operator-(const vector<T,R>& left, const vector<U,R>& right){
|
||||
using res_t = decltype(std::declval<T>() - std::declval<U>());
|
||||
vector<res_t,R> res(zero_initialize);
|
||||
for(size_t i = 0;i < R;++i){
|
||||
res[i] = left[i] - right[i];
|
||||
}
|
||||
return res;
|
||||
}
|
||||
template<typename T, typename U, size_t R>
|
||||
constexpr auto operator-(const vector<T,R>& left){
|
||||
using res_t = decltype(-std::declval<U>());
|
||||
vector<res_t,R> res(zero_initialize);
|
||||
for(size_t i = 0;i < R;++i){
|
||||
res[i] = -left[i];
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
template<typename T, typename U, size_t R, std::enable_if_t<!is_matrix<U>::value,int>>
|
||||
constexpr decltype(auto) operator*=(vector<T,R>& left, U&& right){
|
||||
for(size_t i = 0;i < R;++i){
|
||||
left[i] *= right;
|
||||
}
|
||||
return left;
|
||||
}
|
||||
template<typename T, typename U, size_t R, std::enable_if_t<!is_matrix<U>::value,int>>
|
||||
constexpr decltype(auto) operator/=(vector<T,R>& left, U&& right){
|
||||
for(size_t i = 0;i < R;++i){
|
||||
left[i] /= right;
|
||||
}
|
||||
return left;
|
||||
}
|
||||
template<typename T, typename U, size_t R>
|
||||
constexpr decltype(auto) operator+=(vector<T,R>& left, const vector<U,R>& right){
|
||||
for(size_t i = 0;i < R;++i){
|
||||
left[i] += right[i];
|
||||
}
|
||||
return left;
|
||||
}
|
||||
template<typename T, typename U, size_t R>
|
||||
constexpr decltype(auto) operator-=(vector<T,R>& left, const vector<U,R>& right){
|
||||
for(size_t i = 0;i < R;++i){
|
||||
left[i] -= right[i];
|
||||
}
|
||||
return left;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
#endif
|
||||
Reference in New Issue
Block a user