Lines Matching refs:areas
56 list->areas = malloc(cap * sizeof(RArea));
57 if(list->areas == NULL) {
146 free(self->areas);
167 memcpy(&self->areas[index], &self->areas[index + 1],
179 RArea *new_list = realloc(self->areas, (self->cap + 1) * sizeof(RArea));
185 self->areas = new_list;
188 self->areas[self->len++] = *area;
199 RArea *new_list = realloc(self->areas,
206 self->areas = new_list;
209 memcpy(&self->areas[self->len], other->areas, other->len * sizeof(RArea));
245 qsort(self->areas, self->len, sizeof(RArea), _cmpX);
279 qsort(self->areas, self->len, sizeof(RArea), _cmpY);
293 // Two areas can't form a horizontal stripe if there's any space
303 RAreaList *repl = RAreaHorizontalUnion(©->areas[i], ©->areas[j]);
336 RAreaList *repl = RAreaVerticalUnion(©->areas[i], ©->areas[j]);
355 * Create an RAreaList of all the areas in an RAreaList that a given
364 if(RAreaIsIntersect(&self->areas[i], area)) {
365 RAreaListAdd(new, &self->areas[i]);
383 if(func(&(self->areas[i]), data) == true) {
401 RArea it = RAreaIntersect(&self->areas[i], area);
431 const RArea *area = &(self->areas[i]);
466 RArea it = RAreaIntersect(area, &self->areas[i]);
469 full_area = self->areas[i];
483 RArea *cur_area = &self->areas[0], *area_end = &self->areas[self->len];
505 RArea *cur_area = &self->areas[0], *area_end = &self->areas[self->len];
525 RArea *cur_area = &self->areas[0], *area_end = &self->areas[self->len];
545 RArea *cur_area = &self->areas[0], *area_end = &self->areas[self->len];
569 RArea *area = &self->areas[i];