Lines Matching refs:area
23 const RArea *area);
44 RArea *area;
63 while((area = va_arg(ap, RArea *)) != NULL) {
64 RAreaListAdd(list, area);
176 RAreaListAdd(RAreaList *self, const RArea *area)
188 self->areas[self->len++] = *area;
298 // Try HorizontalUnion'ing each area with the next one. If we can
359 RAreaListIntersect(const RAreaList *self, const RArea *area)
364 if(RAreaIsIntersect(&self->areas[i], area)) {
392 * Create an RAreaList from another, cropped to a certain area defined by
396 RAreaListIntersectCrop(const RAreaList *self, const RArea *area)
401 RArea it = RAreaIntersect(&self->areas[i], area);
415 * monitors (and the dead area necessary to cover them). It winds up
431 const RArea *area = &(self->areas[i]);
432 if(i == 0 || area->x < x) {
433 x = area->x;
436 if(i == 0 || area->y < y) {
437 y = area->y;
440 if(i == 0 || RAreaX2(area) > x2) {
441 x2 = RAreaX2(area);
444 if(i == 0 || RAreaY2(area) > y2) {
445 y2 = RAreaY2(area);
455 * a given RArea. Colloquially, which area in an RAreaList does our
460 RAreaListBestTarget(const RAreaList *self, const RArea *area)
466 RArea it = RAreaIntersect(area, &self->areas[i]);
569 RArea *area = &self->areas[i];
571 RAreaPrint(area);