ref: 3f9e52dae2ec8638fc6e6c8d4a2da73fc9adca72
parent: 0579ca1005ba961cf0f1c38210d259edbb54a97b
author: Simon Tatham <anakin@pobox.com>
date: Wed May 12 14:28:11 EDT 2004
Remove vestigial code from the previous attempt at clever grid generation. Grid generation should now be orders of magnitude faster at large sizes. [originally from svn r4220]
--- a/rect.c
+++ b/rect.c
@@ -216,25 +216,6 @@
continue;
for (x = 0; x <= params->w - rw; x++)
for (y = 0; y <= params->h - rh; y++) {- /*
- * We have a candidate rectangle placement. See
- * if it's unobstructed.
- */
- int xx, yy;
- int ok;
-
- ok = TRUE;
- for (xx = x; xx < x+rw; xx++)
- for (yy = y; yy < y+rh; yy++)
- if (index(params, grid, xx, yy) >= 0) {- ok = FALSE;
- goto break1; /* break both loops at once */
- }
- break1:
-
- if (!ok)
- continue;
-
if (nrects >= rectsize) {rectsize = nrects + 256;
rects = sresize(rects, rectsize, struct rect);