/* -*- indent-tabs-mode: nil; tab-width: 4; c-basic-offset: 4; -*-
geom.h for the Openbox window manager
- Copyright (c) 2003 Ben Jansens
+ 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
#ifndef __geom_h
#define __geom_h
+#include <glib.h>
+
+typedef struct _GravityCoord {
+ gint pos;
+ gboolean center;
+ gboolean opposite;
+} GravityCoord;
+
+typedef struct _GravityPoint {
+ GravityCoord x;
+ GravityCoord y;
+} GravityPoint;
+
+#define GRAVITY_COORD_SET(c, p, cen, opp) \
+ (c).pos = (p), (c).center = (cen), (c).opposite = (opp)
+
+
typedef struct _Point {
int x;
int y;
} Point;
#define POINT_SET(pt, nx, ny) (pt).x = (nx), (pt).y = (ny)
+#define POINT_EQUAL(p1, p2) ((p1).x == (p2).x && (p1).y == (p2).y)
typedef struct _Size {
int width;
(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_EQUAL_DIMS(r, x, y, w, h) \
+ ((r).x == (x) && (r).y == (y) && (r).width == (w) && (r).height == (h))
+
+#define RECT_TO_DIMS(r, x, y, w, h) \
+ (x) = (r).x, (y) = (r).y, (w) = (r).width, (h) = (r).height
#define RECT_CONTAINS(r, px, py) \
((px) >= (r).x && (px) < (r).x + (r).width && \
#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), \
(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 && \
(s1).bottom_start == (s2).bottom_start && \
(s1).bottom_end == (s2).bottom_end)
+#define RANGES_INTERSECT(r1x, r1w, r2x, r2w) \
+ (r1w && r2w && r1x < r2x + r2w && r1x + r1w > r2x)
+
#endif