blob: 0ddf36cbe40e8f84d6a0f5f357071e965bbca2bf [file] [log] [blame]
Constantin Kaplinsky47ed8d32004-10-08 09:43:57 +00001/* Copyright (C) 2002-2003 RealVNC Ltd. All Rights Reserved.
2 *
3 * This is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2 of the License, or
6 * (at your option) any later version.
7 *
8 * This software is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public License
14 * along with this software; if not, write to the Free Software
15 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
16 * USA.
17 */
18
19// rfb::Rect and rfb::Point structures
20
21#ifndef __RFB_RECT_INCLUDED__
22#define __RFB_RECT_INCLUDED__
23
Peter Åstrand0f49e222005-01-13 22:11:30 +000024#include <rfb/util.h>
Constantin Kaplinsky47ed8d32004-10-08 09:43:57 +000025
26namespace rfb {
27
28 // rfb::Point
29 //
30 // Represents a point in 2D space, by X and Y coordinates.
31 // Can also be used to represent a delta, or offset, between
32 // two Points.
33 // Functions are provided to allow Points to be compared for
34 // equality and translated by a supplied offset.
35 // Functions are also provided to negate offset Points.
36
37 struct Point {
38 Point() : x(0), y(0) {}
39 Point(int x_, int y_) : x(x_), y(y_) {}
40 inline Point negate() const {return Point(-x, -y);}
41 inline bool equals(const Point &p) const {return x==p.x && y==p.y;}
42 inline Point translate(const Point &p) const {return Point(x+p.x, y+p.y);}
43 inline Point subtract(const Point &p) const {return Point(x-p.x, y-p.y);}
44 int x, y;
45 };
46
47 // rfb::Rect
48 //
49 // Represents a rectangular region defined by its top-left (tl)
50 // and bottom-right (br) Points.
51 // Rects may be compared for equality, checked to determine whether
52 // or not they are empty, cleared (made empty), or intersected with
53 // one another. The bounding rectangle of two existing Rects
54 // may be calculated, as may the area of a Rect.
55 // Rects may also be translated, in the same way as Points, by
56 // an offset specified in a Point structure.
57
58 struct Rect {
59 Rect() {}
60 Rect(Point tl_, Point br_) : tl(tl_), br(br_) {}
61 Rect(int x1, int y1, int x2, int y2) : tl(x1, y1), br(x2, y2) {}
62 inline void setXYWH(int x, int y, int w, int h) {
63 tl.x = x; tl.y = y; br.x = x+w; br.y = y+h;
64 }
65 inline Rect intersect(const Rect &r) const {
66 Rect result;
Peter Åstrand0f49e222005-01-13 22:11:30 +000067 result.tl.x = vncmax(tl.x, r.tl.x);
68 result.tl.y = vncmax(tl.y, r.tl.y);
69 result.br.x = vncmax(vncmin(br.x, r.br.x), result.tl.x);
70 result.br.y = vncmax(vncmin(br.y, r.br.y), result.tl.y);
Constantin Kaplinsky47ed8d32004-10-08 09:43:57 +000071 return result;
72 }
73 inline Rect union_boundary(const Rect &r) const {
74 if (r.is_empty()) return *this;
75 if (is_empty()) return r;
76 Rect result;
Peter Åstrand0f49e222005-01-13 22:11:30 +000077 result.tl.x = vncmin(tl.x, r.tl.x);
78 result.tl.y = vncmin(tl.y, r.tl.y);
79 result.br.x = vncmax(br.x, r.br.x);
80 result.br.y = vncmax(br.y, r.br.y);
Constantin Kaplinsky47ed8d32004-10-08 09:43:57 +000081 return result;
82 }
83 inline Rect translate(const Point &p) const {
84 return Rect(tl.translate(p), br.translate(p));
85 }
86 inline bool equals(const Rect &r) const {return r.tl.equals(tl) && r.br.equals(br);}
87 inline bool is_empty() const {return (tl.x >= br.x) || (tl.y >= br.y);}
88 inline void clear() {tl = Point(); br = Point();}
89 inline bool enclosed_by(const Rect &r) const {
90 return (tl.x>=r.tl.x) && (tl.y>=r.tl.y) && (br.x<=r.br.x) && (br.y<=r.br.y);
91 }
92 inline bool overlaps(const Rect &r) const {
93 return tl.x < r.br.x && tl.y < r.br.y && br.x > r.tl.x && br.y > r.tl.y;
94 }
95 inline unsigned int area() const {return is_empty() ? 0 : (br.x-tl.x)*(br.y-tl.y);}
96 inline Point dimensions() const {return Point(width(), height());}
97 inline int width() const {return br.x-tl.x;}
98 inline int height() const {return br.y-tl.y;}
99 inline bool contains(const Point &p) const {
100 return (tl.x<=p.x) && (tl.y<=p.y) && (br.x>p.x) && (br.y>p.y);
101 }
102 Point tl;
103 Point br;
104 };
105}
106#endif // __RFB_RECT_INCLUDED__