forked from baskerville/bspwm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
geometry.c
177 lines (167 loc) · 4.68 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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
/* 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 "settings.h"
#include "geometry.h"
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));
}
/* Returns true if a contains b */
bool contains(xcb_rectangle_t a, xcb_rectangle_t b)
{
return (a.x <= b.x && (a.x + a.width) >= (b.x + b.width) &&
a.y <= b.y && (a.y + a.height) >= (b.y + b.height));
}
unsigned int area(xcb_rectangle_t r)
{
return r.width * r.height;
}
/* Distance between the `dir` edge of `r1` and the `opposite(dir)` edge of `r2`. */
uint32_t boundary_distance(xcb_rectangle_t r1, xcb_rectangle_t r2, direction_t dir)
{
xcb_point_t r1_max = {r1.x + r1.width - 1, r1.y + r1.height - 1};
xcb_point_t r2_max = {r2.x + r2.width - 1, r2.y + r2.height - 1};
switch (dir) {
case DIR_NORTH:
return r2_max.y > r1.y ? r2_max.y - r1.y : r1.y - r2_max.y;
break;
case DIR_WEST:
return r2_max.x > r1.x ? r2_max.x - r1.x : r1.x - r2_max.x;
break;
case DIR_SOUTH:
return r2.y < r1_max.y ? r1_max.y - r2.y : r2.y - r1_max.y;
break;
case DIR_EAST:
return r2.x < r1_max.x ? r1_max.x - r2.x : r2.x - r1_max.x;
break;
default:
return UINT32_MAX;
}
}
/* Is `r2` on the `dir` side of `r1`? */
bool on_dir_side(xcb_rectangle_t r1, xcb_rectangle_t r2, direction_t dir)
{
xcb_point_t r1_max = {r1.x + r1.width - 1, r1.y + r1.height - 1};
xcb_point_t r2_max = {r2.x + r2.width - 1, r2.y + r2.height - 1};
/* Eliminate rectangles on the opposite side */
switch (directional_focus_tightness) {
case TIGHTNESS_LOW:
switch (dir) {
case DIR_NORTH:
if (r2.y > r1_max.y) {
return false;
}
break;
case DIR_WEST:
if (r2.x > r1_max.x) {
return false;
}
break;
case DIR_SOUTH:
if (r2_max.y < r1.y) {
return false;
}
break;
case DIR_EAST:
if (r2_max.x < r1.x) {
return false;
}
break;
default:
return false;
}
break;
case TIGHTNESS_HIGH:
switch (dir) {
case DIR_NORTH:
if (r2.y >= r1.y) {
return false;
}
break;
case DIR_WEST:
if (r2.x >= r1.x) {
return false;
}
break;
case DIR_SOUTH:
if (r2_max.y <= r1_max.y) {
return false;
}
break;
case DIR_EAST:
if (r2_max.x <= r1_max.x) {
return false;
}
break;
default:
return false;
}
break;
default:
return false;
}
/* Is there a shared vertical/horizontal range? */
switch (dir) {
case DIR_NORTH:
case DIR_SOUTH:
return
(r2.x >= r1.x && r2.x <= r1_max.x) ||
(r2_max.x >= r1.x && r2_max.x <= r1_max.x) ||
(r1.x > r2.x && r1.x < r2_max.x);
break;
case DIR_WEST:
case DIR_EAST:
return
(r2.y >= r1.y && r2.y <= r1_max.y) ||
(r2_max.y >= r1.y && r2_max.y <= r1_max.y) ||
(r1.y > r2.y && r1_max.y < r2_max.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(r2) - area(r1);
}
}
}