Rect.h

Go to the documentation of this file.

//**********************************************************************
//
//  REGCOM: Regimental Command
//  Copyright (C) 2008 Randi J. Relander
//    <rjrelander@users.sourceforge.net>
//
//  This program is free software; you can redistribute it and/or
//  modify it under the terms of the GNU General Public License
//  as published by the Free Software Foundation; either version 3
//  of the License, or (at your option) any later version.
//  
//  This program is distributed in the hope that it will be useful,
//  but WITHOUT ANY WARRANTY; without even the implied warranty of
//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//  GNU General Public License for more details.
//  
//  You should have received a copy of the GNU General Public
//  License along with this program.  If not, see 
//  <http://www.gnu.org/licenses/>.
//  
//**********************************************************************

#ifndef REGCOM_GUI_RECT_H
#define REGCOM_GUI_RECT_H

// PROJECT INCLUDES
#include "regcom/gui/Point.h"

// NAMESPACES
namespace regcom {
namespace gui {

//  CLASS: Rect
class Rect
{
public:

    // PUBLIC METHODS

    Rect() {}

    virtual ~Rect() {}

    Rect(int x, int y, int w, int h)
    {
        this->x = x;
        this->y = y;
        this->w = w;
        this->h = h;
    }

    Rect(const Point& a, const Point& b)
    {
        x = a.GetX();
        y = a.GetY();
        
        w = b.GetX() - a.GetX();
        h = b.GetY() - a.GetY();
    }

    Point UpperLeft() const { return Point(x,y); }

    Point LowerRight() const { return Point(x+w,y+h); }

    bool Contains(const Point& point) const
    {
        return (point.GetX() >= x) && (point.GetX() <= x + w) && 
            (point.GetY() >= y) && (point.GetY() <= y + h);
    }

    bool Contains(const Rect& rect) const
    {
        return Contains(rect.UpperLeft()) &&
            Contains(rect.LowerRight());
    }

    Rect Intersection(const Rect& rect) const
    {
        int x0 = x > rect.x ? x : rect.x;
        int y0 = y > rect.y ? y : rect.y;

        int x1 = x + w < rect.x + rect.w ? x + w : rect.x + rect.w;
        int y1 = y + h < rect.y + rect.h ? y + h : rect.y + rect.h;

        return Rect(Point(x0,y0),Point(x1,y1));
    }

    Rect Union(const Rect& rect) const
    {
        int x0 = x < rect.x ? x : rect.x;
        int y0 = y < rect.y ? y : rect.y;
        
        int x1 = x + w > rect.x + rect.w ? x + w : rect.x + rect.w;
        int y1 = y + h > rect.y + rect.h ? y + h : rect.y + rect.h;

        return Rect(Point(x0,y0),Point(x1,y1));
    }

    bool IsValid() const { return (w >= 0) && (h >= 0); }

public:

    // MEMBER VARIABLES

    int x;
    
    int y;
    
    int w;
    
    int h;
};

} // namespace gui
} // namespace regcom

#endif

Navigation

Home Page
Screen Shots
Developers
Documentation

Doxygen

Namespace List
Class List
Class Hierarchy
File List
Todo List

Links

SDL Library
License
SourceForge Project
Forums
Download

Regimental Command
Copyright © 2008
Randi J. Relander