Sebastian
145 lines
2.9 KiB
C++
145 lines
2.9 KiB
C++
#pragma once
|
|
|
|
#include <cmath>
|
|
#include <math.h>
|
|
|
|
|
|
enum Distribution {ROUNDROBIN, RANDOM};
|
|
|
|
// 2D Vectors
|
|
|
|
template<typename T>
|
|
class Vec2D{
|
|
public:
|
|
|
|
Vec2D() {};
|
|
Vec2D(T x, T y) : x(x), y(y) {}
|
|
T x = 0;
|
|
T y = 0;
|
|
T dist(Vec2D* v) { return sqrt(pow((v->x - x), 2) + pow((v->y - y), 2));};
|
|
|
|
T length() { return (T)sqrt(pow(x, 2) + pow(y, 2));};
|
|
|
|
T angle(Vec2D &v){
|
|
T angle = atan2(v.y, v.x) - atan2(y,x);
|
|
if(angle > M_PI) angle -= M_PI_2;
|
|
if(angle < -M_PI) angle += M_PI_2;
|
|
return angle;
|
|
//return acos(dot(v));
|
|
};
|
|
|
|
T angleDeg(Vec2D &v){
|
|
|
|
return angle(v) * 180 / M_PI;
|
|
};
|
|
|
|
T dot(Vec2D &v){
|
|
return (x*v.x) + (y*v.y);
|
|
};
|
|
|
|
Vec2D orth(Vec2D &v){
|
|
return Vec2D(-v.y, v.x);
|
|
};
|
|
|
|
Vec2D orth(){
|
|
return Vec2D(-y, x);
|
|
};
|
|
|
|
Vec2D norm() { return *this / length();};
|
|
|
|
|
|
Vec2D& operator=(const Vec2D& vec){
|
|
if (this == &vec){
|
|
return *this;
|
|
}
|
|
x = vec.x;
|
|
y = vec.y;
|
|
return *this;
|
|
};
|
|
|
|
Vec2D& operator+=(const Vec2D& vec){
|
|
this->x += vec.x;
|
|
this->y += vec.y;
|
|
return *this;
|
|
};
|
|
|
|
Vec2D& operator-=(const Vec2D& vec){
|
|
this->x -= vec.x;
|
|
this->y -= vec.y;
|
|
return *this;
|
|
};
|
|
|
|
Vec2D& operator*=(const Vec2D& vec){
|
|
this->x *= vec.x;
|
|
this->y *= vec.y;
|
|
return *this;
|
|
};
|
|
|
|
Vec2D& operator/=(const Vec2D& vec){
|
|
this->x /= vec.x;
|
|
this->y /= vec.y;
|
|
return *this;
|
|
};
|
|
|
|
Vec2D& operator*=(T scalar){
|
|
this->x *= scalar;
|
|
this->y *= scalar;
|
|
return *this;
|
|
};
|
|
|
|
Vec2D& operator/=(T scalar){
|
|
this->x /= scalar;
|
|
this->y /= scalar;
|
|
return *this;
|
|
};
|
|
|
|
};
|
|
|
|
template<typename T>
|
|
Vec2D<T> operator+(const Vec2D<T>& left, const Vec2D<T>& right){
|
|
return Vec2D<T>(left.x + right.x, left.y + right.y);
|
|
};
|
|
|
|
template<typename T>
|
|
Vec2D<T> operator-(const Vec2D<T>& left, const Vec2D<T>& right){
|
|
return Vec2D<T>(left.x - right.x, left.y - right.y);
|
|
};
|
|
|
|
template<typename T>
|
|
Vec2D<T> operator*(const Vec2D<T>& left, const Vec2D<T>& right){
|
|
return Vec2D<T>(left.x * right.x, left.y * right.y);
|
|
};
|
|
|
|
template<typename T>
|
|
Vec2D<T> operator/(const Vec2D<T>& left, const Vec2D<T>& right){
|
|
return Vec2D<T>(left.x / right.x, left.y / right.y);
|
|
};
|
|
|
|
template<typename T>
|
|
Vec2D<T> operator/(const Vec2D<T>& left, T scalar){
|
|
return Vec2D<T>(left.x / scalar, left.y / scalar);
|
|
};
|
|
|
|
template<typename T>
|
|
Vec2D<T> operator*(const Vec2D<T>& left, T scalar){
|
|
return Vec2D<T>(left.x * scalar, left.y * scalar);
|
|
};
|
|
|
|
/*template <typename T>*/
|
|
/*bool contains(T X, T Y) {*/
|
|
/* for (unsigned int i=0;i<Coords.size()-2;i+=2)*/
|
|
/* {*/
|
|
/* if (((Y-Coords[i+1])*(Coords[i+2]-Coords[i]) - (X-Coords[i])*(Coords[i+3]-Coords[i+1]))<0)*/
|
|
/* {*/
|
|
/* return (false);*/
|
|
/* }*/
|
|
/* }*/
|
|
/* //The last test is special*/
|
|
/* unsigned int j = Coords.size();*/
|
|
/* if (((Y-Coords[j-1])*(Coords[0]-Coords[j-2]) - (X-Coords[j-2])*(Coords[1]-Coords[j-1]))<0)*/
|
|
/* {*/
|
|
/* return (false);*/
|
|
/* }*/
|
|
/* return (true);*/
|
|
/*}*/
|