BLT/include/blt/math/vectors.h

266 lines
8.5 KiB
C
Raw Normal View History

/*
* Created by Brett on 28/02/23.
* Licensed under GNU General Public License V3.0
* See LICENSE file for license detail
*/
#ifndef BLT_TESTS_VECTORS_H
#define BLT_TESTS_VECTORS_H
#include <initializer_list>
#include <cmath>
2023-02-28 23:31:39 -05:00
namespace blt {
template<typename T, unsigned long size>
struct vec {
private:
T elements[size]{};
public:
vec() {
for (int i = 0; i < size; i++)
elements[i] = 0;
}
2023-02-28 23:31:39 -05:00
vec(std::initializer_list<T> args): vec() {
for (int i = 0; i < args.size(); i++) {
elements[i] = *(args.begin() + i);
}
}
2023-02-28 23:31:39 -05:00
explicit vec(const T elem[size]) {
for (int i = 0; i < size; i++) {
elements[i] = elem[i];
}
}
vec(const vec<T, size>& copy): vec(copy.elements) {}
[[nodiscard]] inline T x() const {
return elements[0];
}
2023-02-28 23:31:39 -05:00
[[nodiscard]] inline T y() const {
static_assert(size > 1);
return elements[1];
}
2023-02-28 23:31:39 -05:00
[[nodiscard]] inline T z() const {
static_assert(size > 2);
return elements[2];
}
2023-02-28 23:31:39 -05:00
[[nodiscard]] inline T w() const {
static_assert(size > 3);
return elements[3];
}
2023-02-28 23:31:39 -05:00
2023-03-08 23:49:57 -05:00
[[nodiscard]] inline T magnitude() const {
T total = 0;
for (int i = 0; i < size; i++)
total += elements[i] * elements[i];
return std::sqrt(total);
}
2023-03-14 18:05:24 -04:00
[[nodiscard]] inline vec<T, size> normalize() const {
2023-03-14 18:04:53 -04:00
auto mag = this->magnitude();
if (mag == 0)
return *this;
return *this / mag;
2023-03-08 23:49:57 -05:00
}
2023-02-28 23:31:39 -05:00
inline T& operator[](int index) {
return elements[index];
}
inline T operator[](int index) const {
return elements[index];
}
inline vec<T, size>& operator=(T v) {
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
elements[i] = v;
2023-02-28 23:31:39 -05:00
return *this;
}
inline vec<T, size> operator-() {
T negativeCopy[size];
for (int i = 0; i < size; i++)
negativeCopy[i] = -elements[i];
return vec<T, size>{negativeCopy};
}
inline vec<T, size>& operator+=(const vec<T, size>& other) {
for (int i = 0; i < size; i++)
elements[i] += other[i];
return *this;
}
inline vec<T, size>& operator*=(const vec<T, size>& other) {
for (int i = 0; i < size; i++)
elements[i] *= other[i];
return *this;
}
inline vec<T, size>& operator+=(T f) {
for (int i = 0; i < size; i++)
elements[i] += f;
return *this;
}
inline vec<T, size>& operator*=(T f) {
for (int i = 0; i < size; i++)
elements[i] *= f;
return *this;
}
inline vec<T, size>& operator-=(const vec<T, size>& other) {
for (int i = 0; i < size; i++)
elements[i] -= other[i];
return *this;
}
inline vec<T, size>& operator-=(T f) {
for (int i = 0; i < size; i++)
elements[i] -= f;
return *this;
}
/**
* performs the dot product of left * right
*/
static inline T dot(const vec<T, size>& left, const vec<T, size>& right) {
T dot = 0;
for (int i = 0; i < size; i++)
dot += left[i] * right[i];
return dot;
}
2023-03-10 17:01:44 -05:00
static inline vec<T, size> cross(const vec<T, size>& left, const vec<T, size>& right) {
// cross is only defined on vectors of size 3. 2D could be implemented, which is a TODO
static_assert(size == 3);
return {left.y() * right.z() - left.z() * right.y(),
left.z() * right.x() - left.x() * right.z(),
left.x() * right.y() - left.y() * right.x()};
}
2023-03-10 17:24:00 -05:00
static inline vec<T, size> project(const vec<T, size>& u, const vec<T, size>& v){
float du = dot(u);
float dv = dot(v);
return (du / dv) * v;
}
2023-02-28 23:31:39 -05:00
};
template<typename T, unsigned long size>
inline vec<T, size> operator+(const vec<T, size>& left, const vec<T, size>& right) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = left[i] + right[i];
return vec<T, size>{initializer};
}
template<typename T, unsigned long size>
inline vec<T, size> operator-(const vec<T, size>& left, const vec<T, size>& right) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = left[i] - right[i];
return vec<T, size>{initializer};
}
template<typename T, unsigned long size>
inline vec<T, size> operator+(const vec<T, size>& left, float f) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = left[i] + f;
return vec<T, size>{initializer};
}
template<typename T, unsigned long size>
inline vec<T, size> operator-(const vec<T, size>& left, float f) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = left[i] + f;
return vec<T, size>{initializer};
}
template<typename T, unsigned long size>
inline vec<T, size> operator+(float f, const vec<T, size>& right) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = f + right[i];
return vec<T, size>{initializer};
}
template<typename T, unsigned long size>
inline vec<T, size> operator-(float f, const vec<T, size>& right) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = f - right[i];
return vec<T, size>{initializer};
}
template<typename T, unsigned long size>
inline vec<T, size> operator*(const vec<T, size>& left, const vec<T, size>& right) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = left[i] * right[i];
return vec<T, size>{initializer};
}
template<typename T, unsigned long size>
inline vec<T, size> operator*(const vec<T, size>& left, float f) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = left[i] * f;
return vec<T, size>{initializer};
}
template<typename T, unsigned long size>
inline vec<T, size> operator*(float f, const vec<T, size>& right) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = f * right[i];
return vec<T, size>{initializer};
}
template<typename T, unsigned long size>
inline vec<T, size> operator/(const vec<T, size>& left, float f) {
T initializer[size];
2023-02-28 23:31:39 -05:00
for (int i = 0; i < size; i++)
initializer[i] = left[i] / f;
return vec<T, size>{initializer};
}
typedef vec<float, 2> vec2f;
typedef vec<float, 3> vec3f;
typedef vec<float, 4> vec4f;
typedef vec<double, 2> vec2d;
typedef vec<double, 3> vec3d;
typedef vec<double, 4> vec4d;
typedef vec<int, 2> vec2i;
typedef vec<int, 3> vec3i;
typedef vec<int, 4> vec4i;
typedef vec<long long, 2> vec2l;
typedef vec<long long, 3> vec3l;
typedef vec<long long, 4> vec4l;
typedef vec<unsigned int, 2> vec2ui;
typedef vec<unsigned int, 3> vec3ui;
typedef vec<unsigned int, 4> vec4ui;
typedef vec<unsigned long long, 2> vec2ul;
typedef vec<unsigned long long, 3> vec3ul;
typedef vec<unsigned long long, 4> vec4ul;
typedef vec2f vec2;
typedef vec3f vec3;
typedef vec4f vec4;
}
#endif //BLT_TESTS_VECTORS_H