laRect2.cpp

/*

Jump'n'Run Engine
http://www.atanaslaskov.com/jnr/

BSD LICENSE
Copyright (c) 2007-2013, Atanas Laskov
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL ATANAS LASKOV BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

*/

//
// FILE: laRect2.cpp
// Rectangle class
//
// Copyright (C) 2007-2013 Atanas Laskov, <latanas@gmail.com>
//
#include "stdafx.h"
#include "Core.h"
#include "Core.h"

//Bounding box
/*void laRect2::BoundingBox(laPoint2 a, laPoint2 b)
{
    point[0][0] = M_MIN(a.x(), b.x());
    point[0][1] = M_MIN(a.y(), b.y());
    point[1][0] = M_MAX(a.x(), b.x());
    point[1][1] = M_MAX(a.y(), b.y());
}*/

//Construct a standard M_UNIT rect, engulfing the point (x,y)
void laRect2::GridRect(laPoint2 &p)
{
    pt[0].x( floor(p.x()/M_UNIT)*M_UNIT );
    pt[0].y( floor(p.y()/M_UNIT)*M_UNIT );
    pt[1].x( pt[0].x() + M_UNIT );
    pt[1].y( pt[0].y() + M_UNIT );
}

//Check if the point (x,y) is outwith the rect
/*void laRect2::isSafelyOutside(laPoint2 &pt, double delta)
{
    if( (pt.x()<=pt[0].x()) && ((point[0].x()-pt.x())<delta) ) pt[0] = point[0].x() - delta;
    else if( (pt.y()<=pt[0].y()) && ((point[0].y()-pt.y())<delta) ) pt[1] = point[0].y() - delta;

    else if( (pt.x()>=point[1].x()) && ((pt.x()-point[1].x())<delta) ) pt[0] = point[1].x() + delta;
    else if( (pt.y()>=point[1].y()) && ((pt.y()-point[1].y())<delta) ) pt[1] = point[1].y() + delta;
}

//Check if the point (x,y) is within the rect
void laRect2::isSafelyInside(laPoint2 &pt, double delta)
{
    if( M_ABS(point[1].x()2-pt.x())<delta ) pt[0] = point[1].x()-delta;
    if( M_ABS(point[0].x()1-pt.x())<delta ) pt[0] = point[0].x()+delta;

    if( M_ABS(point[1].y()-pt.y())<delta ) pt[1] = point[1].y()-delta;
    if( M_ABS(point[0].y()-pt.y())<delta ) pt[1] = point[0].y()+delta;
}*/

//Check if two rects are interecting
/*M_BOOL laRect2::intersecting(laRect2 r)
{
    if(r.x()1 > point[1].x()) return M_FALSE;
    if(point[0].x() > r.x()2) return M_FALSE;

    if(r.y()1 > point[1].y()) return M_FALSE;
    if(point[0].y() > r.y()2) return M_FALSE;

    return M_TRUE;
}*/

//draw (for debug purpoces)
void laRect2::draw(laRenderer *r, laPoint2 &ptBase)
{
    r->transPush();
    r->transTranslate(ptBase);

    r->drawLine(laPoint2(pt[0].x(), pt[0].y()), laPoint2(pt[1].x(), pt[0].y()));
    r->drawLine(laPoint2(pt[1].x(), pt[0].y()), laPoint2(pt[1].x(), pt[1].y()));
    r->drawLine(laPoint2(pt[1].x(), pt[1].y()), laPoint2(pt[0].x(), pt[1].y()));
    r->drawLine(laPoint2(pt[0].x(), pt[1].y()), laPoint2(pt[0].x(), pt[0].y()));

    r->transPop();
}