forked from baskerville/bspwm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgeometry.c
112 lines (102 loc) · 3.24 KB
/
geometry.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
/* Copyright (c) 2012, Bastien Dejean
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <math.h>
#include "types.h"
#include "geometry.h"
double distance(xcb_point_t a, xcb_point_t b)
{
return hypot(a.x - b.x, a.y - b.y);
}
bool is_inside(xcb_point_t p, xcb_rectangle_t r)
{
return (p.x >= r.x && p.x < (r.x + r.width) &&
p.y >= r.y && p.y < (r.y + r.height));
}
unsigned int area(xcb_rectangle_t r)
{
return r.width * r.height;
}
xcb_point_t center(xcb_rectangle_t r)
{
return (xcb_point_t) {r.x + r.width/2, r.y + r.height/2};
}
uint32_t rect_dir_dist(xcb_rectangle_t r1, xcb_rectangle_t r2, direction_t dir)
{
switch (dir) {
case DIR_NORTH:
return r1.y - (r2.y + r2.height);
break;
case DIR_WEST:
return r1.x - (r2.x + r2.width);
break;
case DIR_SOUTH:
return r2.y - (r1.y + r1.height);
break;
case DIR_EAST:
return r2.x - (r1.x + r1.width);
break;
default:
return UINT32_MAX;
}
}
bool on_dir_side(xcb_rectangle_t r1, xcb_rectangle_t r2, direction_t dir)
{
switch (dir) {
case DIR_NORTH:
return (r2.y + r2.height) <= r1.y && r2.x < (r1.x + r1.width) && (r2.x + r2.width) >= r1.x;
break;
case DIR_WEST:
return (r2.x + r2.width) <= r1.x && r2.y < (r1.y + r1.height) && (r2.y + r2.height) >= r1.y;
break;
case DIR_SOUTH:
return r2.y >= (r1.y + r1.height) && r2.x < (r1.x + r1.width) && (r2.x + r2.width) >= r1.x;
break;
case DIR_EAST:
return r2.x >= (r1.x + r1.width) && r2.y < (r1.y + r1.height) && (r2.y + r2.height) >= r1.y;
break;
default:
return false;
}
}
bool rect_eq(xcb_rectangle_t a, xcb_rectangle_t b)
{
return (a.x == b.x && a.y == b.y &&
a.width == b.width && a.height == b.height);
}
int rect_cmp(xcb_rectangle_t r1, xcb_rectangle_t r2)
{
if (r1.y >= (r2.y + r2.height)) {
return 1;
} else if (r2.y >= (r1.y + r1.height)) {
return -1;
} else {
if (r1.x >= (r2.x + r2.width)) {
return 1;
} else if (r2.x >= (r1.x + r1.width)) {
return -1;
} else {
return area(r1) - area(r2);
}
}
}