|
0
|
1 /*
|
|
|
2 * Copyright (c) 2004-2006 Kazunori "jagarl" Ueno
|
|
|
3 * All rights reserved.
|
|
|
4 *
|
|
|
5 * Redistribution and use in source and binary forms, with or without
|
|
|
6 * modification, are permitted provided that the following conditions
|
|
|
7 * are met:
|
|
|
8 * 1. Redistributions of source code must retain the above copyright
|
|
|
9 * notice, this list of conditions and the following disclaimer.
|
|
|
10 * 2. Redistributions in binary form must reproduce the above copyright
|
|
|
11 * notice, this list of conditions and the following disclaimer in the
|
|
|
12 * documentation and/or other materials provided with the distribution.
|
|
|
13 * 3. The name of the author may not be used to endorse or promote products
|
|
|
14 * derived from this software without specific prior written permission.
|
|
|
15 *
|
|
|
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
|
17 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
|
18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
|
19 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
|
25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
26 */
|
|
|
27
|
|
|
28
|
|
|
29 #ifndef __RECT_H__
|
|
|
30 #define __RECT_H__
|
|
|
31
|
|
|
32 #include<vector>
|
|
|
33
|
|
|
34 struct Rect {
|
|
|
35 int lx, rx; // x = [lx,rx)
|
|
|
36 int ty, by; // y = [ty,by)
|
|
|
37
|
|
|
38 Rect(int x1, int y1);
|
|
|
39 Rect(int x1, int y1, int x2, int y2);
|
|
|
40 Rect(const Rect& rect);
|
|
|
41 Rect(const class Surface& rect);
|
|
|
42 Rect(const class TextGlyph& glyph);
|
|
|
43 void intersect(const Rect& rect);
|
|
|
44 bool is_crossed(const Rect& rect) const;
|
|
|
45 bool is_inner(const Rect& inner_rect) const;
|
|
|
46 bool is_nearly_inner(const Rect& inner_rect, int delta) const;
|
|
|
47 void join(const Rect& rect);
|
|
|
48 void rmove(int add_x, int add_y);
|
|
|
49 /** Subtracts rect from this. The resulting area is the set of pixels contained in this but not in the rect.
|
|
|
50 * result will be push_backed to ret_array.
|
|
|
51 */
|
|
|
52 void subtract(const Rect& rect, std::vector<Rect>& ret_array) const;
|
|
|
53 bool point_in(int x, int y) const;
|
|
|
54 bool empty(void) const {
|
|
|
55 return (lx == rx) || (ty == by);
|
|
|
56 }
|
|
|
57 int width(void) const {
|
|
|
58 return rx-lx;
|
|
|
59 }
|
|
|
60 int height(void) const {
|
|
|
61 return by-ty;
|
|
|
62 }
|
|
|
63 };
|
|
|
64
|
|
|
65 inline bool operator ==(const Rect& r1, const Rect& r2) {
|
|
|
66 return (r1.lx == r2.lx && r1.rx == r2.rx && r1.ty == r2.ty && r1.by == r2.by);
|
|
|
67 }
|
|
|
68 inline bool Rect::point_in(int x, int y) const {
|
|
|
69 return (lx <= x && x < rx && ty <= y && y < by);
|
|
|
70 }
|
|
|
71
|
|
|
72 struct Color {
|
|
|
73 int r,g,b,a;
|
|
|
74 Color(int _r, int _g, int _b) : r(_r),g(_g),b(_b),a(0xff) {}
|
|
|
75 Color(int _r, int _g, int _b, int _a) : r(_r),g(_g),b(_b),a(_a) {}
|
|
|
76 };
|
|
|
77 #endif
|
