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
|
/*
* File: flood_find.h
* Summary: flood_find template
*/
#ifndef FLOOD_FIND_H
#define FLOOD_FIND_H
#include "terrain.h"
#include "travel.h"
// You can't forward declare typedefs, so do this instead.
class map_mask : public FixedArray<unsigned short, GXM, GYM> {} ;
extern map_mask dgn_Map_Mask;
template <typename fgrd, typename bound_check>
class flood_find : public travel_pathfind
{
public:
flood_find(const fgrd &f, const bound_check &bc);
void add_feat(int feat);
void add_point(const coord_def &pos);
coord_def find_first_from(const coord_def &c, const map_mask &vlts);
bool points_connected_from(const coord_def &start);
bool any_point_connected_from(const coord_def &start);
bool has_exit_from(const coord_def &start);
bool did_leave_vault() const { return left_vault; }
protected:
bool path_flood(const coord_def &c, const coord_def &dc);
protected:
bool point_hunt, want_exit;
bool needed_features[NUM_FEATURES];
std::vector<coord_def> needed_points;
bool left_vault;
const map_mask *vaults;
const fgrd &fgrid;
const bound_check &bcheck;
};
template <typename fgrd, typename bound_check>
flood_find<fgrd, bound_check>::flood_find(const fgrd &f, const bound_check &bc)
: travel_pathfind(), point_hunt(false), want_exit(false),
needed_features(), needed_points(), left_vault(true), vaults(NULL),
fgrid(f), bcheck(bc)
{
memset(needed_features, false, sizeof needed_features);
}
template <typename fgrd, typename bound_check>
void flood_find<fgrd, bound_check>::add_feat(int feat)
{
if (feat >= 0 && feat < NUM_FEATURES)
needed_features[feat] = true;
}
template <typename fgrd, typename bound_check>
coord_def
flood_find<fgrd, bound_check>::find_first_from(
const coord_def &c,
const map_mask &vlts)
{
set_floodseed(c);
vaults = &vlts;
return pathfind(RMODE_EXPLORE);
}
template <typename fgrd, typename bound_check>
void flood_find<fgrd, bound_check>::add_point(const coord_def &c)
{
needed_points.push_back(c);
}
template <typename fgrd, typename bound_check>
bool flood_find<fgrd, bound_check>::points_connected_from(
const coord_def &sp)
{
if (needed_points.empty())
return (true);
set_floodseed(sp);
pathfind(RMODE_EXPLORE);
return (needed_points.empty());
}
template <typename fgrd, typename bound_check>
bool flood_find<fgrd, bound_check>::any_point_connected_from(
const coord_def &sp)
{
if (needed_points.empty())
return (true);
set_floodseed(sp);
const size_t sz = needed_points.size();
pathfind(RMODE_EXPLORE);
return (needed_points.size() < sz);
}
template <typename fgrd, typename bound_check>
bool flood_find<fgrd, bound_check>::has_exit_from(
const coord_def &sp)
{
want_exit = true;
set_floodseed(sp);
return (pathfind(RMODE_EXPLORE) == coord_def(-1, -1));
}
template <typename fgrd, typename bound_check>
bool flood_find<fgrd, bound_check>::path_flood(
const coord_def &c,
const coord_def &dc)
{
if (!bcheck(dc))
{
if (want_exit)
{
greedy_dist = 100;
greedy_place = coord_def(-1, -1);
return (true);
}
return (false);
}
if (!needed_points.empty())
{
std::vector<coord_def>::iterator i =
std::find(needed_points.begin(), needed_points.end(), dc);
if (i != needed_points.end())
{
needed_points.erase(i);
if (needed_points.empty())
return (true);
}
}
const dungeon_feature_type feat = fgrid(dc);
if (feat == NUM_FEATURES)
{
if (want_exit)
{
greedy_dist = 100;
greedy_place = coord_def(-1, -1);
return (true);
}
return (false);
}
if (needed_features[ feat ])
{
unexplored_place = dc;
unexplored_dist = traveled_distance;
return (true);
}
if (!feat_is_traversable(feat)
&& feat != DNGN_SECRET_DOOR
&& !feat_is_trap(feat))
{
return (false);
}
if (!left_vault && vaults && !(*vaults)[dc.x][dc.y])
left_vault = true;
good_square(dc);
return (false);
}
#endif
|
