X-Git-Url: https://git.dogcows.com/gitweb?a=blobdiff_plain;f=openbox%2Fgeom.h;h=e9ecf9d266a515c72bd2b9acbe87a3cfeeb54942;hb=d0013c0861e29433de10a849032382534c8e1659;hp=e20c660a70cc494ddb873abdbcc1d1bd4016fc9d;hpb=cadab91e522c6426cc79df4f06e7c05232cb0a64;p=chaz%2Fopenbox diff --git a/openbox/geom.h b/openbox/geom.h index e20c660a..e9ecf9d2 100644 --- a/openbox/geom.h +++ b/openbox/geom.h @@ -1,3 +1,22 @@ +/* -*- indent-tabs-mode: nil; tab-width: 4; c-basic-offset: 4; -*- + + geom.h for the Openbox window manager + Copyright (c) 2006 Mikael Magnusson + Copyright (c) 2003-2007 Dana Jansens + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + See the COPYING file for a copy of the GNU General Public License. +*/ + #ifndef __geom_h #define __geom_h @@ -22,6 +41,11 @@ typedef struct _Rect { int height; } Rect; +#define RECT_LEFT(r) ((r).x) +#define RECT_TOP(r) ((r).y) +#define RECT_RIGHT(r) ((r).x + (r).width - 1) +#define RECT_BOTTOM(r) ((r).y + (r).height - 1) + #define RECT_SET_POINT(r, nx, ny) \ (r).x = (nx), (r).y = (ny) #define RECT_SET_SIZE(r, w, h) \ @@ -30,19 +54,30 @@ typedef struct _Rect { (r).x = (nx), (r).y = (ny), (r).width = (w), (r).height = (h) #define RECT_EQUAL(r1, r2) ((r1).x == (r2).x && (r1).y == (r2).y && \ - (r1).width == (r2).width && \ + (r1).width == (r2).width && \ (r1).height == (r2).height) -#define RECT_CONTAINS(r, x, y) \ - ((x) >= (r).x && (x) < (r).x + (r).width && \ - (y) >= (r).y && (y) < (r).y + (r).height) +#define RECT_CONTAINS(r, px, py) \ + ((px) >= (r).x && (px) < (r).x + (r).width && \ + (py) >= (r).y && (py) < (r).y + (r).height) #define RECT_CONTAINS_RECT(r, o) \ ((o).x >= (r).x && (o).x + (o).width <= (r).x + (r).width && \ (o).y >= (r).y && (o).y + (o).height <= (r).y + (r).height) + +/* Returns true if Rect r and o intersect */ #define RECT_INTERSECTS_RECT(r, o) \ ((o).x < (r).x + (r).width && (o).x + (o).width > (r).x && \ (o).y < (r).y + (r).height && (o).y + (o).height > (r).y) +/* Sets Rect r to be the intersection of Rect a and b. */ +#define RECT_SET_INTERSECTION(r, a, b) \ + ((r).x = MAX((a).x, (b).x), \ + (r).y = MAX((a).y, (b).y), \ + (r).width = MIN((a).x + (a).width - 1, \ + (b).x + (b).width - 1) - (r).x + 1, \ + (r).height = MIN((a).y + (a).height - 1, \ + (b).y + (b).height - 1) - (r).y + 1) + typedef struct _Strut { int left; int top; @@ -78,7 +113,16 @@ typedef struct _StrutPartial { (s1).top = MAX((s1).top, (s2).top), \ (s1).bottom = MAX((s1).bottom, (s2).bottom) +#define STRUT_EXISTS(s1) \ + ((s1).left || (s1).top || (s1).right || (s1).bottom) + #define STRUT_EQUAL(s1, s2) \ + ((s1).left == (s2).left && \ + (s1).top == (s2).top && \ + (s1).right == (s2).right && \ + (s1).bottom == (s2).bottom) + +#define PARTIAL_STRUT_EQUAL(s1, s2) \ ((s1).left == (s2).left && \ (s1).top == (s2).top && \ (s1).right == (s2).right && \