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
|
/*
* File: los.h
* Summary: Line-of-sight algorithm.
*/
#ifndef LOS_H
#define LOS_H
#include "externs.h"
#include "losparam.h"
#define EPSILON_VALUE 0.00001
bool double_is_zero(const double x);
void setLOSRadius(int newLR);
int get_los_radius_squared(); // XXX
struct ray_def;
bool find_ray(const coord_def& source, const coord_def& target,
ray_def& ray, bool cycle = false, bool ignore_solid = false);
void fallback_ray(const coord_def& source, const coord_def& target,
ray_def& ray);
int num_feats_between(const coord_def& source, const coord_def& target,
dungeon_feature_type min_feat,
dungeon_feature_type max_feat,
bool exclude_endpoints = true,
bool just_check = false);
bool cell_see_cell(const coord_def& p1, const coord_def& p2);
void clear_rays_on_exit();
void losight(env_show_grid& sh, const los_param& dat);
void calc_show_los();
bool see_grid( const env_show_grid &show,
const coord_def &c,
const coord_def &pos );
bool see_grid(const coord_def &p);
bool see_grid_no_trans( const coord_def &p );
bool trans_wall_blocking( const coord_def &p );
inline bool see_grid( int grx, int gry )
{
return see_grid(coord_def(grx, gry));
}
inline bool see_grid_no_trans(int x, int y)
{
return see_grid_no_trans(coord_def(x, y));
}
inline bool trans_wall_blocking(int x, int y)
{
return trans_wall_blocking(coord_def(x, y));
}
#endif
|
