1 /* NetHack 3.6 rect.c $NHDT-Date: 1432512774 2015/05/25 00:12:54 $ $NHDT-Branch: master $:$NHDT-Revision: 1.11 $ */
2 /* Copyright (c) 1990 by Jean-Christophe Collet */
3 /* NetHack may be freely redistributed. See license for details. */
7 int FDECL(get_rect_ind, (NhRect *));
9 STATIC_DCL boolean FDECL(intersect, (NhRect *, NhRect *, NhRect *));
12 * In this file, we will handle the various rectangle functions we
13 * need for room generation.
20 static NhRect rect[MAXRECT + 1];
24 * Initialisation of internal structures. Should be called for every
25 * new level to be build...
32 rect[0].lx = rect[0].ly = 0;
33 rect[0].hx = COLNO - 1;
34 rect[0].hy = ROWNO - 1;
38 * Search Index of one precise NhRect.
46 register NhRect *rectp;
47 register int lx, ly, hx, hy;
54 for (i = 0, rectp = &rect[0]; i < rect_cnt; i++, rectp++)
55 if (lx == rectp->lx && ly == rectp->ly && hx == rectp->hx
62 * Search a free rectangle that include the one given in arg
69 register NhRect *rectp;
70 register int lx, ly, hx, hy;
77 for (i = 0, rectp = &rect[0]; i < rect_cnt; i++, rectp++)
78 if (lx >= rectp->lx && ly >= rectp->ly && hx <= rectp->hx
85 * Get some random NhRect from the list.
91 return rect_cnt > 0 ? &rect[rn2(rect_cnt)] : 0;
95 * Search intersection between two rectangles (r1 & r2).
96 * return TRUE if intersection exist and put it in r3.
97 * otherwise returns FALSE
101 intersect(r1, r2, r3)
102 NhRect *r1, *r2, *r3;
104 if (r2->lx > r1->hx || r2->ly > r1->hy || r2->hx < r1->lx
108 r3->lx = (r2->lx > r1->lx ? r2->lx : r1->lx);
109 r3->ly = (r2->ly > r1->ly ? r2->ly : r1->ly);
110 r3->hx = (r2->hx > r1->hx ? r1->hx : r2->hx);
111 r3->hy = (r2->hy > r1->hy ? r1->hy : r2->hy);
113 if (r3->lx > r3->hx || r3->ly > r3->hy)
119 * Remove a rectangle from the list of free NhRect.
128 ind = get_rect_ind(r);
130 rect[ind] = rect[--rect_cnt];
134 * Add a NhRect to the list.
141 if (rect_cnt >= MAXRECT) {
143 pline("MAXRECT may be too small.");
146 /* Check that this NhRect is not included in another one */
154 * Okay, here we have two rectangles (r1 & r2).
155 * r1 was already in the list and r2 is included in r1.
156 * What we want is to allocate r2, that is split r1 into smaller rectangles
170 /* Walk down since rect_cnt & rect[] will change... */
171 for (i = rect_cnt - 1; i >= 0; i--)
172 if (intersect(&rect[i], r2, &r))
173 split_rects(&rect[i], &r);
175 if (r2->ly - old_r.ly - 1
176 > (old_r.hy < ROWNO - 1 ? 2 * YLIM : YLIM + 1) + 4) {
181 if (r2->lx - old_r.lx - 1
182 > (old_r.hx < COLNO - 1 ? 2 * XLIM : XLIM + 1) + 4) {
187 if (old_r.hy - r2->hy - 1 > (old_r.ly > 0 ? 2 * YLIM : YLIM + 1) + 4) {
192 if (old_r.hx - r2->hx - 1 > (old_r.lx > 0 ? 2 * XLIM : XLIM + 1) + 4) {