summaryrefslogtreecommitdiff
path: root/src/map/path.c
diff options
context:
space:
mode:
authorultramage <ultramage@54d463be-8e91-2dee-dedb-b68131a5f0ec>2007-05-19 15:50:41 +0000
committerultramage <ultramage@54d463be-8e91-2dee-dedb-b68131a5f0ec>2007-05-19 15:50:41 +0000
commitb9804183841afd5381069796096a154edb5b9f53 (patch)
tree95e6f70d9ecd43e727d0defe1b02a818bc191169 /src/map/path.c
parent3bd682b3cb3507c8a57fa6930475808981fd0663 (diff)
downloadhercules-b9804183841afd5381069796096a154edb5b9f53.tar.gz
hercules-b9804183841afd5381069796096a154edb5b9f53.tar.bz2
hercules-b9804183841afd5381069796096a154edb5b9f53.tar.xz
hercules-b9804183841afd5381069796096a154edb5b9f53.zip
Reformatting @_@
git-svn-id: https://rathena.svn.sourceforge.net/svnroot/rathena/trunk@10581 54d463be-8e91-2dee-dedb-b68131a5f0ec
Diffstat (limited to 'src/map/path.c')
-rw-r--r--src/map/path.c40
1 files changed, 12 insertions, 28 deletions
diff --git a/src/map/path.c b/src/map/path.c
index 79200a877..d79238b87 100644
--- a/src/map/path.c
+++ b/src/map/path.c
@@ -32,8 +32,7 @@ const char walk_choices [3][3] =
/*==========================================
* 経路探索補助heap push
- *------------------------------------------
- */
+ *------------------------------------------*/
static void push_heap_path(int *heap,struct tmp_path *tp,int index)
{
int i,h;
@@ -50,8 +49,7 @@ static void push_heap_path(int *heap,struct tmp_path *tp,int index)
/*==========================================
* 経路探索補助heap update
* costが減ったので根の方へ移動
- *------------------------------------------
- */
+ *------------------------------------------*/
static void update_heap_path(int *heap,struct tmp_path *tp,int index)
{
int i,h;
@@ -72,8 +70,7 @@ static void update_heap_path(int *heap,struct tmp_path *tp,int index)
/*==========================================
* 経路探索補助heap pop
- *------------------------------------------
- */
+ *------------------------------------------*/
static int pop_heap_path(int *heap,struct tmp_path *tp)
{
int i,h,k;
@@ -104,8 +101,7 @@ static int pop_heap_path(int *heap,struct tmp_path *tp)
/*==========================================
* 現在の点のcost計算
- *------------------------------------------
- */
+ *------------------------------------------*/
static int calc_cost(struct tmp_path *p,int x1,int y1)
{
int xd,yd;
@@ -119,8 +115,7 @@ static int calc_cost(struct tmp_path *p,int x1,int y1)
/*==========================================
* 必要ならpathを追加/修正する
- *------------------------------------------
- */
+ *------------------------------------------*/
static int add_path(int *heap,struct tmp_path *tp,int x,int y,int dist,int before,int cost)
{
int i;
@@ -159,8 +154,7 @@ static int add_path(int *heap,struct tmp_path *tp,int x,int y,int dist,int befor
/*==========================================
* (x,y)が移動不可能地帯かどうか
* flag 0x10000 遠距離攻撃判定
- *------------------------------------------
- */
+ *------------------------------------------*/
static int can_place(struct map_data *m,int x,int y,int flag)
{
if(map_getcellp(m,x,y,CELL_CHKPASS))
@@ -177,8 +171,7 @@ static int can_place(struct map_data *m,int x,int y,int flag)
/*==========================================
* (x0,y0)から(x1,y1)へ1歩で移動可能か計算
- *------------------------------------------
- */
+ *------------------------------------------*/
static int can_move(struct map_data *m,int x0,int y0,int x1,int y1,int flag)
{
if(x1<0 || y1<0 || x1>=m->xs || y1>=m->ys)
@@ -202,8 +195,7 @@ static int can_move(struct map_data *m,int x0,int y0,int x1,int y1,int flag)
/*==========================================
* (x0,y0)から(dx,dy)方向へcountセル分
* 吹き飛ばしたあとの座標を所得
- *------------------------------------------
- */
+ *------------------------------------------*/
int path_blownpos(int m,int x0,int y0,int dx,int dy,int count)
{
struct map_data *md;
@@ -243,8 +235,7 @@ int path_blownpos(int m,int x0,int y0,int dx,int dy,int count)
/*==========================================
* 遠距離攻撃が可能かどうかを返す
- *------------------------------------------
- */
+ *------------------------------------------*/
int path_search_long_real(struct shootpath_data *spd,int m,int x0,int y0,int x1,int y1,cell_t flag)
{
int dx, dy;
@@ -312,9 +303,7 @@ int path_search_long_real(struct shootpath_data *spd,int m,int x0,int y0,int x1,
/*==========================================
* path探索 (x0,y0)->(x1,y1)
- *------------------------------------------
- */
-
+ *------------------------------------------*/
int path_search_real(struct walkpath_data *wpd,int m,int x0,int y0,int x1,int y1,int flag,cell_t flag2)
{
int heap[MAX_HEAP+1];
@@ -483,12 +472,8 @@ int path_search_real(struct walkpath_data *wpd,int m,int x0,int y0,int x1,int y1
}
/*==========================================
-
* path探索 (x0,y0)->(x1,y1)
-
- *------------------------------------------
-
- */
+ *------------------------------------------*/
#ifdef PATH_STANDALONETEST
char gat[64][64]={
@@ -502,8 +487,7 @@ struct map_data map[1];
/*==========================================
* 経路探索ルーチン単体テスト用main関数
- *------------------------------------------
- */
+ *------------------------------------------*/
void main(int argc,char *argv[])
{
struct walkpath_data wpd;