Lines Matching refs:RArea
23 const RArea *area);
34 * Create an RAreaList from a set of RArea's.
35 * \param cap Hint as to the number of RArea's being passed
36 * \param ... Sequence of RArea * to put in it. Don't forget a trailing
44 RArea *area;
56 list->areas = malloc(cap * sizeof(RArea));
63 while((area = va_arg(ap, RArea *)) != NULL) {
100 RArea big_area = RAreaListBigArea(self);
152 * Delete an RArea from inside an RAreaList.
168 (self->len - index) * sizeof(RArea));
173 * Add an RArea onto an RAreaList.
176 RAreaListAdd(RAreaList *self, const RArea *area)
179 RArea *new_list = realloc(self->areas, (self->cap + 1) * sizeof(RArea));
193 * Add the RArea's from one RAreaList onto another.
199 RArea *new_list = realloc(self->areas,
200 (self->len + other->len) * sizeof(RArea));
209 memcpy(&self->areas[self->len], other->areas, other->len * sizeof(RArea));
216 * qsort comparison function to sort by RArea.x
221 const RArea *a = (const RArea *)av, *b = (const RArea *)bv;
236 * Sort the RArea's in an RAreaList by their x coordinate.
245 qsort(self->areas, self->len, sizeof(RArea), _cmpX);
250 * qsort comparison function to sort by RArea.t
255 const RArea *a = (const RArea *)av, *b = (const RArea *)bv;
270 * Sort the RArea's in an RAreaList by their y coordinate.
279 qsort(self->areas, self->len, sizeof(RArea), _cmpY);
284 * Create an RAreaList whose RArea's are the horizontal union of our
285 * RArea's.
322 * Create an RAreaList whose RArea's are the vertical union of our
323 * RArea's.
356 * RArea intersects with.
359 RAreaListIntersect(const RAreaList *self, const RArea *area)
374 * Run a function over each RArea in an RAreaList until one returns true,
379 bool (*func)(const RArea *cur_area, void *data),
393 * an RArea.
396 RAreaListIntersectCrop(const RAreaList *self, const RArea *area)
401 RArea it = RAreaIntersect(&self->areas[i], area);
412 * Create a maximal RArea describing the union of an RAreaList.
420 RArea
431 const RArea *area = &(self->areas[i]);
454 * Find the RArea in an RAreaList that has the largest intersection with
455 * a given RArea. Colloquially, which area in an RAreaList does our
456 * RArea mostly fit into? This is used to resize a window to fill one
459 RArea
460 RAreaListBestTarget(const RAreaList *self, const RArea *area)
462 RArea full_area = RAreaInvalid();
466 RArea it = RAreaIntersect(area, &self->areas[i]);
478 * Find the x coordinate of the right-most RArea in an RAreaList.
483 RArea *cur_area = &self->areas[0], *area_end = &self->areas[self->len];
500 * Find the y coordinate of the bottom-most RArea in an RAreaList.
505 RArea *cur_area = &self->areas[0], *area_end = &self->areas[self->len];
519 * Find the x coordinate of the right edge of the left-most RArea in an
525 RArea *cur_area = &self->areas[0], *area_end = &self->areas[self->len];
539 * Find the y coordinate of the bottom edge of the top-most RArea in an
545 RArea *cur_area = &self->areas[0], *area_end = &self->areas[self->len];
569 RArea *area = &self->areas[i];