197 lines
6.2 KiB
C++
197 lines
6.2 KiB
C++
/*! \file pirect.h
|
|
* \ingroup Math
|
|
* \brief
|
|
* \~english Rect class
|
|
* \~russian Класс прямоугольника
|
|
* * \~\authors
|
|
* \~english
|
|
* Ivan Pelipenko peri4ko@yandex.ru;
|
|
* Andrey Bychkov work.a.b@yandex.ru;
|
|
* \~russian
|
|
* Иван Пелипенко peri4ko@yandex.ru;
|
|
* Андрей Бычков work.a.b@yandex.ru;
|
|
*/
|
|
/*
|
|
PIP - Platform Independent Primitives
|
|
Rect class
|
|
Ivan Pelipenko peri4ko@yandex.ru, Andrey Bychkov work.a.b@yandex.ru
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
#ifndef PIRECT_H
|
|
#define PIRECT_H
|
|
|
|
#include "pipoint.h"
|
|
|
|
/*! \brief
|
|
* \~english Rect class
|
|
* \~russian Класс прямоугольника
|
|
*/
|
|
template<typename Type>
|
|
class PIP_EXPORT PIRect {
|
|
static_assert(std::is_arithmetic<Type>::value, "Type must be arithmetic");
|
|
public:
|
|
PIRect() {}
|
|
PIRect(Type x, Type y, Type w, Type h) {
|
|
set(x, y, w, h);
|
|
normalize();
|
|
}
|
|
PIRect(const PIPoint<Type> & top_left, const PIPoint<Type> & bottom_right) {
|
|
tl = top_left;
|
|
br = bottom_right;
|
|
normalize();
|
|
}
|
|
// PIRect(const PIPoint<Type> & p0, const PIPoint<Type> & p1, const PIPoint<Type> & p2) {
|
|
// set(piMin<Type>(p0.x, p1.x, p2.x), piMin<Type>(p0.y, p1.y, p2.y),
|
|
// piMax<Type>(p0.x, p1.x, p2.x), piMax<Type>(p0.y, p1.y, p2.y));
|
|
// }
|
|
PIRect<Type> & set(Type x, Type y, Type w, Type h) {
|
|
tl = PIPoint<Type>(x, y);
|
|
br = PIPoint<Type>(x + w, y + h);
|
|
return normalize();
|
|
}
|
|
PIRect<Type> & set(const PIPoint<Type> & top_left, const PIPoint<Type> & bottom_right) {
|
|
tl = top_left;
|
|
br = bottom_right;
|
|
return normalize();
|
|
}
|
|
bool pointIn(Type x, Type y) const {
|
|
return (x <= br.x && x >= tl.x && y <= br.y && y >= tl.y);
|
|
}
|
|
bool pointIn(const PIPoint<Type> & p) const {
|
|
return pointIn(p.x, p.y);
|
|
}
|
|
bool isEmpty() const {
|
|
return (width() == 0 && height() == 0);
|
|
}
|
|
PIRect<Type> & translate(Type x, Type y) {
|
|
tl.translate(x, y);
|
|
br.translate(x, y);
|
|
return *this;
|
|
}
|
|
PIRect<Type> & translate(const PIPoint<Type> & p) {
|
|
tl.translate(p);
|
|
br.translate(p);
|
|
return *this;
|
|
}
|
|
PIRect<Type> translated(Type x, Type y) const {
|
|
PIRect<Type> r(*this);
|
|
r.translate(x, y);
|
|
return r;
|
|
}
|
|
PIRect<Type> translated(const PIPoint<Type> & p) const {
|
|
PIRect<Type> r(*this);
|
|
r.translate(p);
|
|
return r;
|
|
}
|
|
PIRect<Type> & scale(Type x, Type y) {
|
|
setWidth(width() * x);
|
|
setHeight(height() * y);
|
|
return *this;
|
|
}
|
|
PIRect<Type> & scale(Type s) {return scale(s, s);}
|
|
PIRect<Type> & scale(const PIPoint<Type> & p) {return scale(p.x, p.y);}
|
|
PIRect<Type> scaled(Type x, Type y) const {
|
|
PIRect<Type> r(*this);
|
|
r.scale(x, y);
|
|
return r;
|
|
}
|
|
PIRect<Type> scaled(Type s) const {
|
|
PIRect<Type> r(*this);
|
|
r.scale(s);
|
|
return r;
|
|
}
|
|
PIRect<Type> scaled(const PIPoint<Type> & p) const {
|
|
PIRect<Type> r(*this);
|
|
r.scale(p);
|
|
return r;
|
|
}
|
|
PIRect<Type> & normalize() {
|
|
if (tl.x > br.x) piSwap<Type>(tl.x, br.x);
|
|
if (tl.y > br.y) piSwap<Type>(tl.y, br.y);
|
|
return *this;
|
|
}
|
|
PIRect<Type> normalized() const {
|
|
PIRect<Type> r(*this);
|
|
r.normalize();
|
|
return r;
|
|
}
|
|
PIRect<Type> & unite(const PIRect<Type> & r) {
|
|
tl.x = piMax<Type>(tl.x, r.left());
|
|
tl.y = piMax<Type>(tl.y, r.top());
|
|
br.x = piMin<Type>(br.x, r.right());
|
|
br.y = piMin<Type>(br.y, r.bottom());
|
|
return normalize();
|
|
}
|
|
PIRect<Type> united(const PIRect<Type> & rect) const {
|
|
PIRect<Type> r(*this);
|
|
r.unite(rect);
|
|
return r;
|
|
}
|
|
PIRect<Type> & intersect(const PIRect<Type> & r) {x0 = piMax<Type>(x0, r.x0); y0 = piMax<Type>(y0, r.y0); x1 = piMin<Type>(x1, r.x1); y1 = piMin<Type>(y1, r.y1); if (x0 > x1 || y0 > y1) x0 = x1 = y0 = y1 = Type(0); return *this;}
|
|
PIRect<Type> intersected(const PIRect<Type> & rect) const {PIRect<Type> r(*this); r.intersect(rect); return r;}
|
|
Type top() const {return tl.y;}
|
|
Type left() const {return x0;}
|
|
Type right() const {return x1;}
|
|
Type bottom() const {return y1;}
|
|
Type width() const {return x1 - x0;}
|
|
Type height() const {return y1 - y0;}
|
|
PIPoint<Type> topLeft() const {return tl;}
|
|
PIPoint<Type> topRigth() const {return PIPoint<Type>(p1.x, p0.y);}
|
|
PIPoint<Type> bottomLeft() const {return PIPoint<Type>(x0, y1);}
|
|
PIPoint<Type> bottomRight() const {return br;}
|
|
void setTop(Type v) {y0 = v;}
|
|
void setLeft(Type v) {x0 = v;}
|
|
void setRigth(Type v) {x1 = v;}
|
|
void setBottom(Type v) {y1 = v;}
|
|
void setWidth(Type v) {x1 = x0 + v;}
|
|
void setHeight(Type v) {y1 = y0 + v;}
|
|
void setTopLeft(const PIPoint<Type> & p) {p0 = p;}
|
|
void bottomRight(const PIPoint<Type> & p) {p0 = p;}
|
|
|
|
PIRect<Type> operator -() {return PIRect<Type>(-x0, -y0, -width(), -height());}
|
|
void operator +=(Type x) {translate(x, x);}
|
|
void operator +=(const PIPoint<Type> & p) {translate(p);}
|
|
void operator -=(Type x) {translate(-x, -x);}
|
|
void operator -=(const PIPoint<Type> & p) {translate(-p);}
|
|
void operator |=(const PIRect<Type> & r) {unite(r);}
|
|
void operator &=(const PIRect<Type> & r) {intersect(r);}
|
|
PIRect<Type> operator +(const PIPoint<Type> & p) {return translated(p);}
|
|
PIRect<Type> operator -(const PIPoint<Type> & p) {return translated(-p);}
|
|
PIRect<Type> operator |(const PIRect<Type> & r) {return united(r);}
|
|
PIRect<Type> operator &(const PIRect<Type> & r) {return intersected(r);}
|
|
bool operator ==(const PIRect<Type> & r) const {return (x0 == r.x0 && y0 == r.y0 && x1 == r.x1 && y1 == r.y10);}
|
|
bool operator !=(const PIRect<Type> & r) const {return (x0 != r.x0 || y0 != r.y0 || x1 != r.x1 || y1 != r.y10);}
|
|
|
|
private:
|
|
PIPoint<Type> tl;
|
|
PIPoint<Type> br;
|
|
};
|
|
|
|
template<typename Type>
|
|
PICout operator <<(PICout & s, const PIRect<Type> & v) {
|
|
s.setControl(0, true);
|
|
s << "Rect{" << v.topLeft() << "," << v.width() << "x" << v.height() << "}";
|
|
s.restoreControl();
|
|
return s;
|
|
}
|
|
|
|
|
|
typedef PIRect<int> PIRecti;
|
|
typedef PIRect<uint> PIRectu;
|
|
typedef PIRect<float> PIRectf;
|
|
typedef PIRect<double> PIRectd;
|
|
|
|
#endif // PIRECT_H
|