author | unc0rr |
Sat, 03 Apr 2010 15:45:50 +0000 | |
changeset 3297 | 0c59b991007e |
parent 3287 | 4f7b57ed18b6 |
child 3365 | 37ac593e9027 |
permissions | -rw-r--r-- |
4 | 1 |
(* |
1066 | 2 |
* Hedgewars, a free turn based strategy game |
3236
4ab3917d7d44
Update (c) lines to 2010 as unc0rr requested - they all had varying values so I just took the first year mentioned, then tacked on -2010
nemo
parents:
3228
diff
changeset
|
3 |
* Copyright (c) 2005-2010 Andrey Korotaev <unC0Rr@gmail.com> |
4 | 4 |
* |
183 | 5 |
* This program is free software; you can redistribute it and/or modify |
6 |
* it under the terms of the GNU General Public License as published by |
|
7 |
* the Free Software Foundation; version 2 of the License |
|
4 | 8 |
* |
183 | 9 |
* This program is distributed in the hope that it will be useful, |
10 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
11 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
12 |
* GNU General Public License for more details. |
|
4 | 13 |
* |
183 | 14 |
* You should have received a copy of the GNU General Public License |
15 |
* along with this program; if not, write to the Free Software |
|
16 |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA |
|
4 | 17 |
*) |
18 |
||
2599 | 19 |
{$INCLUDE "options.inc"} |
2587
0dfa56a8513c
fix a segfault in the iphone simulator by moving options.inc at the beginning of the file
koda
parents:
2376
diff
changeset
|
20 |
|
4 | 21 |
unit uLand; |
22 |
interface |
|
3165
3ec07a7d8456
just some very sane stuff for the iphone port (plus some macro on pascal files)
koda
parents:
3141
diff
changeset
|
23 |
uses SDLh, uLandTemplates, uFloat, uConsts, GLunit; |
2699
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
24 |
|
1760 | 25 |
type TLandArray = packed array[0 .. LAND_HEIGHT - 1, 0 .. LAND_WIDTH - 1] of LongWord; |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
26 |
TCollisionArray = packed array[0 .. LAND_HEIGHT - 1, 0 .. LAND_WIDTH - 1] of Word; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
27 |
TPreview = packed array[0..127, 0..31] of byte; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
28 |
TDirtyTag = packed array[0 .. LAND_HEIGHT div 32 - 1, 0 .. LAND_WIDTH div 32 - 1] of byte; |
4 | 29 |
|
2699
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
30 |
var Land: TCollisionArray; |
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
31 |
LandPixels: TLandArray; |
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
32 |
LandDirty: TDirtyTag; |
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
33 |
hasBorder: boolean; |
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
34 |
hasGirders: boolean; |
2981 | 35 |
isMap: boolean; |
2699
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
36 |
playHeight, playWidth, leftX, rightX, topY, MaxHedgehogs: Longword; // idea is that a template can specify height/width. Or, a map, a height/width by the dimensions of the image. If the map has pixels near top of image, it triggers border. |
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
37 |
LandBackSurface: PSDL_Surface; |
4 | 38 |
|
3242 | 39 |
type direction = record x, y: LongInt; end; |
3181 | 40 |
const DIR_N: direction = (x: 0; y: -1); |
41 |
DIR_E: direction = (x: 1; y: 0); |
|
42 |
DIR_S: direction = (x: 0; y: 1); |
|
43 |
DIR_W: direction = (x: -1; y: 0); |
|
3133 | 44 |
|
3038 | 45 |
procedure initModule; |
46 |
procedure freeModule; |
|
37 | 47 |
procedure GenMap; |
766 | 48 |
function GenPreview: TPreview; |
367 | 49 |
procedure CheckLandDigest(s: shortstring); |
2692
ce9992075118
better network support + initial work for returning to frontend
koda
parents:
2665
diff
changeset
|
50 |
function LandBackPixel(x, y: LongInt): LongWord; |
4 | 51 |
|
52 |
implementation |
|
1806 | 53 |
uses uConsole, uStore, uMisc, uRandom, uTeams, uLandObjects, uSHA, uIO, uAmmos, uLandTexture; |
4 | 54 |
|
3133 | 55 |
operator=(const a, b: direction) c: Boolean; |
56 |
begin |
|
57 |
c := (a.x = b.x) and (a.y = b.y); |
|
58 |
end; |
|
59 |
||
4 | 60 |
type TPixAr = record |
61 |
Count: Longword; |
|
22 | 62 |
ar: array[0..Pred(cMaxEdgePoints)] of TPoint; |
4 | 63 |
end; |
64 |
||
37 | 65 |
procedure LogLandDigest; |
316 | 66 |
var ctx: TSHA1Context; |
67 |
dig: TSHA1Digest; |
|
68 |
s: shortstring; |
|
37 | 69 |
begin |
316 | 70 |
SHA1Init(ctx); |
3239 | 71 |
SHA1UpdateLongwords(ctx, @Land, sizeof(Land)); |
316 | 72 |
dig:= SHA1Final(ctx); |
367 | 73 |
s:='M{'+inttostr(dig[0])+':' |
316 | 74 |
+inttostr(dig[1])+':' |
75 |
+inttostr(dig[2])+':' |
|
76 |
+inttostr(dig[3])+':' |
|
77 |
+inttostr(dig[4])+'}'; |
|
699 | 78 |
CheckLandDigest(s); |
367 | 79 |
SendIPCRaw(@s[0], Length(s) + 1) |
80 |
end; |
|
81 |
||
82 |
procedure CheckLandDigest(s: shortstring); |
|
83 |
const digest: shortstring = ''; |
|
84 |
begin |
|
368 | 85 |
{$IFDEF DEBUGFILE} |
86 |
AddFileLog('CheckLandDigest: ' + s); |
|
87 |
{$ENDIF} |
|
367 | 88 |
if digest = '' then |
89 |
digest:= s |
|
90 |
else |
|
700 | 91 |
TryDo(s = digest, 'Different maps generated, sorry', true) |
37 | 92 |
end; |
93 |
||
371 | 94 |
procedure DrawLine(X1, Y1, X2, Y2: LongInt; Color: Longword); |
358 | 95 |
var |
371 | 96 |
eX, eY, dX, dY: LongInt; |
97 |
i, sX, sY, x, y, d: LongInt; |
|
358 | 98 |
begin |
99 |
eX:= 0; |
|
100 |
eY:= 0; |
|
101 |
dX:= X2 - X1; |
|
102 |
dY:= Y2 - Y1; |
|
103 |
||
104 |
if (dX > 0) then sX:= 1 |
|
105 |
else |
|
106 |
if (dX < 0) then |
|
107 |
begin |
|
108 |
sX:= -1; |
|
109 |
dX:= -dX |
|
110 |
end else sX:= dX; |
|
111 |
||
112 |
if (dY > 0) then sY:= 1 |
|
113 |
else |
|
114 |
if (dY < 0) then |
|
115 |
begin |
|
116 |
sY:= -1; |
|
117 |
dY:= -dY |
|
118 |
end else sY:= dY; |
|
119 |
||
120 |
if (dX > dY) then d:= dX |
|
121 |
else d:= dY; |
|
122 |
||
123 |
x:= X1; |
|
124 |
y:= Y1; |
|
2376 | 125 |
|
358 | 126 |
for i:= 0 to d do |
127 |
begin |
|
128 |
inc(eX, dX); |
|
129 |
inc(eY, dY); |
|
130 |
if (eX > d) then |
|
131 |
begin |
|
132 |
dec(eX, d); |
|
133 |
inc(x, sX); |
|
134 |
end; |
|
135 |
if (eY > d) then |
|
136 |
begin |
|
137 |
dec(eY, d); |
|
138 |
inc(y, sY); |
|
139 |
end; |
|
364 | 140 |
|
1753 | 141 |
if ((x and LAND_WIDTH_MASK) = 0) and ((y and LAND_HEIGHT_MASK) = 0) then |
358 | 142 |
Land[y, x]:= Color; |
143 |
end |
|
144 |
end; |
|
145 |
||
365 | 146 |
procedure DrawEdge(var pa: TPixAr; Color: Longword); |
371 | 147 |
var i: LongInt; |
4 | 148 |
begin |
365 | 149 |
i:= 0; |
4 | 150 |
with pa do |
371 | 151 |
while i < LongInt(Count) - 1 do |
365 | 152 |
if (ar[i + 1].X = NTPX) then inc(i, 2) |
153 |
else begin |
|
154 |
DrawLine(ar[i].x, ar[i].y, ar[i + 1].x, ar[i + 1].y, Color); |
|
155 |
inc(i) |
|
156 |
end |
|
22 | 157 |
end; |
158 |
||
365 | 159 |
procedure Vector(p1, p2, p3: TPoint; var Vx, Vy: hwFloat); |
160 |
var d1, d2, d: hwFloat; |
|
364 | 161 |
begin |
498 | 162 |
Vx:= int2hwFloat(p1.X - p3.X); |
163 |
Vy:= int2hwFloat(p1.Y - p3.Y); |
|
164 |
d:= DistanceI(p2.X - p1.X, p2.Y - p1.Y); |
|
165 |
d1:= DistanceI(p2.X - p3.X, p2.Y - p3.Y); |
|
365 | 166 |
d2:= Distance(Vx, Vy); |
167 |
if d1 < d then d:= d1; |
|
168 |
if d2 < d then d:= d2; |
|
169 |
d:= d * _1div3; |
|
170 |
if d2.QWordValue = 0 then |
|
171 |
begin |
|
498 | 172 |
Vx:= _0; |
173 |
Vy:= _0 |
|
365 | 174 |
end else |
175 |
begin |
|
498 | 176 |
d2:= _1 / d2; |
365 | 177 |
Vx:= Vx * d2; |
178 |
Vy:= Vy * d2; |
|
179 |
||
180 |
Vx:= Vx * d; |
|
181 |
Vy:= Vy * d |
|
182 |
end |
|
183 |
end; |
|
184 |
||
371 | 185 |
procedure AddLoopPoints(var pa, opa: TPixAr; StartI, EndI: LongInt; Delta: hwFloat); |
186 |
var i, pi, ni: LongInt; |
|
365 | 187 |
NVx, NVy, PVx, PVy: hwFloat; |
498 | 188 |
x1, x2, y1, y2: LongInt; |
189 |
tsq, tcb, t, r1, r2, r3, cx1, cx2, cy1, cy2: hwFloat; |
|
371 | 190 |
X, Y: LongInt; |
365 | 191 |
begin |
192 |
pi:= EndI; |
|
193 |
i:= StartI; |
|
194 |
ni:= Succ(StartI); |
|
195 |
Vector(opa.ar[pi], opa.ar[i], opa.ar[ni], NVx, NVy); |
|
196 |
repeat |
|
197 |
inc(pi); |
|
198 |
if pi > EndI then pi:= StartI; |
|
199 |
inc(i); |
|
200 |
if i > EndI then i:= StartI; |
|
201 |
inc(ni); |
|
202 |
if ni > EndI then ni:= StartI; |
|
203 |
PVx:= NVx; |
|
204 |
PVy:= NVy; |
|
205 |
Vector(opa.ar[pi], opa.ar[i], opa.ar[ni], NVx, NVy); |
|
206 |
||
207 |
x1:= opa.ar[pi].x; |
|
208 |
y1:= opa.ar[pi].y; |
|
209 |
x2:= opa.ar[i].x; |
|
210 |
y2:= opa.ar[i].y; |
|
498 | 211 |
cx1:= int2hwFloat(x1) - PVx; |
212 |
cy1:= int2hwFloat(y1) - PVy; |
|
213 |
cx2:= int2hwFloat(x2) + NVx; |
|
214 |
cy2:= int2hwFloat(y2) + NVy; |
|
215 |
t:= _0; |
|
364 | 216 |
while t.Round = 0 do |
217 |
begin |
|
218 |
tsq:= t * t; |
|
219 |
tcb:= tsq * t; |
|
498 | 220 |
r1:= (_1 - t*3 + tsq*3 - tcb); |
221 |
r2:= ( t*3 - tsq*6 + tcb*3); |
|
222 |
r3:= ( tsq*3 - tcb*3); |
|
430 | 223 |
X:= hwRound(r1 * x1 + r2 * cx1 + r3 * cx2 + tcb * x2); |
224 |
Y:= hwRound(r1 * y1 + r2 * cy1 + r3 * cy2 + tcb * y2); |
|
364 | 225 |
t:= t + Delta; |
226 |
pa.ar[pa.Count].x:= X; |
|
227 |
pa.ar[pa.Count].y:= Y; |
|
228 |
inc(pa.Count); |
|
229 |
TryDo(pa.Count <= cMaxEdgePoints, 'Edge points overflow', true) |
|
230 |
end; |
|
365 | 231 |
until i = StartI; |
232 |
pa.ar[pa.Count].x:= opa.ar[StartI].X; |
|
233 |
pa.ar[pa.Count].y:= opa.ar[StartI].Y; |
|
364 | 234 |
inc(pa.Count) |
235 |
end; |
|
236 |
||
365 | 237 |
procedure BezierizeEdge(var pa: TPixAr; Delta: hwFloat); |
495 | 238 |
var i, StartLoop: LongInt; |
365 | 239 |
opa: TPixAr; |
240 |
begin |
|
241 |
opa:= pa; |
|
242 |
pa.Count:= 0; |
|
243 |
i:= 0; |
|
244 |
StartLoop:= 0; |
|
371 | 245 |
while i < LongInt(opa.Count) do |
365 | 246 |
if (opa.ar[i + 1].X = NTPX) then |
247 |
begin |
|
248 |
AddLoopPoints(pa, opa, StartLoop, i, Delta); |
|
249 |
inc(i, 2); |
|
250 |
StartLoop:= i; |
|
251 |
pa.ar[pa.Count].X:= NTPX; |
|
3224 | 252 |
pa.ar[pa.Count].Y:= 0; |
365 | 253 |
inc(pa.Count); |
254 |
end else inc(i) |
|
255 |
end; |
|
256 |
||
371 | 257 |
procedure FillLand(x, y: LongInt); |
4 | 258 |
var Stack: record |
259 |
Count: Longword; |
|
260 |
points: array[0..8192] of record |
|
371 | 261 |
xl, xr, y, dir: LongInt; |
4 | 262 |
end |
263 |
end; |
|
264 |
||
371 | 265 |
procedure Push(_xl, _xr, _y, _dir: LongInt); |
4 | 266 |
begin |
75 | 267 |
TryDo(Stack.Count <= 8192, 'FillLand: stack overflow', true); |
4 | 268 |
_y:= _y + _dir; |
1760 | 269 |
if (_y < 0) or (_y >= LAND_HEIGHT) then exit; |
4 | 270 |
with Stack.points[Stack.Count] do |
271 |
begin |
|
272 |
xl:= _xl; |
|
273 |
xr:= _xr; |
|
274 |
y:= _y; |
|
275 |
dir:= _dir |
|
276 |
end; |
|
75 | 277 |
inc(Stack.Count) |
4 | 278 |
end; |
279 |
||
371 | 280 |
procedure Pop(var _xl, _xr, _y, _dir: LongInt); |
4 | 281 |
begin |
282 |
dec(Stack.Count); |
|
283 |
with Stack.points[Stack.Count] do |
|
284 |
begin |
|
285 |
_xl:= xl; |
|
286 |
_xr:= xr; |
|
287 |
_y:= y; |
|
288 |
_dir:= dir |
|
289 |
end |
|
290 |
end; |
|
291 |
||
371 | 292 |
var xl, xr, dir: LongInt; |
351 | 293 |
begin |
4 | 294 |
Stack.Count:= 0; |
295 |
xl:= x - 1; |
|
296 |
xr:= x; |
|
23 | 297 |
Push(xl, xr, y, -1); |
298 |
Push(xl, xr, y, 1); |
|
4 | 299 |
while Stack.Count > 0 do |
300 |
begin |
|
301 |
Pop(xl, xr, y, dir); |
|
51 | 302 |
while (xl > 0) and (Land[y, xl] <> 0) do dec(xl); |
1760 | 303 |
while (xr < LAND_WIDTH - 1) and (Land[y, xr] <> 0) do inc(xr); |
4 | 304 |
while (xl < xr) do |
305 |
begin |
|
51 | 306 |
while (xl <= xr) and (Land[y, xl] = 0) do inc(xl); |
4 | 307 |
x:= xl; |
51 | 308 |
while (xl <= xr) and (Land[y, xl] <> 0) do |
4 | 309 |
begin |
51 | 310 |
Land[y, xl]:= 0; |
4 | 311 |
inc(xl) |
312 |
end; |
|
22 | 313 |
if x < xl then |
314 |
begin |
|
315 |
Push(x, Pred(xl), y, dir); |
|
316 |
Push(x, Pred(xl), y,-dir); |
|
317 |
end; |
|
4 | 318 |
end; |
319 |
end; |
|
320 |
end; |
|
321 |
||
2647 | 322 |
function LandBackPixel(x, y: LongInt): LongWord; |
323 |
var p: PLongWordArray; |
|
324 |
begin |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
325 |
if LandBackSurface = nil then LandBackPixel:= 0 |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
326 |
else |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
327 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
328 |
p:= LandBackSurface^.pixels; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
329 |
LandBackPixel:= p^[LandBackSurface^.w * (y mod LandBackSurface^.h) + (x mod LandBackSurface^.w)];// or $FF000000; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
330 |
end |
2647 | 331 |
end; |
332 |
||
4 | 333 |
procedure ColorizeLand(Surface: PSDL_Surface); |
334 |
var tmpsurf: PSDL_Surface; |
|
1182
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
335 |
r, rr: TSDL_Rect; |
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
336 |
x, yd, yu: LongInt; |
4 | 337 |
begin |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
338 |
tmpsurf:= LoadImage(Pathz[ptCurrTheme] + '/LandTex', ifCritical or ifIgnoreCaps); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
339 |
r.y:= 0; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
340 |
while r.y < LAND_HEIGHT do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
341 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
342 |
r.x:= 0; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
343 |
while r.x < LAND_WIDTH do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
344 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
345 |
SDL_UpperBlit(tmpsurf, nil, Surface, @r); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
346 |
inc(r.x, tmpsurf^.w) |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
347 |
end; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
348 |
inc(r.y, tmpsurf^.h) |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
349 |
end; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
350 |
SDL_FreeSurface(tmpsurf); |
4 | 351 |
|
3038 | 352 |
// freed in freeModule() below |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
353 |
LandBackSurface:= LoadImage(Pathz[ptCurrTheme] + '/LandBackTex', ifIgnoreCaps or ifTransparent); |
2647 | 354 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
355 |
tmpsurf:= LoadImage(Pathz[ptCurrTheme] + '/Border', ifCritical or ifIgnoreCaps or ifTransparent); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
356 |
for x:= 0 to LAND_WIDTH - 1 do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
357 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
358 |
yd:= LAND_HEIGHT - 1; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
359 |
repeat |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
360 |
while (yd > 0) and (Land[yd, x] = 0) do dec(yd); |
2376 | 361 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
362 |
if (yd < 0) then yd:= 0; |
1182
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
363 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
364 |
while (yd < LAND_HEIGHT) and (Land[yd, x] <> 0) do inc(yd); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
365 |
dec(yd); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
366 |
yu:= yd; |
2376 | 367 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
368 |
while (yu > 0 ) and (Land[yu, x] <> 0) do dec(yu); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
369 |
while (yu < yd ) and (Land[yu, x] = 0) do inc(yu); |
2376 | 370 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
371 |
if (yd < LAND_HEIGHT - 1) and ((yd - yu) >= 16) then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
372 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
373 |
rr.x:= x; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
374 |
rr.y:= yd - 15; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
375 |
r.x:= x mod tmpsurf^.w; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
376 |
r.y:= 16; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
377 |
r.w:= 1; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
378 |
r.h:= 16; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
379 |
SDL_UpperBlit(tmpsurf, @r, Surface, @rr); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
380 |
end; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
381 |
if (yu > 0) then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
382 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
383 |
rr.x:= x; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
384 |
rr.y:= yu; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
385 |
r.x:= x mod tmpsurf^.w; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
386 |
r.y:= 0; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
387 |
r.w:= 1; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
388 |
r.h:= min(16, yd - yu + 1); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
389 |
SDL_UpperBlit(tmpsurf, @r, Surface, @rr); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
390 |
end; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
391 |
yd:= yu - 1; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
392 |
until yd < 0; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
393 |
end; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
394 |
SDL_FreeSurface(tmpsurf); |
4 | 395 |
end; |
396 |
||
358 | 397 |
procedure SetPoints(var Template: TEdgeTemplate; var pa: TPixAr); |
371 | 398 |
var i: LongInt; |
22 | 399 |
begin |
23 | 400 |
with Template do |
401 |
begin |
|
358 | 402 |
pa.Count:= BasePointsCount; |
403 |
for i:= 0 to pred(pa.Count) do |
|
23 | 404 |
begin |
371 | 405 |
pa.ar[i].x:= BasePoints^[i].x + LongInt(GetRandom(BasePoints^[i].w)); |
1792 | 406 |
if pa.ar[i].x <> NTPX then |
407 |
pa.ar[i].x:= pa.ar[i].x + ((LAND_WIDTH - Template.TemplateWidth) div 2); |
|
1776 | 408 |
pa.ar[i].y:= BasePoints^[i].y + LongInt(GetRandom(BasePoints^[i].h)) + LAND_HEIGHT - Template.TemplateHeight |
23 | 409 |
end; |
1183
540cea859395
Step 4: repair girder rendering (girder is 32bit now)
unc0rr
parents:
1182
diff
changeset
|
410 |
|
358 | 411 |
if canMirror then |
360 | 412 |
if getrandom(2) = 0 then |
358 | 413 |
begin |
414 |
for i:= 0 to pred(BasePointsCount) do |
|
365 | 415 |
if pa.ar[i].x <> NTPX then |
1760 | 416 |
pa.ar[i].x:= LAND_WIDTH - 1 - pa.ar[i].x; |
358 | 417 |
for i:= 0 to pred(FillPointsCount) do |
1760 | 418 |
FillPoints^[i].x:= LAND_WIDTH - 1 - FillPoints^[i].x; |
358 | 419 |
end; |
22 | 420 |
|
2338
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
421 |
(* Experiment in making this option more useful |
2376 | 422 |
if ((not isNegative) and (cTemplateFilter = 4)) or |
2338
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
423 |
(canFlip and (getrandom(2) = 0)) then |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
424 |
begin |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
425 |
for i:= 0 to pred(BasePointsCount) do |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
426 |
begin |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
427 |
pa.ar[i].y:= LAND_HEIGHT - 1 - pa.ar[i].y + (LAND_HEIGHT - TemplateHeight) * 2; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
428 |
if pa.ar[i].y > LAND_HEIGHT - 1 then |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
429 |
pa.ar[i].y:= LAND_HEIGHT - 1; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
430 |
end; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
431 |
for i:= 0 to pred(FillPointsCount) do |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
432 |
begin |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
433 |
FillPoints^[i].y:= LAND_HEIGHT - 1 - FillPoints^[i].y + (LAND_HEIGHT - TemplateHeight) * 2; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
434 |
if FillPoints^[i].y > LAND_HEIGHT - 1 then |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
435 |
FillPoints^[i].y:= LAND_HEIGHT - 1; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
436 |
end; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
437 |
end; |
2376 | 438 |
end |
2338
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
439 |
*) |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
440 |
// template recycling. Pull these off the floor a bit |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
441 |
if (not isNegative) and (cTemplateFilter = 4) then |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
442 |
begin |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
443 |
for i:= 0 to pred(BasePointsCount) do |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
444 |
begin |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
445 |
dec(pa.ar[i].y, 100); |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
446 |
if pa.ar[i].y < 0 then |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
447 |
pa.ar[i].y:= 0; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
448 |
end; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
449 |
for i:= 0 to pred(FillPointsCount) do |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
450 |
begin |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
451 |
dec(FillPoints^[i].y, 100); |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
452 |
if FillPoints^[i].y < 0 then |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
453 |
FillPoints^[i].y:= 0; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
454 |
end; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
455 |
end; |
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
456 |
|
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
457 |
if (canFlip and (getrandom(2) = 0)) then |
358 | 458 |
begin |
459 |
for i:= 0 to pred(BasePointsCount) do |
|
1760 | 460 |
pa.ar[i].y:= LAND_HEIGHT - 1 - pa.ar[i].y; |
358 | 461 |
for i:= 0 to pred(FillPointsCount) do |
1760 | 462 |
FillPoints^[i].y:= LAND_HEIGHT - 1 - FillPoints^[i].y; |
358 | 463 |
end; |
464 |
end |
|
4 | 465 |
end; |
67 | 466 |
|
561 | 467 |
function CheckIntersect(V1, V2, V3, V4: TPoint): boolean; |
468 |
var c1, c2, dm: LongInt; |
|
469 |
begin |
|
470 |
dm:= (V4.y - V3.y) * (V2.x - V1.x) - (V4.x - V3.x) * (V2.y - V1.y); |
|
471 |
c1:= (V4.x - V3.x) * (V1.y - V3.y) - (V4.y - V3.y) * (V1.x - V3.x); |
|
472 |
if dm = 0 then exit(false); |
|
473 |
||
474 |
c2:= (V2.x - V3.x) * (V1.y - V3.y) - (V2.y - V3.y) * (V1.x - V3.x); |
|
475 |
if dm > 0 then |
|
476 |
begin |
|
477 |
if (c1 < 0) or (c1 > dm) then exit(false); |
|
478 |
if (c2 < 0) or (c2 > dm) then exit(false) |
|
479 |
end else |
|
480 |
begin |
|
481 |
if (c1 > 0) or (c1 < dm) then exit(false); |
|
482 |
if (c2 > 0) or (c2 < dm) then exit(false) |
|
483 |
end; |
|
484 |
||
485 |
//AddFileLog('1 (' + inttostr(V1.x) + ',' + inttostr(V1.y) + ')x(' + inttostr(V2.x) + ',' + inttostr(V2.y) + ')'); |
|
486 |
//AddFileLog('2 (' + inttostr(V3.x) + ',' + inttostr(V3.y) + ')x(' + inttostr(V4.x) + ',' + inttostr(V4.y) + ')'); |
|
487 |
CheckIntersect:= true |
|
488 |
end; |
|
489 |
||
490 |
function CheckSelfIntersect(var pa: TPixAr; ind: Longword): boolean; |
|
491 |
var i: Longword; |
|
492 |
begin |
|
493 |
if (ind <= 0) or (ind >= Pred(pa.Count)) then exit(false); |
|
494 |
for i:= 1 to pa.Count - 3 do |
|
495 |
if (i <= ind - 1) or (i >= ind + 2) then |
|
496 |
begin |
|
497 |
if (i <> ind - 1) and |
|
498 |
CheckIntersect(pa.ar[ind], pa.ar[ind - 1], pa.ar[i], pa.ar[i - 1]) then exit(true); |
|
499 |
if (i <> ind + 2) and |
|
500 |
CheckIntersect(pa.ar[ind], pa.ar[ind + 1], pa.ar[i], pa.ar[i - 1]) then exit(true); |
|
501 |
end; |
|
502 |
CheckSelfIntersect:= false |
|
503 |
end; |
|
504 |
||
429 | 505 |
procedure RandomizePoints(var pa: TPixAr); |
364 | 506 |
const cEdge = 55; |
561 | 507 |
cMinDist = 8; |
371 | 508 |
var radz: array[0..Pred(cMaxEdgePoints)] of LongInt; |
561 | 509 |
i, k, dist, px, py: LongInt; |
364 | 510 |
begin |
511 |
for i:= 0 to Pred(pa.Count) do |
|
3225
5d8f4737b6cd
another uninitialised value radz[k] for corresponding pa.ar of NTPX
nemo
parents:
3224
diff
changeset
|
512 |
begin |
5d8f4737b6cd
another uninitialised value radz[k] for corresponding pa.ar of NTPX
nemo
parents:
3224
diff
changeset
|
513 |
radz[i]:= 0; |
364 | 514 |
with pa.ar[i] do |
365 | 515 |
if x <> NTPX then |
516 |
begin |
|
1760 | 517 |
radz[i]:= Min(Max(x - cEdge, 0), Max(LAND_WIDTH - cEdge - x, 0)); |
518 |
radz[i]:= Min(radz[i], Min(Max(y - cEdge, 0), Max(LAND_HEIGHT - cEdge - y, 0))); |
|
365 | 519 |
if radz[i] > 0 then |
520 |
for k:= 0 to Pred(i) do |
|
364 | 521 |
begin |
429 | 522 |
dist:= Max(abs(x - pa.ar[k].x), abs(y - pa.ar[k].y)); |
365 | 523 |
radz[k]:= Max(0, Min((dist - cMinDist) div 2, radz[k])); |
524 |
radz[i]:= Max(0, Min(dist - radz[k] - cMinDist, radz[i])) |
|
525 |
end |
|
526 |
end; |
|
3225
5d8f4737b6cd
another uninitialised value radz[k] for corresponding pa.ar of NTPX
nemo
parents:
3224
diff
changeset
|
527 |
end; |
364 | 528 |
|
529 |
for i:= 0 to Pred(pa.Count) do |
|
530 |
with pa.ar[i] do |
|
1753 | 531 |
if ((x and LAND_WIDTH_MASK) = 0) and ((y and LAND_HEIGHT_MASK) = 0) then |
364 | 532 |
begin |
561 | 533 |
px:= x; |
534 |
py:= y; |
|
371 | 535 |
x:= x + LongInt(GetRandom(7) - 3) * (radz[i] * 5 div 7) div 3; |
561 | 536 |
y:= y + LongInt(GetRandom(7) - 3) * (radz[i] * 5 div 7) div 3; |
537 |
if CheckSelfIntersect(pa, i) then |
|
538 |
begin |
|
539 |
x:= px; |
|
540 |
y:= py |
|
541 |
end; |
|
364 | 542 |
end |
67 | 543 |
end; |
544 |
||
364 | 545 |
|
23 | 546 |
procedure GenBlank(var Template: TEdgeTemplate); |
4 | 547 |
var pa: TPixAr; |
23 | 548 |
i: Longword; |
155
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
549 |
y, x: Longword; |
4 | 550 |
begin |
1760 | 551 |
for y:= 0 to LAND_HEIGHT - 1 do |
552 |
for x:= 0 to LAND_WIDTH - 1 do |
|
155
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
553 |
Land[y, x]:= COLOR_LAND; |
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
554 |
|
358 | 555 |
SetPoints(Template, pa); |
429 | 556 |
for i:= 1 to Template.BezierizeCount do |
557 |
begin |
|
431 | 558 |
BezierizeEdge(pa, _0_5); |
561 | 559 |
RandomizePoints(pa); |
429 | 560 |
RandomizePoints(pa) |
561 |
end; |
|
562 |
for i:= 1 to Template.RandPassesCount do RandomizePoints(pa); |
|
365 | 563 |
BezierizeEdge(pa, _0_1); |
27 | 564 |
|
365 | 565 |
DrawEdge(pa, 0); |
27 | 566 |
|
358 | 567 |
with Template do |
23 | 568 |
for i:= 0 to pred(FillPointsCount) do |
569 |
with FillPoints^[i] do |
|
89 | 570 |
FillLand(x, y); |
571 |
||
1773 | 572 |
DrawEdge(pa, COLOR_LAND); |
573 |
||
1792 | 574 |
MaxHedgehogs:= Template.MaxHedgehogs; |
1776 | 575 |
hasGirders:= Template.hasGirders; |
576 |
playHeight:= Template.TemplateHeight; |
|
577 |
playWidth:= Template.TemplateWidth; |
|
578 |
leftX:= ((LAND_WIDTH - playWidth) div 2); |
|
579 |
rightX:= (playWidth + ((LAND_WIDTH - playWidth) div 2)) - 1; |
|
580 |
topY:= LAND_HEIGHT - playHeight; |
|
581 |
||
1797 | 582 |
// force to only cavern even if a cavern map is invertable if cTemplateFilter = 4 ? |
2376 | 583 |
if (cTemplateFilter = 4) or |
2338
8f6508c97f3f
An experiment with increasing number of caves by selecting a few potential non-cave maps and adding to the cave map array. Ones selected here might not actually be that playable as caves.
nemo
parents:
2308
diff
changeset
|
584 |
(Template.canInvert and (getrandom(2) = 0)) or |
2376 | 585 |
(not Template.canInvert and Template.isNegative) then |
1776 | 586 |
begin |
587 |
hasBorder:= true; |
|
1773 | 588 |
for y:= 0 to LAND_HEIGHT - 1 do |
589 |
for x:= 0 to LAND_WIDTH - 1 do |
|
1776 | 590 |
if (y < topY) or (x < leftX) or (x > rightX) then |
591 |
Land[y, x]:= 0 |
|
592 |
else |
|
593 |
begin |
|
594 |
if Land[y, x] = 0 then |
|
595 |
Land[y, x]:= COLOR_LAND |
|
596 |
else if Land[y, x] = COLOR_LAND then |
|
597 |
Land[y, x]:= 0; |
|
598 |
end; |
|
599 |
end; |
|
23 | 600 |
end; |
601 |
||
371 | 602 |
function SelectTemplate: LongInt; |
161 | 603 |
begin |
1797 | 604 |
case cTemplateFilter of |
605 |
0: begin |
|
606 |
SelectTemplate:= getrandom(Succ(High(EdgeTemplates))); |
|
607 |
end; |
|
608 |
1: begin |
|
609 |
SelectTemplate:= SmallTemplates[getrandom(Succ(High(SmallTemplates)))]; |
|
610 |
end; |
|
611 |
2: begin |
|
612 |
SelectTemplate:= MediumTemplates[getrandom(Succ(High(MediumTemplates)))]; |
|
613 |
end; |
|
614 |
3: begin |
|
615 |
SelectTemplate:= LargeTemplates[getrandom(Succ(High(LargeTemplates)))]; |
|
616 |
end; |
|
617 |
4: begin |
|
618 |
SelectTemplate:= CavernTemplates[getrandom(Succ(High(CavernTemplates)))]; |
|
619 |
end; |
|
620 |
5: begin |
|
621 |
SelectTemplate:= WackyTemplates[getrandom(Succ(High(WackyTemplates)))]; |
|
622 |
end; |
|
623 |
end; |
|
624 |
WriteLnToConsole('Selected template #'+inttostr(SelectTemplate)+' using filter #'+inttostr(cTemplateFilter)); |
|
161 | 625 |
end; |
626 |
||
1182
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
627 |
procedure LandSurface2LandPixels(Surface: PSDL_Surface); |
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
628 |
var x, y: LongInt; |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
629 |
p: PLongwordArray; |
1180
e56317fdf78d
Start implementing support for 32bit sprites concerned in map generation process.
unc0rr
parents:
1085
diff
changeset
|
630 |
begin |
1182
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
631 |
TryDo(Surface <> nil, 'Assert (LandSurface <> nil) failed', true); |
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
632 |
|
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
633 |
if SDL_MustLock(Surface) then |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
634 |
SDLTry(SDL_LockSurface(Surface) >= 0, true); |
1180
e56317fdf78d
Start implementing support for 32bit sprites concerned in map generation process.
unc0rr
parents:
1085
diff
changeset
|
635 |
|
1182
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
636 |
p:= Surface^.pixels; |
1760 | 637 |
for y:= 0 to LAND_HEIGHT - 1 do |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
638 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
639 |
for x:= 0 to LAND_WIDTH - 1 do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
640 |
if Land[y, x] <> 0 then LandPixels[y, x]:= p^[x] or AMask; |
2376 | 641 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
642 |
p:= @(p^[Surface^.pitch div 4]); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
643 |
end; |
1180
e56317fdf78d
Start implementing support for 32bit sprites concerned in map generation process.
unc0rr
parents:
1085
diff
changeset
|
644 |
|
1182
e2e13aa055c1
Step 3: Maps are rendered correctly, but without objects yet
unc0rr
parents:
1181
diff
changeset
|
645 |
if SDL_MustLock(Surface) then |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
646 |
SDL_UnlockSurface(Surface); |
1754 | 647 |
end; |
648 |
||
3133 | 649 |
procedure GenMaze; |
650 |
const small_cell_size = 128; |
|
651 |
medium_cell_size = 192; |
|
652 |
large_cell_size = 256; |
|
3138 | 653 |
braidness = 10; |
3133 | 654 |
|
3242 | 655 |
var x, y: LongInt; |
3133 | 656 |
cellsize: LongInt; //selected by the user in the gui |
3242 | 657 |
seen_cells_x, seen_cells_y: LongInt; //number of cells that can be visited by the generator, that is every second cell in x and y direction. the cells between there are walls that will be removed when we move from one cell to another |
658 |
num_edges_x, num_edges_y: LongInt; //number of resulting edges that need to be vertexificated |
|
659 |
num_cells_x, num_cells_y: LongInt; //actual number of cells, depending on cell size |
|
660 |
seen_list: array of array of LongInt; |
|
3133 | 661 |
xwalls: array of array of Boolean; |
662 |
ywalls: array of array of Boolean; |
|
663 |
x_edge_list: array of array of Boolean; |
|
664 |
y_edge_list: array of array of Boolean; |
|
665 |
maze: array of array of Boolean; |
|
666 |
pa: TPixAr; |
|
3242 | 667 |
num_vertices: LongInt; |
3133 | 668 |
off_y: LongInt; |
3242 | 669 |
num_steps: LongInt; |
670 |
current_step: LongInt; |
|
3181 | 671 |
step_done: array of Boolean; |
672 |
done: Boolean; |
|
3242 | 673 |
last_cell: array of record x, y: LongInt; end; |
674 |
came_from: array of array of record x, y: LongInt; end; |
|
675 |
came_from_pos: array of LongInt; |
|
3181 | 676 |
maze_inverted: Boolean; |
3133 | 677 |
|
3242 | 678 |
function when_seen(x: LongInt; y: LongInt): LongInt; |
3133 | 679 |
begin |
680 |
if (x < 0) or (x >= seen_cells_x) or (y < 0) or (y >= seen_cells_y) then |
|
3181 | 681 |
when_seen := current_step |
3133 | 682 |
else |
3181 | 683 |
when_seen := seen_list[x, y]; |
3133 | 684 |
end; |
685 |
||
3242 | 686 |
function is_x_edge(x, y: LongInt): Boolean; |
3133 | 687 |
begin |
688 |
if (x < 0) or (x > num_edges_x) or (y < 0) or (y > num_cells_y) then |
|
689 |
is_x_edge := false |
|
690 |
else |
|
691 |
is_x_edge := x_edge_list[x, y]; |
|
692 |
end; |
|
693 |
||
3242 | 694 |
function is_y_edge(x, y: LongInt): Boolean; |
3133 | 695 |
begin |
696 |
if (x < 0) or (x > num_cells_x) or (y < 0) or (y > num_edges_y) then |
|
697 |
is_y_edge := false |
|
698 |
else |
|
699 |
is_y_edge := y_edge_list[x, y]; |
|
700 |
end; |
|
701 |
||
3181 | 702 |
procedure see_cell; |
3133 | 703 |
var dir: direction; |
3242 | 704 |
tries: LongInt; |
705 |
x, y: LongInt; |
|
3181 | 706 |
found_cell: Boolean; |
707 |
next_dir_clockwise: Boolean; |
|
708 |
||
3133 | 709 |
begin |
3181 | 710 |
x := last_cell[current_step].x; |
711 |
y := last_cell[current_step].y; |
|
712 |
seen_list[x, y] := current_step; |
|
3133 | 713 |
case GetRandom(4) of |
714 |
0: dir := DIR_N; |
|
715 |
1: dir := DIR_E; |
|
716 |
2: dir := DIR_S; |
|
717 |
3: dir := DIR_W; |
|
718 |
end; |
|
719 |
tries := 0; |
|
3181 | 720 |
found_cell := false; |
721 |
if getrandom(2) = 1 then next_dir_clockwise := true |
|
722 |
else next_dir_clockwise := false; |
|
723 |
||
724 |
while (tries < 5) and not found_cell do |
|
3133 | 725 |
begin |
3181 | 726 |
if when_seen(x + dir.x, y + dir.y) = current_step then //we're seeing ourselves, try another direction |
3133 | 727 |
begin |
728 |
//we have already seen the target cell, decide if we should remove the wall anyway |
|
729 |
//(or put a wall there if maze_inverted, but we're not doing that right now) |
|
730 |
if not maze_inverted and (GetRandom(braidness) = 0) then |
|
3181 | 731 |
//or just warn that inverted+braid+indestructible terrain != good idea |
3133 | 732 |
begin |
733 |
case dir.x of |
|
734 |
-1: if x > 0 then ywalls[x-1, y] := false; |
|
735 |
1: if x < seen_cells_x - 1 then ywalls[x, y] := false; |
|
736 |
end; |
|
737 |
case dir.y of |
|
738 |
-1: if y > 0 then xwalls[x, y-1] := false; |
|
739 |
1: if y < seen_cells_y - 1 then xwalls[x, y] := false; |
|
740 |
end; |
|
741 |
end; |
|
3181 | 742 |
if next_dir_clockwise then |
743 |
begin |
|
744 |
if dir = DIR_N then |
|
745 |
dir := DIR_E |
|
746 |
else if dir = DIR_E then |
|
747 |
dir := DIR_S |
|
748 |
else if dir = DIR_S then |
|
749 |
dir := DIR_W |
|
750 |
else |
|
751 |
dir := DIR_N; |
|
752 |
end |
|
3133 | 753 |
else |
3181 | 754 |
begin |
755 |
if dir = DIR_N then |
|
756 |
dir := DIR_W |
|
757 |
else if dir = DIR_E then |
|
758 |
dir := DIR_N |
|
759 |
else if dir = DIR_S then |
|
760 |
dir := DIR_E |
|
761 |
else |
|
762 |
dir := DIR_S; |
|
763 |
end |
|
3133 | 764 |
end |
3181 | 765 |
else if when_seen(x + dir.x, y + dir.y) = -1 then //cell wasn't seen yet, go there |
3133 | 766 |
begin |
767 |
case dir.y of |
|
768 |
-1: xwalls[x, y-1] := false; |
|
769 |
1: xwalls[x, y] := false; |
|
770 |
end; |
|
771 |
case dir.x of |
|
772 |
-1: ywalls[x-1, y] := false; |
|
773 |
1: ywalls[x, y] := false; |
|
774 |
end; |
|
3181 | 775 |
last_cell[current_step].x := x+dir.x; |
776 |
last_cell[current_step].y := y+dir.y; |
|
777 |
came_from_pos[current_step] := came_from_pos[current_step] + 1; |
|
778 |
came_from[current_step, came_from_pos[current_step]].x := x; |
|
779 |
came_from[current_step, came_from_pos[current_step]].y := y; |
|
780 |
found_cell := true; |
|
781 |
end |
|
782 |
else //we're seeing someone else, quit |
|
783 |
begin |
|
784 |
step_done[current_step] := true; |
|
785 |
found_cell := true; |
|
3133 | 786 |
end; |
787 |
||
788 |
tries := tries + 1; |
|
789 |
end; |
|
3181 | 790 |
if not found_cell then |
791 |
begin |
|
792 |
last_cell[current_step].x := came_from[current_step, came_from_pos[current_step]].x; |
|
793 |
last_cell[current_step].y := came_from[current_step, came_from_pos[current_step]].y; |
|
794 |
came_from_pos[current_step] := came_from_pos[current_step] - 1; |
|
795 |
if came_from_pos[current_step] >= 0 then see_cell |
|
796 |
else step_done[current_step] := true; |
|
797 |
end; |
|
798 |
end; |
|
3133 | 799 |
|
3242 | 800 |
procedure add_vertex(x, y: LongInt); |
801 |
var tmp_x, tmp_y: LongInt; |
|
3133 | 802 |
begin |
803 |
if x = NTPX then |
|
804 |
begin |
|
3138 | 805 |
if pa.ar[num_vertices - 6].x = NTPX then |
806 |
begin |
|
807 |
num_vertices := num_vertices - 6; |
|
808 |
end |
|
809 |
else |
|
810 |
begin |
|
811 |
pa.ar[num_vertices].x := NTPX; |
|
812 |
pa.ar[num_vertices].y := 0; |
|
813 |
end |
|
3133 | 814 |
end |
815 |
else |
|
816 |
begin |
|
3181 | 817 |
if maze_inverted or (x mod 2 = 0) then tmp_x := cellsize |
3138 | 818 |
else tmp_x := cellsize * 2 div 3; |
3181 | 819 |
if maze_inverted or (y mod 2 = 0) then tmp_y := cellsize |
3138 | 820 |
else tmp_y := cellsize * 2 div 3; |
821 |
||
822 |
pa.ar[num_vertices].x := (x-1)*cellsize + tmp_x; |
|
823 |
pa.ar[num_vertices].y := (y-1)*cellsize + tmp_y + off_y; |
|
3133 | 824 |
end; |
825 |
num_vertices := num_vertices + 1; |
|
826 |
end; |
|
827 |
||
3242 | 828 |
procedure add_edge(x, y: LongInt; dir: direction); |
829 |
var i: LongInt; |
|
3133 | 830 |
begin |
831 |
if dir = DIR_N then |
|
832 |
begin |
|
833 |
dir := DIR_W |
|
834 |
end |
|
835 |
else if dir = DIR_E then |
|
836 |
begin |
|
837 |
dir := DIR_N |
|
838 |
end |
|
839 |
else if dir = DIR_S then |
|
840 |
begin |
|
841 |
dir := DIR_E |
|
842 |
end |
|
843 |
else |
|
844 |
begin |
|
845 |
dir := DIR_S; |
|
846 |
end; |
|
847 |
||
848 |
for i := 0 to 3 do |
|
849 |
begin |
|
850 |
if dir = DIR_N then |
|
851 |
dir := DIR_E |
|
852 |
else if dir = DIR_E then |
|
853 |
dir := DIR_S |
|
854 |
else if dir = DIR_S then |
|
855 |
dir := DIR_W |
|
856 |
else |
|
857 |
dir := DIR_N; |
|
858 |
||
859 |
if (dir = DIR_N) and is_x_edge(x, y) then |
|
860 |
begin |
|
861 |
x_edge_list[x, y] := false; |
|
862 |
add_vertex(x+1, y); |
|
863 |
add_edge(x, y-1, DIR_N); |
|
864 |
break; |
|
865 |
end; |
|
866 |
||
867 |
if (dir = DIR_E) and is_y_edge(x+1, y) then |
|
868 |
begin |
|
869 |
y_edge_list[x+1, y] := false; |
|
870 |
add_vertex(x+2, y+1); |
|
871 |
add_edge(x+1, y, DIR_E); |
|
872 |
break; |
|
873 |
end; |
|
874 |
||
875 |
if (dir = DIR_S) and is_x_edge(x, y+1) then |
|
876 |
begin |
|
877 |
x_edge_list[x, y+1] := false; |
|
878 |
add_vertex(x+1, y+2); |
|
879 |
add_edge(x, y+1, DIR_S); |
|
880 |
break; |
|
881 |
end; |
|
882 |
||
883 |
if (dir = DIR_W) and is_y_edge(x, y) then |
|
884 |
begin |
|
885 |
y_edge_list[x, y] := false; |
|
886 |
add_vertex(x, y+1); |
|
887 |
add_edge(x-1, y, DIR_W); |
|
888 |
break; |
|
889 |
end; |
|
890 |
end; |
|
891 |
||
892 |
end; |
|
893 |
||
894 |
begin |
|
895 |
case cMazeSize of |
|
3181 | 896 |
0: begin |
897 |
cellsize := small_cell_size; |
|
898 |
maze_inverted := false; |
|
899 |
end; |
|
900 |
1: begin |
|
901 |
cellsize := medium_cell_size; |
|
902 |
maze_inverted := false; |
|
903 |
end; |
|
904 |
2: begin |
|
905 |
cellsize := large_cell_size; |
|
906 |
maze_inverted := false; |
|
907 |
end; |
|
908 |
3: begin |
|
909 |
cellsize := small_cell_size; |
|
910 |
maze_inverted := true; |
|
911 |
end; |
|
912 |
4: begin |
|
913 |
cellsize := medium_cell_size; |
|
914 |
maze_inverted := true; |
|
915 |
end; |
|
916 |
5: begin |
|
917 |
cellsize := large_cell_size; |
|
918 |
maze_inverted := true; |
|
919 |
end; |
|
3133 | 920 |
end; |
921 |
||
922 |
num_cells_x := LAND_WIDTH div cellsize; |
|
3228 | 923 |
if not odd(num_cells_x) then num_cells_x := num_cells_x - 1; //needs to be odd |
3133 | 924 |
num_cells_y := LAND_HEIGHT div cellsize; |
3228 | 925 |
if not odd(num_cells_y) then num_cells_y := num_cells_y - 1; |
3133 | 926 |
num_edges_x := num_cells_x - 1; |
927 |
num_edges_y := num_cells_y - 1; |
|
928 |
seen_cells_x := num_cells_x div 2; |
|
929 |
seen_cells_y := num_cells_y div 2; |
|
930 |
||
3181 | 931 |
if maze_inverted then |
932 |
num_steps := 3 //TODO randomize, between 3 and 5? |
|
933 |
else |
|
934 |
num_steps := 1; |
|
935 |
SetLength(step_done, num_steps); |
|
936 |
SetLength(last_cell, num_steps); |
|
937 |
SetLength(came_from_pos, num_steps); |
|
938 |
SetLength(came_from, num_steps, num_cells_x*num_cells_y); |
|
939 |
done := false; |
|
940 |
for current_step := 0 to num_steps - 1 do |
|
941 |
step_done[current_step] := false; |
|
942 |
came_from_pos[current_step] := 0; |
|
943 |
current_step := 0; |
|
944 |
||
3133 | 945 |
SetLength(seen_list, seen_cells_x, seen_cells_y); |
946 |
SetLength(xwalls, seen_cells_x, seen_cells_y - 1); |
|
947 |
SetLength(ywalls, seen_cells_x - 1, seen_cells_y); |
|
948 |
SetLength(x_edge_list, num_edges_x, num_cells_y); |
|
949 |
SetLength(y_edge_list, num_cells_x, num_edges_y); |
|
950 |
SetLength(maze, num_cells_x, num_cells_y); |
|
951 |
||
952 |
num_vertices := 0; |
|
953 |
||
954 |
playHeight := num_cells_y * cellsize; |
|
955 |
playWidth := num_cells_x * cellsize; |
|
956 |
off_y := LAND_HEIGHT - playHeight; |
|
957 |
||
958 |
for x := 0 to playWidth do |
|
959 |
for y := 0 to off_y - 1 do |
|
3181 | 960 |
Land[y, x] := 0; |
3133 | 961 |
|
962 |
for x := 0 to playWidth do |
|
963 |
for y := off_y to LAND_HEIGHT - 1 do |
|
3181 | 964 |
Land[y, x] := COLOR_LAND; |
3133 | 965 |
|
966 |
for y := 0 to num_cells_y - 1 do |
|
967 |
for x := 0 to num_cells_x - 1 do |
|
968 |
maze[x, y] := false; |
|
969 |
||
970 |
for x := 0 to seen_cells_x - 1 do |
|
971 |
for y := 0 to seen_cells_y - 2 do |
|
972 |
xwalls[x, y] := true; |
|
973 |
||
974 |
for x := 0 to seen_cells_x - 2 do |
|
975 |
for y := 0 to seen_cells_y - 1 do |
|
976 |
ywalls[x, y] := true; |
|
977 |
||
978 |
for x := 0 to seen_cells_x - 1 do |
|
979 |
for y := 0 to seen_cells_y - 1 do |
|
3181 | 980 |
seen_list[x, y] := -1; |
3133 | 981 |
|
982 |
for x := 0 to num_edges_x - 1 do |
|
983 |
for y := 0 to num_cells_y - 1 do |
|
984 |
x_edge_list[x, y] := false; |
|
985 |
||
986 |
for x := 0 to num_cells_x - 1 do |
|
987 |
for y := 0 to num_edges_y - 1 do |
|
988 |
y_edge_list[x, y] := false; |
|
989 |
||
3181 | 990 |
for current_step := 0 to num_steps-1 do |
991 |
begin |
|
3242 | 992 |
x := GetRandom(seen_cells_x - 1) div LongWord(num_steps); |
3181 | 993 |
last_cell[current_step].x := x + current_step * seen_cells_x div num_steps; |
994 |
last_cell[current_step].y := GetRandom(seen_cells_y); |
|
995 |
end; |
|
996 |
||
997 |
while not done do |
|
998 |
begin |
|
999 |
done := true; |
|
1000 |
for current_step := 0 to num_steps-1 do |
|
1001 |
begin |
|
1002 |
if not step_done[current_step] then |
|
1003 |
begin |
|
1004 |
see_cell; |
|
1005 |
done := false; |
|
1006 |
end; |
|
1007 |
end; |
|
1008 |
end; |
|
3133 | 1009 |
|
1010 |
for x := 0 to seen_cells_x - 1 do |
|
1011 |
for y := 0 to seen_cells_y - 1 do |
|
3181 | 1012 |
if seen_list[x, y] > -1 then |
3133 | 1013 |
maze[(x+1)*2-1, (y+1)*2-1] := true; |
1014 |
||
1015 |
for x := 0 to seen_cells_x - 1 do |
|
1016 |
for y := 0 to seen_cells_y - 2 do |
|
1017 |
if not xwalls[x, y] then |
|
1018 |
maze[x*2 + 1, y*2 + 2] := true; |
|
1019 |
||
1020 |
||
1021 |
for x := 0 to seen_cells_x - 2 do |
|
1022 |
for y := 0 to seen_cells_y - 1 do |
|
1023 |
if not ywalls[x, y] then |
|
1024 |
maze[x*2 + 2, y*2 + 1] := true; |
|
1025 |
||
1026 |
for x := 0 to num_edges_x - 1 do |
|
1027 |
for y := 0 to num_cells_y - 1 do |
|
1028 |
if maze[x, y] xor maze[x+1, y] then |
|
1029 |
x_edge_list[x, y] := true |
|
1030 |
else |
|
1031 |
x_edge_list[x, y] := false; |
|
1032 |
||
1033 |
for x := 0 to num_cells_x - 1 do |
|
1034 |
for y := 0 to num_edges_y - 1 do |
|
1035 |
if maze[x, y] xor maze[x, y+1] then |
|
1036 |
y_edge_list[x, y] := true |
|
1037 |
else |
|
1038 |
y_edge_list[x, y] := false; |
|
1039 |
||
1040 |
for x := 0 to num_edges_x - 1 do |
|
1041 |
for y := 0 to num_cells_y - 1 do |
|
1042 |
if x_edge_list[x, y] then |
|
1043 |
begin |
|
1044 |
x_edge_list[x, y] := false; |
|
1045 |
add_vertex(x+1, y+1); |
|
1046 |
add_vertex(x+1, y); |
|
1047 |
add_edge(x, y-1, DIR_N); |
|
1048 |
add_vertex(NTPX, 0); |
|
1049 |
end; |
|
1050 |
||
1051 |
pa.count := num_vertices; |
|
1052 |
||
1053 |
RandomizePoints(pa); |
|
1054 |
BezierizeEdge(pa, _0_25); |
|
1055 |
RandomizePoints(pa); |
|
3138 | 1056 |
BezierizeEdge(pa, _0_25); |
3133 | 1057 |
|
1058 |
DrawEdge(pa, 0); |
|
1059 |
||
3181 | 1060 |
if maze_inverted then |
1061 |
FillLand(1, 1+off_y) |
|
1062 |
else |
|
1063 |
begin |
|
1064 |
x := 0; |
|
1065 |
while Land[cellsize div 2 + cellsize + off_y, x] = COLOR_LAND do |
|
1066 |
x := x + 1; |
|
1067 |
while Land[cellsize div 2 + cellsize + off_y, x] = 0 do |
|
1068 |
x := x + 1; |
|
1069 |
FillLand(x+1, cellsize div 2 + cellsize + off_y); |
|
1070 |
end; |
|
3133 | 1071 |
|
1072 |
MaxHedgehogs:= 32; |
|
3141
70d65353bd60
prg adds option to toggle girders in maze, adjusts some frontend strings
nemo
parents:
3138
diff
changeset
|
1073 |
if (GameFlags and gfDisableGirders) <> 0 then hasGirders:= false |
70d65353bd60
prg adds option to toggle girders in maze, adjusts some frontend strings
nemo
parents:
3138
diff
changeset
|
1074 |
else hasGirders := true; |
3133 | 1075 |
leftX:= 0; |
1076 |
rightX:= playWidth; |
|
1077 |
topY:= off_y; |
|
3181 | 1078 |
hasBorder := false; |
3133 | 1079 |
end; |
1080 |
||
1754 | 1081 |
procedure GenLandSurface; |
1082 |
var tmpsurf: PSDL_Surface; |
|
1083 |
begin |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1084 |
WriteLnToConsole('Generating land...'); |
3133 | 1085 |
case cMapGen of |
1086 |
0: GenBlank(EdgeTemplates[SelectTemplate]); |
|
1087 |
1: GenMaze; |
|
1088 |
end; |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1089 |
AddProgress(); |
1754 | 1090 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1091 |
tmpsurf:= SDL_CreateRGBSurface(SDL_SWSURFACE, LAND_WIDTH, LAND_HEIGHT, 32, RMask, GMask, BMask, 0); |
1754 | 1092 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1093 |
TryDo(tmpsurf <> nil, 'Error creating pre-land surface', true); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1094 |
ColorizeLand(tmpsurf); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1095 |
AddOnLandObjects(tmpsurf); |
1754 | 1096 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1097 |
LandSurface2LandPixels(tmpsurf); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1098 |
SDL_FreeSurface(tmpsurf); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1099 |
AddProgress(); |
1754 | 1100 |
end; |
1101 |
||
1102 |
procedure MakeFortsMap; |
|
1103 |
var tmpsurf: PSDL_Surface; |
|
1104 |
begin |
|
2866 | 1105 |
MaxHedgehogs:= 32; |
2171
8208946331ba
Smaxx refactor of LoadImage to use flags, iphone changes by koda (mostly use of rgba instead of rgb)
nemo
parents:
2163
diff
changeset
|
1106 |
// For now, defining a fort is playable area as 3072x1200 - there are no tall forts. The extra height is to avoid triggering border with current code, also if user turns on a border, it will give a bit more maneuvering room. |
1784 | 1107 |
playHeight:= 1200; |
2096 | 1108 |
playWidth:= 2560; |
1776 | 1109 |
leftX:= (LAND_WIDTH - playWidth) div 2; |
1110 |
rightX:= ((playWidth + (LAND_WIDTH - playWidth) div 2) - 1); |
|
1111 |
topY:= LAND_HEIGHT - playHeight; |
|
1112 |
||
1754 | 1113 |
WriteLnToConsole('Generating forts land...'); |
1114 |
||
2171
8208946331ba
Smaxx refactor of LoadImage to use flags, iphone changes by koda (mostly use of rgba instead of rgb)
nemo
parents:
2163
diff
changeset
|
1115 |
tmpsurf:= LoadImage(Pathz[ptForts] + '/' + ClansArray[0]^.Teams[0]^.FortName + 'L', ifAlpha or ifCritical or ifTransparent or ifIgnoreCaps); |
1784 | 1116 |
BlitImageAndGenerateCollisionInfo(leftX+150, LAND_HEIGHT - tmpsurf^.h, tmpsurf^.w, tmpsurf); |
1754 | 1117 |
SDL_FreeSurface(tmpsurf); |
1118 |
||
2171
8208946331ba
Smaxx refactor of LoadImage to use flags, iphone changes by koda (mostly use of rgba instead of rgb)
nemo
parents:
2163
diff
changeset
|
1119 |
tmpsurf:= LoadImage(Pathz[ptForts] + '/' + ClansArray[1]^.Teams[0]^.FortName + 'R', ifAlpha or ifCritical or ifTransparent or ifIgnoreCaps); |
1784 | 1120 |
BlitImageAndGenerateCollisionInfo(rightX - 150 - tmpsurf^.w, LAND_HEIGHT - tmpsurf^.h, tmpsurf^.w, tmpsurf); |
1754 | 1121 |
SDL_FreeSurface(tmpsurf); |
1122 |
end; |
|
1123 |
||
1792 | 1124 |
// Hi unC0Rr. |
1125 |
// This is a function that Tiy assures me would not be good for gameplay. |
|
1126 |
// It allows the setting of arbitrary portions of landscape as indestructible, or regular, or even blank. |
|
2154
3d2917be12c3
Change default output to stderr since /tmp doesn't exist under windows and is useless under iphoneos, add a couple of extra parameters
nemo
parents:
2152
diff
changeset
|
1127 |
// He said I could add it here only when I swore it would not impact gameplay. Which, as far as I can tell, is true. |
3d2917be12c3
Change default output to stderr since /tmp doesn't exist under windows and is useless under iphoneos, add a couple of extra parameters
nemo
parents:
2152
diff
changeset
|
1128 |
// I would just like to play with it with my friends if you do not mind. |
1792 | 1129 |
// Can allow for amusing maps. |
1130 |
procedure LoadMask; |
|
1131 |
var tmpsurf: PSDL_Surface; |
|
1132 |
p: PLongwordArray; |
|
1133 |
x, y, cpX, cpY: Longword; |
|
1134 |
begin |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1135 |
tmpsurf:= LoadImage(Pathz[ptMapCurrent] + '/mask', ifAlpha or ifTransparent or ifIgnoreCaps); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1136 |
if (tmpsurf <> nil) and (tmpsurf^.w <= LAND_WIDTH) and (tmpsurf^.h <= LAND_HEIGHT) and (tmpsurf^.format^.BytesPerPixel = 4) then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1137 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1138 |
cpX:= (LAND_WIDTH - tmpsurf^.w) div 2; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1139 |
cpY:= LAND_HEIGHT - tmpsurf^.h; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1140 |
if SDL_MustLock(tmpsurf) then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1141 |
SDLTry(SDL_LockSurface(tmpsurf) >= 0, true); |
2376 | 1142 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1143 |
p:= tmpsurf^.pixels; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1144 |
for y:= 0 to Pred(tmpsurf^.h) do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1145 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1146 |
for x:= 0 to Pred(tmpsurf^.w) do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1147 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1148 |
if ((AMask and p^[x]) = 0) then // Tiy was having trouble generating transparent black |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1149 |
Land[cpY + y, cpX + x]:= 0 |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1150 |
else if p^[x] = (AMask or RMask) then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1151 |
Land[cpY + y, cpX + x]:= COLOR_INDESTRUCTIBLE |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1152 |
else if p^[x] = $FFFFFFFF then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1153 |
Land[cpY + y, cpX + x]:= COLOR_LAND; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1154 |
end; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1155 |
p:= @(p^[tmpsurf^.pitch div 4]); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1156 |
end; |
2243
b4764993f833
additional touch support and nemo's reduced land array size
koda
parents:
2240
diff
changeset
|
1157 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1158 |
if SDL_MustLock(tmpsurf) then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1159 |
SDL_UnlockSurface(tmpsurf); |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1160 |
end; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1161 |
if (tmpsurf <> nil) then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1162 |
SDL_FreeSurface(tmpsurf); |
1792 | 1163 |
end; |
1164 |
||
1754 | 1165 |
procedure LoadMap; |
1166 |
var tmpsurf: PSDL_Surface; |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1167 |
s: shortstring; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1168 |
f: textfile; |
1754 | 1169 |
begin |
2981 | 1170 |
isMap:= true; |
1754 | 1171 |
WriteLnToConsole('Loading land from file...'); |
1172 |
AddProgress; |
|
2171
8208946331ba
Smaxx refactor of LoadImage to use flags, iphone changes by koda (mostly use of rgba instead of rgb)
nemo
parents:
2163
diff
changeset
|
1173 |
tmpsurf:= LoadImage(Pathz[ptMapCurrent] + '/map', ifAlpha or ifCritical or ifTransparent or ifIgnoreCaps); |
1760 | 1174 |
TryDo((tmpsurf^.w <= LAND_WIDTH) and (tmpsurf^.h <= LAND_HEIGHT), 'Map dimensions too big!', true); |
1754 | 1175 |
|
2154
3d2917be12c3
Change default output to stderr since /tmp doesn't exist under windows and is useless under iphoneos, add a couple of extra parameters
nemo
parents:
2152
diff
changeset
|
1176 |
// unC0Rr - should this be passed from the GUI? I am not sure which layer does what |
1792 | 1177 |
s:= Pathz[ptMapCurrent] + '/map.cfg'; |
1178 |
WriteLnToConsole('Fetching map HH limit'); |
|
1179 |
Assign(f, s); |
|
2747 | 1180 |
filemode:= 0; // readonly |
1792 | 1181 |
Reset(f); |
1795 | 1182 |
Readln(f); |
1183 |
if not eof(f) then Readln(f, MaxHedgehogs); |
|
1184 |
||
2705
2b5625c4ec16
fix a nasty 196 bytes memory leak in engine, plus other stuff for iphone frontend
koda
parents:
2699
diff
changeset
|
1185 |
if (MaxHedgehogs = 0) then MaxHedgehogs:= 18; |
1792 | 1186 |
|
1776 | 1187 |
playHeight:= tmpsurf^.h; |
1188 |
playWidth:= tmpsurf^.w; |
|
1189 |
leftX:= (LAND_WIDTH - playWidth) div 2; |
|
1190 |
rightX:= (playWidth + ((LAND_WIDTH - playWidth) div 2)) - 1; |
|
1191 |
topY:= LAND_HEIGHT - playHeight; |
|
1192 |
||
1754 | 1193 |
TryDo(tmpsurf^.format^.BytesPerPixel = 4, 'Map should be 32bit', true); |
1194 |
||
1772 | 1195 |
BlitImageAndGenerateCollisionInfo( |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1196 |
(LAND_WIDTH - tmpsurf^.w) div 2, |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1197 |
LAND_HEIGHT - tmpsurf^.h, |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1198 |
tmpsurf^.w, |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1199 |
tmpsurf); |
1754 | 1200 |
SDL_FreeSurface(tmpsurf); |
1792 | 1201 |
|
1202 |
LoadMask; |
|
1754 | 1203 |
end; |
1204 |
||
1205 |
procedure GenMap; |
|
1784 | 1206 |
var x, y, w, c: Longword; |
1754 | 1207 |
begin |
1776 | 1208 |
hasBorder:= false; |
2891
e1f902eb0cfe
Formerly "Draw Girders" by MrMfS - now "Disable Girders" to allow template prefs to still exist
nemo
parents:
2866
diff
changeset
|
1209 |
|
1754 | 1210 |
LoadThemeConfig; |
2981 | 1211 |
isMap:= false; |
1754 | 1212 |
if (GameFlags and gfForts) = 0 then |
1213 |
if Pathz[ptMapCurrent] <> '' then LoadMap |
|
1214 |
else GenLandSurface |
|
1215 |
else MakeFortsMap; |
|
1216 |
AddProgress; |
|
1760 | 1217 |
|
1754 | 1218 |
{$IFDEF DEBUGFILE}LogLandDigest;{$ENDIF} |
1753 | 1219 |
|
1768 | 1220 |
// check for land near top |
1784 | 1221 |
c:= 0; |
1222 |
if (GameFlags and gfBorder) <> 0 then |
|
1223 |
hasBorder:= true |
|
1224 |
else |
|
1225 |
for y:= topY to topY + 5 do |
|
1226 |
for x:= leftX to rightX do |
|
1227 |
if Land[y, x] <> 0 then |
|
1228 |
begin |
|
1229 |
inc(c); |
|
1230 |
if c > 200 then // avoid accidental triggering |
|
1231 |
begin |
|
1232 |
hasBorder:= true; |
|
1233 |
break; |
|
1234 |
end; |
|
1235 |
end; |
|
1768 | 1236 |
|
1776 | 1237 |
if hasBorder then |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1238 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1239 |
for y:= 0 to LAND_HEIGHT - 1 do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1240 |
for x:= 0 to LAND_WIDTH - 1 do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1241 |
if (y < topY) or (x < leftX) or (x > rightX) then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1242 |
Land[y, x]:= COLOR_INDESTRUCTIBLE; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1243 |
// experiment hardcoding cave |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1244 |
// also try basing cave dimensions on map/template dimensions, if they exist |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1245 |
for w:= 0 to 5 do // width of 3 allowed hogs to be knocked through with grenade |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1246 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1247 |
for y:= topY to LAND_HEIGHT - 1 do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1248 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1249 |
Land[y, leftX + w]:= COLOR_INDESTRUCTIBLE; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1250 |
Land[y, rightX - w]:= COLOR_INDESTRUCTIBLE; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1251 |
if (y + w) mod 32 < 16 then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1252 |
c:= AMask |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1253 |
else |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1254 |
c:= AMask or RMask or GMask; // FF00FFFF |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1255 |
LandPixels[y, leftX + w]:= c; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1256 |
LandPixels[y, rightX - w]:= c; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1257 |
end; |
1768 | 1258 |
|
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1259 |
for x:= leftX to rightX do |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1260 |
begin |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1261 |
Land[topY + w, x]:= COLOR_INDESTRUCTIBLE; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1262 |
if (x + w) mod 32 < 16 then |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1263 |
c:= AMask |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1264 |
else |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1265 |
c:= AMask or RMask or GMask; // FF00FFFF |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1266 |
LandPixels[topY + w, x]:= c; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1267 |
end; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1268 |
end; |
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1269 |
end; |
1768 | 1270 |
|
2891
e1f902eb0cfe
Formerly "Draw Girders" by MrMfS - now "Disable Girders" to allow template prefs to still exist
nemo
parents:
2866
diff
changeset
|
1271 |
if (GameFlags and gfDisableGirders) <> 0 then hasGirders:= false; |
e1f902eb0cfe
Formerly "Draw Girders" by MrMfS - now "Disable Girders" to allow template prefs to still exist
nemo
parents:
2866
diff
changeset
|
1272 |
|
3287 | 1273 |
if ((GameFlags and gfForts) = 0) |
1274 |
and ((GameFlags and gfDisableLandObjects) = 0) |
|
1275 |
and (Pathz[ptMapCurrent] = '') |
|
1276 |
then AddObjects; |
|
1776 | 1277 |
|
3058 | 1278 |
FreeLandObjects; |
1279 |
||
1807 | 1280 |
UpdateLandTexture(0, LAND_WIDTH, 0, LAND_HEIGHT); |
37 | 1281 |
end; |
1282 |
||
566 | 1283 |
function GenPreview: TPreview; |
371 | 1284 |
var x, y, xx, yy, t, bit: LongInt; |
566 | 1285 |
Preview: TPreview; |
155
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1286 |
begin |
160 | 1287 |
WriteLnToConsole('Generating preview...'); |
3133 | 1288 |
case cMapGen of |
1289 |
0: GenBlank(EdgeTemplates[SelectTemplate]); |
|
1290 |
1: GenMaze; |
|
1291 |
end; |
|
155
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1292 |
|
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1293 |
for y:= 0 to 127 do |
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1294 |
for x:= 0 to 31 do |
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1295 |
begin |
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1296 |
Preview[y, x]:= 0; |
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1297 |
for bit:= 0 to 7 do |
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1298 |
begin |
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1299 |
t:= 0; |
1760 | 1300 |
for yy:= y * (LAND_HEIGHT div 128) to y * (LAND_HEIGHT div 128) + 7 do |
1301 |
for xx:= x * (LAND_WIDTH div 32) + bit * 8 to x * (LAND_WIDTH div 32) + bit * 8 + 7 do |
|
155
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1302 |
if Land[yy, xx] <> 0 then inc(t); |
351 | 1303 |
if t > 8 then Preview[y, x]:= Preview[y, x] or ($80 shr bit) |
155
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1304 |
end |
566 | 1305 |
end; |
1768 | 1306 |
GenPreview:= Preview |
155
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1307 |
end; |
401f4ea24715
Engine can generate land preview and send it via IPC
unc0rr
parents:
109
diff
changeset
|
1308 |
|
3038 | 1309 |
procedure initModule; |
2699
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
1310 |
begin |
2948
3f21a9dc93d0
Replace tabs with spaces using 'expand -t 4' command
unc0rr
parents:
2905
diff
changeset
|
1311 |
LandBackSurface:= nil; |
3055
f542a36ef6c0
fix a build error on 10.5, LandPixels properly initialized
koda
parents:
3048
diff
changeset
|
1312 |
FillChar(LandPixels, sizeof(TLandArray), 0); |
2699
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
1313 |
end; |
51 | 1314 |
|
3038 | 1315 |
procedure freeModule; |
2699
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
1316 |
begin |
3055
f542a36ef6c0
fix a build error on 10.5, LandPixels properly initialized
koda
parents:
3048
diff
changeset
|
1317 |
|
2699
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
1318 |
end; |
249adefa9c1c
replace initialization/finalization statements with custom init functions
koda
parents:
2692
diff
changeset
|
1319 |
|
4 | 1320 |
end. |