1 /* Copyright (c) 2012, Bastien Dejean
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
7 * 1. Redistributions of source code must retain the above copyright notice, this
8 * list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright notice,
10 * this list of conditions and the following disclaimer in the documentation
11 * and/or other materials provided with the distribution.
13 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
14 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
15 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
16 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
17 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
18 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
19 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
20 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
21 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
22 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 double distance(xcb_point_t a, xcb_point_t b)
31 return hypot(a.x - b.x, a.y - b.y);
34 bool is_inside(xcb_point_t p, xcb_rectangle_t r)
36 return (p.x >= r.x && p.x < (r.x + r.width) &&
37 p.y >= r.y && p.y < (r.y + r.height));
40 unsigned int area(xcb_rectangle_t r)
42 return r.width * r.height;
46 xcb_point_t center(xcb_rectangle_t r)
48 return (xcb_point_t) {r.x + r.width/2, r.y + r.height/2};
51 uint32_t rect_dir_dist(xcb_rectangle_t r1, xcb_rectangle_t r2, direction_t dir)
55 return r1.y - (r2.y + r2.height);
58 return r1.x - (r2.x + r2.width);
61 return r2.y - (r1.y + r1.height);
64 return r2.x - (r1.x + r1.width);
71 bool on_dir_side(xcb_rectangle_t r1, xcb_rectangle_t r2, direction_t dir)
75 return (r2.y + r2.height) <= r1.y && r2.x < (r1.x + r1.width) && (r2.x + r2.width) >= r1.x;
78 return (r2.x + r2.width) <= r1.x && r2.y < (r1.y + r1.height) && (r2.y + r2.height) >= r1.y;
81 return r2.y >= (r1.y + r1.height) && r2.x < (r1.x + r1.width) && (r2.x + r2.width) >= r1.x;
84 return r2.x >= (r1.x + r1.width) && r2.y < (r1.y + r1.height) && (r2.y + r2.height) >= r1.y;
91 bool rect_eq(xcb_rectangle_t a, xcb_rectangle_t b)
93 return (a.x == b.x && a.y == b.y &&
94 a.width == b.width && a.height == b.height);
97 int rect_cmp(xcb_rectangle_t r1, xcb_rectangle_t r2)
99 if (r1.y >= (r2.y + r2.height)) {
101 } else if (r2.y >= (r1.y + r1.height)) {
104 if (r1.x >= (r2.x + r2.width)) {
106 } else if (r2.x >= (r1.x + r1.width)) {
109 return area(r1) - area(r2);