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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
|
------------------------------------------------------------------------------
-- dungeon.lua:
-- Dungeoneering functions.
------------------------------------------------------------------------------
require("clua/point.lua")
dgn.GXM, dgn.GYM = dgn.max_bounds()
dgn.f_map = { }
-- Table that will be saved in <foo>.sav.
dgn.persist = { }
function dgn_save_data(th)
lmark.marshall_table(th, dgn.persist)
end
function dgn_load_data(th)
dgn.persist = lmark.unmarshall_table(th) or { }
end
function dgn.fnum(name)
local fnum = dgn.f_map[name]
if not fnum then
fnum = dgn.feature_number(name)
dgn.f_map[name] = fnum
end
return fnum
end
-- Wraps a map_def into a Lua environment (a table) such that
-- functions run in the environment (with setfenv) can directly
-- address the map with function calls such as name(), tags(), etc.
--
-- This function caches the environments it creates, so that successive runs
-- of Lua chunks from the same map will use the same environment.
function dgn_map_meta_wrap(map, tab)
if not dgn._map_envs then
dgn._map_envs = { }
end
local name = dgn.name(map)
local meta = dgn._map_envs[name]
if not meta then
meta = { }
local meta_meta = { __index = _G }
setmetatable(meta, meta_meta)
dgn._map_envs[name] = meta
end
-- We must set this each time - the map may have the same name, but
-- be a different C++ object.
for fn, val in pairs(tab) do
meta[fn] = function (...)
return crawl.err_trace(val, map, ...)
end
end
meta['_G'] = meta
meta.wrapped_instance = map
return meta
end
-- Discards accumulated map environments.
function dgn_flush_map_environments()
dgn._map_envs = nil
end
function dgn_set_map(map)
g_dgn_curr_map = map
end
function dgn_run_map(prelude, main)
if prelude or main then
local env = dgn_map_meta_wrap(g_dgn_curr_map, dgn)
if prelude then
local fn = setfenv(prelude, env)
if not main then
return fn()
end
fn()
end
if main then
return setfenv(main, env)()
end
end
end
--------------------------------------------------------------------
function dgn.places_connected(map, map_glyph, test_connect, ...)
local points = { }
for _, glyph in ipairs( { ... } ) do
local x, y = map_glyph(map, glyph)
if x and y then
table.insert(points, x)
table.insert(points, y)
else
error("Can't find coords for '" .. glyph .. "'")
end
end
return test_connect(map, unpack(points))
end
function dgn.any_glyph_connected(map, ...)
return dgn.places_connected(map, dgn.gly_points,
dgn.any_point_connected, ...)
end
function dgn.has_exit_from_glyph(map, glyph)
return dgn.places_connected(map, dgn.gly_point, dgn.has_exit_from, glyph)
end
function dgn.glyphs_connected(map, ...)
return dgn.places_connected(map, dgn.gly_point, dgn.points_connected, ...)
end
function dgn.orig_glyphs_connected(map, ...)
return dgn.places_connected(map, dgn.orig_gly_point,
dgn.points_connected, ...)
end
function dgn.orig_fn(map, fnx, ...)
local original = dgn.original_map(map)
if not original then
error("Can't find original map for map '" .. dgn.name(map) .. "'")
end
return fnx(original, ...)
end
function dgn.orig_gly_point(map, glyph)
return dgn.orig_fn(map, dgn.gly_point, glyph)
end
function dgn.orig_gly_points(map, glyph)
return dgn.orig_fn(map, dgn.gly_points, glyph)
end
function dgn.fnum(feat)
if type(feat) == 'string' then
return dgn.feature_number(feat)
else
return feat
end
end
function dgn.fnum_map(map)
local fnmap = { }
for k, v in pairs(map) do
fnmap[dgn.fnum(k)] = dgn.fnum(v)
end
return fnmap
end
-- Replaces all features matching
function dgn.replace_feat(rmap)
local cmap = dgn.fnum_map(rmap)
for x = 0, dgn.GXM - 1 do
for y = 0, dgn.GYM - 1 do
local grid = dgn.grid(x, y)
local repl = cmap[grid]
if repl then
dgn.terrain_changed(x, y, repl)
end
end
end
end
function dgn.adjacent_points(c, faccept)
local plist = { }
local compass = {
{ 0, -1 }, { 1, 0 }, { 0, 1 }, { -1, 0 },
{ -1, -1 }, { 1, -1 }, { 1, 1 }, { -1, 1 }
}
for _, cp in ipairs(compass) do
local p = { x = c.x + cp[1], y = c.y + cp[2] }
if dgn.in_bounds(p.x, p.y) and faccept(p) then
table.insert(plist, p)
end
end
return plist
end
function dgn.find_adjacent_point(c, fcondition, fpassable)
local mapped_points = { }
local function pstr(p)
return p.x .. "," .. p.y
end
local function seen(p)
return mapped_points[pstr(p)]
end
local function record(p, val)
mapped_points[pstr(p)] = val or 1
end
if not fpassable then
fpassable = function (p)
return dgn.is_passable(p.x, p.y)
end
end
local iter_points = { { }, { } }
local iter = 1
table.insert(iter_points[iter], c)
local function next_iter()
if iter == 1 then
return 2
else
return 1
end
end
local distance = 1
record(c, distance)
while #iter_points[iter] > 0 do
for _, p in ipairs(iter_points[iter]) do
if fcondition(p) then
return p
end
-- Add adjacent points to queue.
for _, np in ipairs(dgn.adjacent_points(p, fpassable)) do
if not seen(np) then
table.insert(iter_points[next_iter()], np)
record(np, distance + 1)
end
end
end
iter_points[iter] = { }
iter = next_iter()
distance = distance + 1
end
-- No suitable point.
return nil
end
function dgn.colour_map(fselect, colour)
for x = 0, dgn.GXM - 1 do
for y = 0, dgn.GYM - 1 do
if fselect(dgn.point(x, y)) then
dgn.colour_at(x, y, colour)
end
end
end
end
-- Returns true if fpred returns true for all squares in the rectangle
-- whose top-left corner is tl and bottom right corner is br (br.x >=
-- tl.x and br.y >= tl.y).
function dgn.rectangle_forall(tl, br, fpred)
for x = tl.x, br.x do
for y = tl.y, br.y do
if not fpred(dgn.point(x, y)) then
return false
end
end
end
return true
end
----------------------------------------------------------------------
-- Convenience functions for vaults.
-- Returns a marker table that sets the destination tag for that square,
-- usually used to set a destination tag for a portal or a stair in a
-- portal vault.
function portal_stair_dst(dst)
return one_way_stair { dst = dst }
end
-- Common initialisation for portal vaults.
function portal_vault(e, tag)
if tag then
e.tags(tag)
end
e.orient("encompass")
end
-- Set all stone downstairs in this vault to go to the tag 'next'.
function portal_next(e, next)
for _, feat in ipairs({ "]", ")", "}" }) do
e.lua_marker(feat, portal_stair_dst(next))
end
end
|