61 lines
1.8 KiB
C++
61 lines
1.8 KiB
C++
#include "sdlpp_collision.hpp"
|
|
|
|
namespace SDLPP {
|
|
CollisionPolygon::CollisionPolygon( double x, double y ) {
|
|
original_x = x;
|
|
original_y = y;
|
|
position_x = 0;
|
|
position_y = 0;
|
|
}
|
|
|
|
bool CollisionPolygon::isInfinite() const {
|
|
return infinite;
|
|
}
|
|
void CollisionPolygon::setInfinite() {
|
|
infinite = true;
|
|
}
|
|
|
|
void CollisionPolygon::updateCollision( int x, int y, int w, int h ) {
|
|
position_x = original_x * w + x;
|
|
position_y = original_y * h + y;
|
|
}
|
|
|
|
int CollisionPolygon::getX() const {
|
|
return position_x;
|
|
}
|
|
int CollisionPolygon::getY() const {
|
|
return position_y;
|
|
}
|
|
|
|
void CollisionPolygon::setColor( const std::string &color ) {
|
|
sdl_color = getSDLColorHEX( color );
|
|
}
|
|
void CollisionPolygon::setOutlineColor( const std::string &color ) {
|
|
sdl_outline = getSDLColorHEX( color );
|
|
}
|
|
|
|
bool infinityIntersection( const SDLPP::CollisionPolygon &infinite,
|
|
const SDLPP::CollisionPolygon &other ) {
|
|
int ileft = infinite.leftmost();
|
|
int iright = infinite.rightmost();
|
|
int itop = infinite.topmost();
|
|
int ibottom = infinite.bottommost();
|
|
bool ret =
|
|
ileft != -1 && ileft <= other.rightmost() && ileft >= other.leftmost();
|
|
ret |= iright != -1 && iright >= other.leftmost() &&
|
|
iright <= other.rightmost();
|
|
ret |= itop != -1 && itop <= other.bottommost() && itop >= other.topmost();
|
|
ret |= ibottom != -1 && ibottom >= other.topmost() &&
|
|
ibottom <= other.bottommost();
|
|
ret |= ileft == -1 && iright == -1 && itop == -1 && ibottom == -1;
|
|
return ret;
|
|
}
|
|
|
|
bool intersects( const SDLPP::CollisionPolygon &p1,
|
|
const SDLPP::CollisionPolygon &p2 ) {
|
|
return !(
|
|
p1.rightmost() < p2.leftmost() || p2.rightmost() < p1.leftmost() ||
|
|
p1.topmost() > p2.bottommost() || p2.topmost() > p1.bottommost() );
|
|
}
|
|
} // namespace SDLPP
|