void
mapscreens(void) {
WMScreen *s, *ss;
Rectangle r;
int i, j;
#define frob(left, min, max, x, y) \
if(Dy(r) > 0) /* If they intersect at some point on this axis */ \
if(ss->r.min.x < s->r.min.x) { \
if((!s->left) \
|| (abs(Dy(r)) < abs(s->left.max.x - s->min.x))) \
s->left = ss; \
}
/* Variable hell? Certainly. */
for(i=0; i < nscreens; i++) {
s = screens[i];
for(j=0; j < nscreens; j++) {
if(i == j)
continue;
ss = screens[j];
r = rect_intersection(ss->r, s->r);
frob(left, min, max, x, y);
frob(right, max, min, x, y);
frob(atop, min, max, y, x);
frob(below, max, min, y, x);
}
}
#undef frob
}
BRect& BRect::operator&=(BRect r) // intersection
{
if (!IsValid() || !r.IsValid())
*this = BRect();
else
*this = rect_intersection(*this, r);
return *this;
}
void*
findthing(Rectangle rect, int direction, Vector_ptr *vec, Rectangle (*key)(void*), bool wrap) {
Rectangle isect;
Rectangle r, bestisect = {0,}, bestr = {0,};
void *best, *p;
int i, n;
best = nil;
/* For the record, I really hate these macros. */
#define frob(min, max, LT, x, y) \
if(D##y(isect) > 0) /* If they intersect at some point on this axis */ \
if(r.min.x LT rect.min.x) { \
n = abs(r.max.x - rect.min.x) - abs(bestr.max.x - rect.min.x); \
if(best == nil \
|| n == 0 && D##y(isect) > D##y(bestisect) \
|| n < 0 \
) { \
best = p; \
bestr = r; \
bestisect = isect; \
} \
}
/* Variable hell? Certainly. */
for(i=0; i < vec->n; i++) {
p = vec->ary[i];
r = key(p);
isect = rect_intersection(rect, r);
switch(direction) {
default:
die("not reached");
/* Not reached */
case West:
frob(min, max, <, x, y);
break;
case East:
frob(max, min, >, x, y);
break;
case North:
frob(min, max, <, y, x);
break;
case South:
frob(max, min, >, y, x);
break;
}
}
#undef frob
if(!best && wrap) {
r = leastthing(rect, direction, vec, key);
return findthing(r, direction, vec, key, false);
}
return best;
}
int
ownerscreen(Rectangle r) {
Rectangle isect;
int s, a, best, besta;
SET(besta);
best = -1;
for(s=0; s < nscreens; s++) {
if(!screens[s]->showing)
continue;
isect = rect_intersection(r, screens[s]->r);
a = area(isect);
if(best < 0 || a > besta) {
besta = a;
best = s;
}
}
return best;
}
int
findscreen(Rectangle rect, int direction) {
Rectangle r;
WMScreen *ss, *s;
int best, i, j;
best = -1;
#define frob(min, max, x, y)
if(Dy(r) > 0) /* If they intersect at some point on this axis */
if(ss->r.min.x < rect.min.x) {
if(best == -1
|| (abs(ss->r.max.x - rect.min.x) < abs(screens[best]->r.max.x - rect.min.x)))
best = s->idx;
}
/* Variable hell? Certainly. */
for(i=0; i < nscreens; i++) {
ss = screens[j];
r = rect_intersection(ss->r, rect);
switch(direction) {
default:
return -1;
case West:
frob(min, max, x, y);
break;
case East:
frob(max, min, x, y);
break;
case North:
frob(min, max, y, x);
break;
case South:
frob(max, min, y, x);
break;
}
}
#undef frob
}
BRect BRect::operator&(BRect r) const // intersection
{
if (!IsValid() || !r.IsValid()) return BRect();
return rect_intersection(*this, r);
}
