]>
Dogcows Code - chaz/openbox/blob - openbox/geom.h
1 /* -*- indent-tabs-mode: nil; tab-width: 4; c-basic-offset: 4; -*-
3 geom.h for the Openbox window manager
4 Copyright (c) 2003 Ben Jansens
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 See the COPYING file for a copy of the GNU General Public License.
22 typedef struct _Point
{
27 #define POINT_SET(pt, nx, ny) (pt).x = (nx), (pt).y = (ny)
29 typedef struct _Size
{
34 #define SIZE_SET(sz, w, h) (sz).width = (w), (sz).height = (h)
36 typedef struct _Rect
{
43 #define RECT_LEFT(r) ((r).x)
44 #define RECT_TOP(r) ((r).y)
45 #define RECT_RIGHT(r) ((r).x + (r).width - 1)
46 #define RECT_BOTTOM(r) ((r).y + (r).height - 1)
48 #define RECT_SET_POINT(r, nx, ny) \
49 (r).x = (nx), (r).y = (ny)
50 #define RECT_SET_SIZE(r, w, h) \
51 (r).width = (w), (r).height = (h)
52 #define RECT_SET(r, nx, ny, w, h) \
53 (r).x = (nx), (r).y = (ny), (r).width = (w), (r).height = (h)
55 #define RECT_EQUAL(r1, r2) ((r1).x == (r2).x && (r1).y == (r2).y && \
56 (r1).width == (r2).width && \
57 (r1).height == (r2).height)
59 #define RECT_CONTAINS(r, px, py) \
60 ((px) >= (r).x && (px) < (r).x + (r).width && \
61 (py) >= (r).y && (py) < (r).y + (r).height)
62 #define RECT_CONTAINS_RECT(r, o) \
63 ((o).x >= (r).x && (o).x + (o).width <= (r).x + (r).width && \
64 (o).y >= (r).y && (o).y + (o).height <= (r).y + (r).height)
65 #define RECT_INTERSECTS_RECT(r, o) \
66 ((o).x < (r).x + (r).width && (o).x + (o).width > (r).x && \
67 (o).y < (r).y + (r).height && (o).y + (o).height > (r).y)
69 #define RECT_SET_INTERSECTION(r, a, b) \
70 ((r).x = MAX((a).x, (b).x), \
71 (r).y = MAX((a).y, (b).y), \
72 (r).width = MIN((a).x + (a).width - 1, \
73 (b).x + (b).width - 1) - (r).x + 1, \
74 (r).height = MIN((a).y + (a).height - 1, \
75 (b).y + (b).height - 1) - (r).y + 1)
77 typedef struct _Strut
{
84 typedef struct _StrutPartial
{
90 int left_start
, left_end
;
91 int top_start
, top_end
;
92 int right_start
, right_end
;
93 int bottom_start
, bottom_end
;
96 #define STRUT_SET(s, l, t, r, b) \
97 (s).left = (l), (s).top = (t), (s).right = (r), (s).bottom = (b)
99 #define STRUT_PARTIAL_SET(s, l, t, r, b, ls, le, ts, te, rs, re, bs, be) \
100 (s).left = (l), (s).top = (t), (s).right = (r), (s).bottom = (b), \
101 (s).left_start = (ls), (s).left_end = (le), \
102 (s).top_start = (ts), (s).top_end = (te), \
103 (s).right_start = (rs), (s).right_end = (re), \
104 (s).bottom_start = (bs), (s).bottom_end = (be)
106 #define STRUT_ADD(s1, s2) \
107 (s1).left = MAX((s1).left, (s2).left), \
108 (s1).right = MAX((s1).right, (s2).right), \
109 (s1).top = MAX((s1).top, (s2).top), \
110 (s1).bottom = MAX((s1).bottom, (s2).bottom)
112 #define STRUT_EQUAL(s1, s2) \
113 ((s1).left == (s2).left && \
114 (s1).top == (s2).top && \
115 (s1).right == (s2).right && \
116 (s1).bottom == (s2).bottom)
118 #define PARTIAL_STRUT_EQUAL(s1, s2) \
119 ((s1).left == (s2).left && \
120 (s1).top == (s2).top && \
121 (s1).right == (s2).right && \
122 (s1).bottom == (s2).bottom && \
123 (s1).left_start == (s2).left_start && \
124 (s1).left_end == (s2).left_end && \
125 (s1).top_start == (s2).top_start && \
126 (s1).top_end == (s2).top_end && \
127 (s1).right_start == (s2).right_start && \
128 (s1).right_end == (s2).right_end && \
129 (s1).bottom_start == (s2).bottom_start && \
130 (s1).bottom_end == (s2).bottom_end)
This page took 0.039827 seconds and 4 git commands to generate.