2021-03-12 21:33:46 +00:00
|
|
|
#ifndef SDLPP_HPP_LINE
|
|
|
|
#define SDLPP_HPP_LINE
|
|
|
|
|
|
|
|
#include "sdlpp_common.hpp"
|
|
|
|
#include "sdlpp_vector.hpp"
|
2021-03-13 14:05:16 +00:00
|
|
|
#include <iostream>
|
2021-03-12 21:33:46 +00:00
|
|
|
|
|
|
|
namespace SDLPP {
|
|
|
|
template<typename T>
|
|
|
|
class SDLPPSCOPE Line {
|
|
|
|
public:
|
|
|
|
Line() = delete;
|
|
|
|
~Line() = default;
|
|
|
|
Line( const Vec2D<T> &start, const Vec2D<T> &end )
|
2021-03-13 14:05:16 +00:00
|
|
|
: _start( start ), _end( end ) {
|
|
|
|
updateMost();
|
|
|
|
}
|
2021-03-12 21:33:46 +00:00
|
|
|
Line( T x_1, T y_1, T x_2, T y_2 )
|
2021-03-13 14:05:16 +00:00
|
|
|
: Line( { x_1, y_1 }, { x_2, y_2 } ) {}
|
2021-03-12 21:33:46 +00:00
|
|
|
Line( const Vec2D<T> &start, const Vec2D<T> &end, bool infinite )
|
2021-03-13 14:05:16 +00:00
|
|
|
: Line( start, end ), _infinite( infinite ) {}
|
2021-03-12 21:33:46 +00:00
|
|
|
Line( T x_1, T y_1, T x_2, T y_2, bool infinite )
|
2021-03-13 14:05:16 +00:00
|
|
|
: Line( { x_1, y_1 }, { x_2, y_2 }, infinite ) {}
|
|
|
|
Line(const Line &input) : Line(input.getStart(), input.getEnd()) {}
|
|
|
|
Line &operator=(const Line &input) {
|
|
|
|
_start = input.getStart();
|
|
|
|
_end = input.getEnd();
|
|
|
|
updateMost();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
void updateMost() {
|
|
|
|
if(_start.getY() < _end.getY()) {
|
|
|
|
top = &_start;
|
|
|
|
bottom = &_end;
|
|
|
|
} else {
|
|
|
|
top = &_end;
|
|
|
|
bottom = &_start;
|
|
|
|
}
|
|
|
|
if(_start.getX() < _end.getX()) {
|
|
|
|
left = &_start;
|
|
|
|
right = &_end;
|
|
|
|
} else {
|
|
|
|
left = &_end;
|
|
|
|
right = &_start;
|
|
|
|
}
|
|
|
|
}
|
2021-03-12 21:33:46 +00:00
|
|
|
const Vec2D<T> &getStart() const {
|
|
|
|
return _start;
|
|
|
|
}
|
|
|
|
const Vec2D<T> &getEnd() const {
|
|
|
|
return _end;
|
|
|
|
}
|
|
|
|
double length() const {
|
|
|
|
return vecDistance( _start, _end );
|
|
|
|
}
|
|
|
|
double lengthSquared() const {
|
|
|
|
return vecDistanceSquared( _start, _end );
|
|
|
|
}
|
|
|
|
void setInfinite( bool infinite ) {
|
|
|
|
_infinite = infinite;
|
|
|
|
}
|
|
|
|
bool isInfinite() {
|
|
|
|
return _infinite;
|
|
|
|
}
|
|
|
|
void add(const Vec2D<T> &vec) {
|
|
|
|
_start += vec;
|
|
|
|
_end += vec;
|
|
|
|
}
|
2021-03-13 14:05:16 +00:00
|
|
|
const Vec2D<T> &topmost() const {
|
|
|
|
return *top;
|
|
|
|
}
|
|
|
|
const Vec2D<T> &bottomost() const {
|
|
|
|
return *bottom;
|
|
|
|
}
|
|
|
|
const Vec2D<T> &leftmost() const {
|
|
|
|
return *left;
|
|
|
|
}
|
|
|
|
const Vec2D<T> &rightmost() const {
|
|
|
|
return *right;
|
|
|
|
}
|
2021-03-12 21:33:46 +00:00
|
|
|
|
|
|
|
private:
|
|
|
|
Vec2D<T> _start;
|
|
|
|
Vec2D<T> _end;
|
2021-03-13 14:05:16 +00:00
|
|
|
Vec2D<T> *top = nullptr;
|
|
|
|
Vec2D<T> *bottom = nullptr;
|
|
|
|
Vec2D<T> *left = nullptr;
|
|
|
|
Vec2D<T> *right = nullptr;
|
2021-03-12 21:33:46 +00:00
|
|
|
bool _infinite = false;
|
|
|
|
};
|
|
|
|
} // namespace SDLPP
|
|
|
|
|
|
|
|
#endif
|