This repository has been archived by the owner on Aug 21, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathroad_transitions.pas
243 lines (213 loc) · 5.21 KB
/
road_transitions.pas
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
{ This file is a part of Map editor for VCMI project
Copyright (C) 2013-2017 Alexander Shishkin alexvins@users.sourceforge.net
This source is free software; you can redistribute it and/or modify it under the terms of the GNU General Public
License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later
version.
This code is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
details.
A copy of the GNU General Public License is available on the World Wide Web at
<http://www.gnu.org/copyleft/gpl.html>. You can also obtain it by writing to the Free Software Foundation, Inc., 59
Temple Place - Suite 330, Boston, MA 02111-1307, USA.
}
unit road_transitions;
{$I compilersetup.inc}
interface
uses
Classes, SysUtils, transitions;
type
TSimpleRule = string;
TSimpleRulesArray = array[0..8] of TSimpleRule;
TSimplePattern = record
Rules:TSimpleRulesArray;
RoadMapping, RiverMapping: TMapping;
HasVFlip: boolean;
HasHFlip: boolean;
end;
const
ROAD_RULES : array[0..9] of TSimplePattern =
(
//single tile. In fact there is no good pattern for such case.
(
Rules:
(
'-','-','-',
'-','+','-',
'-','-','-'
);
RoadMapping: (Lower:14; Upper:14);
RiverMapping: (Lower:9; Upper:10);
HasVFlip: false;
HasHFlip: false;
),
//Road straight with angle //???
(
Rules:
(
'?','-','+',
'-','+','+',
'+','+','?'
);
RoadMapping: (Lower:2; Upper:5);
RiverMapping: (Lower:-1; Upper:-1);
HasVFlip: true;
HasHFlip: true;
),
//Road turn right
(
Rules:
(
'?','-','?',
'-','+','+',
'?','+','?'
);
RoadMapping: (Lower:0; Upper:1);
RiverMapping: (Lower:0; Upper:3);
HasVFlip: true;
HasHFlip: true;
),
//dead end right
(
Rules:
(
'?','-','?',
'-','+','+',
'?','-','?'
);
RoadMapping: (Lower:15; Upper:15);
RiverMapping: (Lower:11; Upper:12);
HasVFlip: false;
HasHFlip: true;
),
//dead end down
(
Rules:
(
'?','-','?',
'-','+','-',
'?','+','?'
);
RoadMapping: (Lower:14; Upper:14);
RiverMapping: (Lower:9; Upper:10);
HasVFlip: true;
HasHFlip: false;
),
//T-cross right
(
Rules:
(
'?','+','?',
'-','+','+',
'?','+','?'
);
RoadMapping: (Lower:6; Upper:7);
RiverMapping: (Lower:7; Upper:8);
HasVFlip: false;
HasHFlip: true;
),
//T-cross down
(
Rules:
(
'?','-','?',
'+','+','+',
'?','+','?'
);
RoadMapping: (Lower:8; Upper:9);
RiverMapping: (Lower:5; Upper:6);
HasVFlip: true;
HasHFlip: false;
),
//Horizontal
(
Rules:
(
'?','-','?',
'+','+','+',
'?','-','?'
);
RoadMapping: (Lower:12; Upper:13);
RiverMapping: (Lower:11; Upper:12);
HasVFlip: false;
HasHFlip: false;
),
//Vertical
(
Rules:
(
'?','+','?',
'-','+','-',
'?','+','?'
);
RoadMapping: (Lower:10; Upper:11);
RiverMapping: (Lower:9; Upper:10);
HasVFlip: false;
HasHFlip: false;
),
//X-cross
(
Rules:
(
'?','+','?',
'+','+','+',
'?','+','?'
);
RoadMapping: (Lower:16; Upper:16);
RiverMapping: (Lower:4; Upper:4);
HasVFlip: false;
HasHFlip: false;
)
);
function GetFlippedPattern(const APattern: TSimplePattern; flip:Integer):TSimplePattern;
implementation
function RuleIsAny(const Rule: TSimpleRule): boolean;
begin
Result := Rule = '?';
end;
function RuleIsRoad(const Rule: TSimpleRule): boolean;
begin
Result := Rule = '+';
end;
function RuleIsNone(const Rule: TSimpleRule): boolean;
begin
Result := Rule = '-';
end;
function GetFlippedPattern(const APattern: TSimplePattern; flip: Integer
): TSimplePattern;
procedure SwapRules(var p: TSimplePattern; idx1, idx2: Integer);
var
tmp: TSimpleRule;
begin
tmp := p.Rules[idx1];
p.Rules[idx1] := p.Rules[idx2];
p.Rules[idx2] := tmp;
end;
var
i: Integer;
y: Integer;
begin
//todo: use cached patterns
if flip = 0 then
begin
Exit(APattern);
end
else begin
Assert(flip > 0);
Assert(flip < 4);
Result := APattern;
if flip in [FLIP_PATTERN_HORIZONTAL, FLIP_PATTERN_BOTH] then
for i := 0 to 3 - 1 do
begin
y := i*3;
SwapRules(Result,Y+2,Y);
end;
if flip in [FLIP_PATTERN_VERTICAL, FLIP_PATTERN_BOTH] then
begin
for i := 0 to 3 - 1 do
begin
SwapRules(Result,i,i+6);
end;
end;
end;
end;
end.