You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
42 lines
1.1 KiB
42 lines
1.1 KiB
/** |
|
* @file path.h |
|
* |
|
* Interface of the path finding algorithms. |
|
*/ |
|
#pragma once |
|
|
|
namespace devilution { |
|
|
|
#define MAX_PATH_LENGTH 25 |
|
|
|
struct PATHNODE { |
|
Uint8 f; |
|
Uint8 h; |
|
Uint8 g; |
|
int x; |
|
int y; |
|
struct PATHNODE *Parent; |
|
struct PATHNODE *Child[8]; |
|
struct PATHNODE *NextNode; |
|
}; |
|
|
|
int FindPath(bool (*PosOk)(int, int, int), int PosOkArg, int sx, int sy, int dx, int dy, Sint8 path[MAX_PATH_LENGTH]); |
|
int path_get_h_cost(int sx, int sy, int dx, int dy); |
|
PATHNODE *GetNextPath(); |
|
bool path_solid_pieces(PATHNODE *pPath, int dx, int dy); |
|
bool path_get_path(bool (*PosOk)(int, int, int), int PosOkArg, PATHNODE *pPath, int x, int y); |
|
bool path_parent_path(PATHNODE *pPath, int dx, int dy, int sx, int sy); |
|
PATHNODE *path_get_node1(int dx, int dy); |
|
PATHNODE *path_get_node2(int dx, int dy); |
|
void path_next_node(PATHNODE *pPath); |
|
void path_set_coords(PATHNODE *pPath); |
|
void path_push_active_step(PATHNODE *pPath); |
|
PATHNODE *path_pop_active_step(); |
|
PATHNODE *path_new_step(); |
|
|
|
/* rdata */ |
|
|
|
extern const char pathxdir[8]; |
|
extern const char pathydir[8]; |
|
|
|
}
|
|
|