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
|
/**
* @file
* @brief Travel and exclusions.
**/
#include "AppHdr.h"
#include "l_libs.h"
#include "l_defs.h"
#include "branch.h"
#include "cluautil.h"
#include "coord.h"
#include "exclude.h"
#include "player.h"
#include "terrain.h"
#include "travel.h"
LUAFN(l_set_exclude)
{
coord_def s;
s.x = luaL_checkint(ls, 1);
s.y = luaL_checkint(ls, 2);
const coord_def p = player2grid(s);
if (!in_bounds(p))
return 0;
int r = LOS_RADIUS;
if (lua_gettop(ls) > 2)
r = luaL_checkint(ls, 3);
set_exclude(p, r);
return 0;
}
LUAFN(l_del_exclude)
{
coord_def s;
s.x = luaL_checkint(ls, 1);
s.y = luaL_checkint(ls, 2);
const coord_def p = player2grid(s);
if (!in_bounds(p))
return 0;
del_exclude(p);
return 0;
}
LUAFN(l_feature_is_traversable)
{
const string &name = luaL_checkstring(ls, 1);
const dungeon_feature_type feat = dungeon_feature_by_name(name);
PLUARET(boolean, feat_is_traversable_now(feat));
}
LUAFN(l_find_deepest_explored)
{
const string &branch = luaL_checkstring(ls, 1);
const level_id lid(str_to_branch(branch), 1);
if (lid.branch == NUM_BRANCHES)
luaL_error(ls, "Bad branch name: '%s'", branch.c_str());
if (!is_known_branch_id(lid.branch))
PLUARET(number, 0);
PLUARET(number, find_deepest_explored(lid).depth);
}
static const struct luaL_reg travel_lib[] =
{
{ "set_exclude", l_set_exclude },
{ "del_exclude", l_del_exclude },
{ "feature_traversable", l_feature_is_traversable },
{ "find_deepest_explored", l_find_deepest_explored },
{ NULL, NULL }
};
void cluaopen_travel(lua_State *ls)
{
luaL_openlib(ls, "travel", travel_lib, 0);
}
|
