}
-
-
-
-
/*
* Hack -- allow quick "cycling" through the legal directions
*/
-static byte cycle[] =
-{ 1, 2, 3, 6, 9, 8, 7, 4, 1, 2, 3, 6, 9, 8, 7, 4, 1 };
+static byte cycle[] = { 1, 2, 3, 6, 9, 8, 7, 4, 1, 2, 3, 6, 9, 8, 7, 4, 1 };
/*
* Hack -- map each direction into the "middle" of the "cycle[]" array
*/
-static byte chome[] =
-{ 0, 8, 9, 10, 7, 0, 11, 6, 5, 4 };
+static byte chome[] = { 0, 8, 9, 10, 7, 0, 11, 6, 5, 4 };
/*
* The direction we are running
static bool find_breakright;
static bool find_breakleft;
-
-
/*!
* @brief ダッシュ処理の導入 /
* Initialize the running algorithm for a new direction.
*/
static void run_init(DIRECTION dir)
{
- int row, col, deepleft, deepright;
- int i, shortleft, shortright;
-
+ int row, col, deepleft, deepright;
+ int i, shortleft, shortright;
/* Save the direction */
find_current = dir;
*/
static bool run_test(void)
{
- int prev_dir, new_dir, check_dir = 0;
- int row, col;
- int i, max, inv;
- int option = 0, option2 = 0;
- cave_type *c_ptr;
+ DIRECTION prev_dir, new_dir, check_dir = 0;
+ int row, col;
+ int i, max, inv;
+ int option = 0, option2 = 0;
+ cave_type *c_ptr;
FEAT_IDX feat;
feature_type *f_ptr;
*/
static DIRECTION travel_test(DIRECTION prev_dir)
{
- int new_dir = 0;
+ DIRECTION new_dir = 0;
int i, max;
const cave_type *c_ptr;
int cost;
DIRECTION dir = cycle[chome[prev_dir] + i];
/* New location */
- int row = p_ptr->y + ddy[dir];
- int col = p_ptr->x + ddx[dir];
+ POSITION row = p_ptr->y + ddy[dir];
+ POSITION col = p_ptr->x + ddx[dir];
/* Access grid */
c_ptr = &cave[row][col];