#include "world.h"
#include "player-effects.h"
#include "object.h"
-#include "object-hook.h"
#include "artifact.h"
-#include "objectkind.h"
+#include "object/object-kind.h"
#include "trap.h"
/*
*/
saved_floor_type saved_floors[MAX_SAVED_FLOORS];
+/*
+ * Grid based version of "cave_empty_bold()"
+ */
+bool is_cave_empty_grid(player_type *player_ptr, grid_type *g_ptr)
+{
+ bool is_empty_grid = cave_have_flag_grid(g_ptr, FF_PLACE);
+ is_empty_grid &= g_ptr->m_idx == 0;
+ is_empty_grid &= !player_grid(player_ptr, g_ptr);
+ return is_empty_grid;
+}
+
+
+bool pattern_tile(floor_type *floor_ptr, POSITION y, POSITION x)
+{
+ return cave_have_flag_bold(floor_ptr, y, x, FF_PATTERN);
+}
+
+
+/*
+ * Determine if a "legal" grid is an "empty" floor grid
+ * Determine if monsters are allowed to move into a grid
+ *
+ * Line 1 -- forbid non-placement grids
+ * Line 2 -- forbid normal monsters
+ * Line 3 -- forbid the player
+ */
+bool is_cave_empty_bold(player_type *player_ptr, POSITION y, POSITION x)
+{
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ bool is_empty_grid = cave_have_flag_bold(floor_ptr, y, x, FF_PLACE);
+ is_empty_grid &= !(floor_ptr->grid_array[y][x].m_idx);
+ is_empty_grid &= !player_bold(player_ptr, y, x);
+ return is_empty_grid;
+}
+
+
+/*
+ * Determine if a "legal" grid is an "empty" floor grid
+ * Determine if monster generation is allowed in a grid
+ *
+ * Line 1 -- forbid non-empty grids
+ * Line 2 -- forbid trees while dungeon generation
+ */
+bool is_cave_empty_bold2(player_type *player_ptr, POSITION y, POSITION x)
+{
+ bool is_empty_grid = is_cave_empty_bold(player_ptr, y, x);
+ is_empty_grid &= current_world_ptr->character_dungeon || !cave_have_flag_bold(player_ptr->current_floor_ptr, y, x, FF_TREE);
+ return is_empty_grid;
+}
+
+
/*!
* @brief 鍵のかかったドアを配置する
+* @param player_ptr プレーヤーへの参照ポインタ
* @param y 配置したいフロアのY座標
* @param x 配置したいフロアのX座標
* @return なし
*/
-void place_locked_door(floor_type *floor_ptr, POSITION y, POSITION x)
+void place_locked_door(player_type *player_ptr, POSITION y, POSITION x)
{
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
if (d_info[floor_ptr->dungeon_idx].flags1 & DF1_NO_DOORS)
{
- place_floor_bold(floor_ptr, y, x);
- }
- else
- {
- set_cave_feat(floor_ptr, y, x, feat_locked_door_random((d_info[p_ptr->dungeon_idx].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR));
- floor_ptr->grid_array[y][x].info &= ~(CAVE_FLOOR);
- delete_monster(y, x);
+ place_bold(player_ptr, y, x, GB_FLOOR);
+ return;
}
+
+ set_cave_feat(floor_ptr, y, x, feat_locked_door_random((d_info[player_ptr->dungeon_idx].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR));
+ floor_ptr->grid_array[y][x].info &= ~(CAVE_FLOOR);
+ delete_monster(player_ptr, y, x);
}
/*!
* @brief 隠しドアを配置する
+* @param player_ptr プレーヤーへの参照ポインタ
* @param y 配置したいフロアのY座標
* @param x 配置したいフロアのX座標
* @param type DOOR_DEFAULT / DOOR_DOOR / DOOR_GLASS_DOOR / DOOR_CURTAIN のいずれか
* @return なし
*/
-void place_secret_door(floor_type *floor_ptr, POSITION y, POSITION x, int type)
+void place_secret_door(player_type *player_ptr, POSITION y, POSITION x, int type)
{
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
if (d_info[floor_ptr->dungeon_idx].flags1 & DF1_NO_DOORS)
{
- place_floor_bold(floor_ptr, y, x);
+ place_bold(player_ptr, y, x, GB_FLOOR);
+ return;
}
- else
- {
- grid_type *g_ptr = &floor_ptr->grid_array[y][x];
-
- if (type == DOOR_DEFAULT)
- {
- type = ((d_info[floor_ptr->dungeon_idx].flags1 & DF1_CURTAIN) &&
- one_in_((d_info[floor_ptr->dungeon_idx].flags1 & DF1_NO_CAVE) ? 16 : 256)) ? DOOR_CURTAIN :
- ((d_info[floor_ptr->dungeon_idx].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR);
- }
- /* Create secret door */
- place_closed_door(floor_ptr, y, x, type);
+ if (type == DOOR_DEFAULT)
+ {
+ type = ((d_info[floor_ptr->dungeon_idx].flags1 & DF1_CURTAIN) &&
+ one_in_((d_info[floor_ptr->dungeon_idx].flags1 & DF1_NO_CAVE) ? 16 : 256)) ? DOOR_CURTAIN :
+ ((d_info[floor_ptr->dungeon_idx].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR);
+ }
- if (type != DOOR_CURTAIN)
+ place_closed_door(player_ptr, y, x, type);
+ grid_type *g_ptr = &floor_ptr->grid_array[y][x];
+ if (type != DOOR_CURTAIN)
+ {
+ g_ptr->mimic = feat_wall_inner;
+ if (feat_supports_los(g_ptr->mimic) && !feat_supports_los(g_ptr->feat))
{
- /* Hide by inner wall because this is used in rooms only */
- g_ptr->mimic = feat_wall_inner;
-
- /* Floor type terrain cannot hide a door */
- if (feat_supports_los(g_ptr->mimic) && !feat_supports_los(g_ptr->feat))
+ if (have_flag(f_info[g_ptr->mimic].flags, FF_MOVE) || have_flag(f_info[g_ptr->mimic].flags, FF_CAN_FLY))
{
- if (have_flag(f_info[g_ptr->mimic].flags, FF_MOVE) || have_flag(f_info[g_ptr->mimic].flags, FF_CAN_FLY))
- {
- g_ptr->feat = one_in_(2) ? g_ptr->mimic : feat_ground_type[randint0(100)];
- }
- g_ptr->mimic = 0;
+ g_ptr->feat = one_in_(2) ? g_ptr->mimic : feat_ground_type[randint0(100)];
}
- }
- g_ptr->info &= ~(CAVE_FLOOR);
- delete_monster(y, x);
+ g_ptr->mimic = 0;
+ }
}
+
+ g_ptr->info &= ~(CAVE_FLOOR);
+ delete_monster(player_ptr, y, x);
}
static int scent_when = 0;
*/
void update_smell(floor_type *floor_ptr, player_type *subject_ptr)
{
- POSITION i, j;
- POSITION y, x;
-
/* Create a table that controls the spread of scent */
const int scent_adjust[5][5] =
{
{ -1, 0, 0, 0,-1 },
};
- /* Loop the age and adjust scent values when necessary */
if (++scent_when == 254)
{
- /* Scan the entire dungeon */
- for (y = 0; y < floor_ptr->height; y++)
+ for (POSITION y = 0; y < floor_ptr->height; y++)
{
- for (x = 0; x < floor_ptr->width; x++)
+ for (POSITION x = 0; x < floor_ptr->width; x++)
{
int w = floor_ptr->grid_array[y][x].when;
floor_ptr->grid_array[y][x].when = (w > 128) ? (w - 128) : 0;
}
}
- /* Restart */
scent_when = 126;
}
-
- /* Lay down new scent */
- for (i = 0; i < 5; i++)
+ for (POSITION i = 0; i < 5; i++)
{
- for (j = 0; j < 5; j++)
+ for (POSITION j = 0; j < 5; j++)
{
grid_type *g_ptr;
-
- /* Translate table to map grids */
- y = i + subject_ptr->y - 2;
- x = j + subject_ptr->x - 2;
-
- /* Check Bounds */
+ POSITION y = i + subject_ptr->y - 2;
+ POSITION x = j + subject_ptr->x - 2;
if (!in_bounds(floor_ptr, y, x)) continue;
g_ptr = &floor_ptr->grid_array[y][x];
-
- /* Walls, water, and lava cannot hold scent. */
- if (!cave_have_flag_grid(g_ptr, FF_MOVE) && !is_closed_door(g_ptr->feat)) continue;
-
- /* Grid must not be blocked by walls from the character */
+ if (!cave_have_flag_grid(g_ptr, FF_MOVE) && !is_closed_door(subject_ptr, g_ptr->feat)) continue;
if (!player_has_los_bold(subject_ptr, y, x)) continue;
-
- /* Note grids that are too far away */
if (scent_adjust[i][j] == -1) continue;
- /* Mark the grid with new scent */
g_ptr->when = scent_when + scent_adjust[i][j];
}
}
*/
void forget_flow(floor_type *floor_ptr)
{
- POSITION x, y;
-
- /* Check the entire dungeon */
- for (y = 0; y < floor_ptr->height; y++)
+ for (POSITION y = 0; y < floor_ptr->height; y++)
{
- for (x = 0; x < floor_ptr->width; x++)
+ for (POSITION x = 0; x < floor_ptr->width; x++)
{
- /* Forget the old data */
floor_ptr->grid_array[y][x].dist = 0;
floor_ptr->grid_array[y][x].cost = 0;
floor_ptr->grid_array[y][x].when = 0;
}
}
+
/*
* Routine used by the random vault creators to add a door to a location
* Note that range checking has to be done in the calling routine.
*
* The doors must be INSIDE the allocated region.
*/
-void add_door(floor_type* floor_ptr, POSITION x, POSITION y)
+void add_door(player_type *player_ptr, POSITION x, POSITION y)
{
- /* Need to have a wall in the center square */
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
if (!is_outer_bold(floor_ptr, y, x)) return;
/* look at:
if (is_floor_bold(floor_ptr, y - 1, x) && is_floor_bold(floor_ptr, y + 1, x) &&
(is_outer_bold(floor_ptr, y, x - 1) && is_outer_bold(floor_ptr, y, x + 1)))
{
- /* secret door */
- place_secret_door(floor_ptr, y, x, DOOR_DEFAULT);
-
- /* set boundarys so don't get wide doors */
- place_solid_bold(y, x - 1);
- place_solid_bold(y, x + 1);
+ place_secret_door(player_ptr, y, x, DOOR_DEFAULT);
+ place_bold(player_ptr, y, x - 1, GB_SOLID);
+ place_bold(player_ptr, y, x + 1, GB_SOLID);
}
-
/* look at:
* x#x
* .#.
if (is_outer_bold(floor_ptr, y - 1, x) && is_outer_bold(floor_ptr, y + 1, x) &&
is_floor_bold(floor_ptr, y, x - 1) && is_floor_bold(floor_ptr, y, x + 1))
{
- /* secret door */
- place_secret_door(floor_ptr, y, x, DOOR_DEFAULT);
-
- /* set boundarys so don't get wide doors */
- place_solid_bold(y - 1, x);
- place_solid_bold(y + 1, x);
+ place_secret_door(player_ptr, y, x, DOOR_DEFAULT);
+ place_bold(player_ptr, y - 1, x, GB_SOLID);
+ place_bold(player_ptr, y + 1, x, GB_SOLID);
}
}
+
/*!
* @brief 所定の位置に上り階段か下り階段を配置する / Place an up/down staircase at given location
+ * @param player_ptr プレーヤーへの参照ポインタ
* @param y 配置を試みたいマスのY座標
* @param x 配置を試みたいマスのX座標
* @return なし
*/
-void place_random_stairs(floor_type *floor_ptr, POSITION y, POSITION x)
+void place_random_stairs(player_type *player_ptr, POSITION y, POSITION x)
{
bool up_stairs = TRUE;
bool down_stairs = TRUE;
grid_type *g_ptr;
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
g_ptr = &floor_ptr->grid_array[y][x];
if (!is_floor_grid(g_ptr) || g_ptr->o_idx) return;
if (!floor_ptr->dun_level) up_stairs = FALSE;
if (ironman_downward) up_stairs = FALSE;
- if (floor_ptr->dun_level >= d_info[p_ptr->dungeon_idx].maxdepth) down_stairs = FALSE;
- if (quest_number(floor_ptr->dun_level) && (floor_ptr->dun_level > 1)) down_stairs = FALSE;
+ if (floor_ptr->dun_level >= d_info[player_ptr->dungeon_idx].maxdepth) down_stairs = FALSE;
+ if (quest_number(player_ptr, floor_ptr->dun_level) && (floor_ptr->dun_level > 1)) down_stairs = FALSE;
- /* We can't place both */
if (down_stairs && up_stairs)
{
- /* Choose a staircase randomly */
if (randint0(100) < 50) up_stairs = FALSE;
else down_stairs = FALSE;
}
- /* Place the stairs */
if (up_stairs) set_cave_feat(floor_ptr, y, x, feat_up_stair);
else if (down_stairs) set_cave_feat(floor_ptr, y, x, feat_down_stair);
}
+
/*!
* @brief LOS(Line Of Sight / 視線が通っているか)の判定を行う。
+ * @param player_ptr プレーヤーへの参照ポインタ
* @param y1 始点のy座標
* @param x1 始点のx座標
* @param y2 終点のy座標
*\n
* Use the "update_view()" function to determine player line-of-sight.\n
*/
-bool los(floor_type *floor_ptr, POSITION y1, POSITION x1, POSITION y2, POSITION x2)
+bool los(player_type *player_ptr, POSITION y1, POSITION x1, POSITION y2, POSITION x2)
{
- /* Delta */
- POSITION dx, dy;
-
- /* Absolute */
- POSITION ax, ay;
-
- /* Signs */
- POSITION sx, sy;
-
- /* Fractions */
- POSITION qx, qy;
-
- /* Scanners */
- POSITION tx, ty;
-
- /* Scale factors */
- POSITION f1, f2;
-
- /* Slope, or 1/Slope, of LOS */
- POSITION m;
-
-
- /* Extract the offset */
- dy = y2 - y1;
- dx = x2 - x1;
-
- /* Extract the absolute offset */
- ay = ABS(dy);
- ax = ABS(dx);
-
-
- /* Handle adjacent (or identical) grids */
+ POSITION dy = y2 - y1;
+ POSITION dx = x2 - x1;
+ POSITION ay = ABS(dy);
+ POSITION ax = ABS(dx);
if ((ax < 2) && (ay < 2)) return TRUE;
-
- /* Paranoia -- require "safe" origin */
- /* if (!in_bounds(floor_ptr, y1, x1)) return FALSE; */
- /* if (!in_bounds(floor_ptr, y2, x2)) return FALSE; */
-
-
/* Directly South/North */
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ POSITION tx, ty;
if (!dx)
{
/* South -- check for walls */
}
}
- /* Assume los */
return TRUE;
}
+ POSITION sx = (dx < 0) ? -1 : 1;
+ POSITION sy = (dy < 0) ? -1 : 1;
- /* Extract some signs */
- sx = (dx < 0) ? -1 : 1;
- sy = (dy < 0) ? -1 : 1;
-
-
- /* Vertical "knights" */
if (ax == 1)
{
if (ay == 2)
if (cave_los_bold(floor_ptr, y1 + sy, x1)) return TRUE;
}
}
-
- /* Horizontal "knights" */
else if (ay == 1)
{
if (ax == 2)
}
}
-
- /* Calculate scale factor div 2 */
- f2 = (ax * ay);
-
- /* Calculate scale factor */
- f1 = f2 << 1;
-
-
- /* Travel horizontally */
+ POSITION f2 = (ax * ay);
+ POSITION f1 = f2 << 1;
+ POSITION qy;
+ POSITION m;
if (ax >= ay)
{
- /* Let m = dy / dx * 2 * (dy * dx) = 2 * dy * dy */
qy = ay * ay;
m = qy << 1;
-
tx = x1 + sx;
-
- /* Consider the special case where slope == 1. */
if (qy == f2)
{
ty = y1 + sy;
if (qy < f2)
{
tx += sx;
+ continue;
}
- else if (qy > f2)
+
+ if (qy > f2)
{
ty += sy;
if (!cave_los_bold(floor_ptr, ty, tx)) return FALSE;
qy -= f1;
tx += sx;
+ continue;
}
- else
- {
- ty += sy;
- qy -= f1;
- tx += sx;
- }
+
+ ty += sy;
+ qy -= f1;
+ tx += sx;
}
+
+ return TRUE;
}
/* Travel vertically */
+ POSITION qx = ax * ax;
+ m = qx << 1;
+ ty = y1 + sy;
+ if (qx == f2)
+ {
+ tx = x1 + sx;
+ qx -= f1;
+ }
else
{
- /* Let m = dx / dy * 2 * (dx * dy) = 2 * dx * dx */
- qx = ax * ax;
- m = qx << 1;
+ tx = x1;
+ }
- ty = y1 + sy;
+ /* Note (below) the case (qx == f2), where */
+ /* the LOS exactly meets the corner of a tile. */
+ while (y2 - ty)
+ {
+ if (!cave_los_bold(floor_ptr, ty, tx)) return FALSE;
- if (qx == f2)
- {
- tx = x1 + sx;
- qx -= f1;
- }
- else
+ qx += m;
+
+ if (qx < f2)
{
- tx = x1;
+ ty += sy;
+ continue;
}
- /* Note (below) the case (qx == f2), where */
- /* the LOS exactly meets the corner of a tile. */
- while (y2 - ty)
+ if (qx > f2)
{
+ tx += sx;
if (!cave_los_bold(floor_ptr, ty, tx)) return FALSE;
-
- qx += m;
-
- if (qx < f2)
- {
- ty += sy;
- }
- else if (qx > f2)
- {
- tx += sx;
- if (!cave_los_bold(floor_ptr, ty, tx)) return FALSE;
- qx -= f1;
- ty += sy;
- }
- else
- {
- tx += sx;
- qx -= f1;
- ty += sy;
- }
+ qx -= f1;
+ ty += sy;
+ continue;
}
+
+ tx += sx;
+ qx -= f1;
+ ty += sy;
}
- /* Assume los */
return TRUE;
}
*
* This is slightly (but significantly) different from "los(y1,x1,y2,x2)".
*/
-bool projectable(floor_type *floor_ptr, POSITION y1, POSITION x1, POSITION y2, POSITION x2)
+bool projectable(player_type *player_ptr, POSITION y1, POSITION x1, POSITION y2, POSITION x2)
{
- POSITION y, x;
-
- int grid_n = 0;
u16b grid_g[512];
-
- /* Check the projection path */
- grid_n = project_path(grid_g, (project_length ? project_length : MAX_RANGE), y1, x1, y2, x2, 0);
-
- /* Identical grid */
+ int grid_n = project_path(player_ptr, grid_g, (project_length ? project_length : MAX_RANGE), y1, x1, y2, x2, 0);
if (!grid_n) return TRUE;
- /* Final grid */
- y = GRID_Y(grid_g[grid_n - 1]);
- x = GRID_X(grid_g[grid_n - 1]);
+ POSITION y = GRID_Y(grid_g[grid_n - 1]);
+ POSITION x = GRID_X(grid_g[grid_n - 1]);
+ if ((y != y2) || (x != x2)) return FALSE;
- /* May not end in an unrequested grid */
- if ((y != y2) || (x != x2)) return (FALSE);
-
- /* Assume okay */
- return (TRUE);
+ return TRUE;
}
/*!
* @brief 特殊な部屋地形向けにモンスターを配置する / Hack -- Place some sleeping monsters near the given location
+ * @param player_ptr プレーヤーへの参照ポインタ
* @param y1 モンスターを配置したいマスの中心Y座標
* @param x1 モンスターを配置したいマスの中心X座標
* @param num 配置したいモンスターの数
* @details
* Only really called by some of the "vault" routines.
*/
-void vault_monsters(floor_type *floor_ptr, POSITION y1, POSITION x1, int num)
+void vault_monsters(player_type *player_ptr, POSITION y1, POSITION x1, int num)
{
- int k, i;
- POSITION y, x;
- grid_type *g_ptr;
-
- /* Try to summon "num" monsters "near" the given location */
- for (k = 0; k < num; k++)
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ for (int k = 0; k < num; k++)
{
- /* Try nine locations */
- for (i = 0; i < 9; i++)
+ for (int i = 0; i < 9; i++)
{
int d = 1;
+ POSITION y, x;
+ scatter(player_ptr, &y, &x, y1, x1, d, 0);
+ grid_type *g_ptr;
+ g_ptr = &player_ptr->current_floor_ptr->grid_array[y][x];
+ if (!is_cave_empty_grid(player_ptr, g_ptr)) continue;
- /* Pick a nearby location */
- scatter(&y, &x, y1, x1, d, 0);
-
- /* Require "empty" floor grids */
- g_ptr = &floor_ptr->grid_array[y][x];
- if (!cave_empty_grid(g_ptr)) continue;
-
- /* Place the monster (allow groups) */
floor_ptr->monster_level = floor_ptr->base_level + 2;
- (void)place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
+ (void)place_monster(player_ptr, y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
floor_ptr->monster_level = floor_ptr->base_level;
}
}
/*!
* @brief 指定された座標が地震や階段生成の対象となるマスかを返す。 / Determine if a given location may be "destroyed"
+ * @param player_ptr プレーヤーへの参照ポインタ
* @param y y座標
* @param x x座標
* @return 各種の変更が可能ならTRUEを返す。
bool cave_valid_bold(floor_type *floor_ptr, POSITION y, POSITION x)
{
grid_type *g_ptr = &floor_ptr->grid_array[y][x];
- OBJECT_IDX this_o_idx, next_o_idx = 0;
-
- /* Forbid perma-grids */
- if (cave_perma_grid(g_ptr)) return (FALSE);
+ if (cave_perma_grid(g_ptr)) return FALSE;
- /* Check objects */
- for (this_o_idx = g_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
+ OBJECT_IDX next_o_idx = 0;
+ for (OBJECT_IDX this_o_idx = g_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
{
object_type *o_ptr;
o_ptr = &floor_ptr->o_list[this_o_idx];
next_o_idx = o_ptr->next_o_idx;
-
- /* Forbid artifact grids */
- if (object_is_artifact(o_ptr)) return (FALSE);
+ if (object_is_artifact(o_ptr)) return FALSE;
}
- /* Accept */
- return (TRUE);
+ return TRUE;
}
+
/*
* Change the "feat" flag for a grid, and notice/redraw the grid
*/
-void cave_set_feat(floor_type *floor_ptr, POSITION y, POSITION x, FEAT_IDX feat)
+void cave_set_feat(player_type *player_ptr, POSITION y, POSITION x, FEAT_IDX feat)
{
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
grid_type *g_ptr = &floor_ptr->grid_array[y][x];
feature_type *f_ptr = &f_info[feat];
- bool old_los, old_mirror;
-
if (!current_world_ptr->character_dungeon)
{
- /* Clear mimic type */
g_ptr->mimic = 0;
-
- /* Change the feature */
g_ptr->feat = feat;
-
- /* Hack -- glow the GLOW terrain */
- if (have_flag(f_ptr->flags, FF_GLOW) && !(d_info[p_ptr->dungeon_idx].flags1 & DF1_DARKNESS))
+ if (have_flag(f_ptr->flags, FF_GLOW) && !(d_info[floor_ptr->dungeon_idx].flags1 & DF1_DARKNESS))
{
- DIRECTION i;
- POSITION yy, xx;
-
- for (i = 0; i < 9; i++)
+ for (DIRECTION i = 0; i < 9; i++)
{
- yy = y + ddy_ddd[i];
- xx = x + ddx_ddd[i];
+ POSITION yy = y + ddy_ddd[i];
+ POSITION xx = x + ddx_ddd[i];
if (!in_bounds2(floor_ptr, yy, xx)) continue;
floor_ptr->grid_array[yy][xx].info |= CAVE_GLOW;
}
return;
}
- old_los = cave_have_flag_bold(y, x, FF_LOS);
- old_mirror = is_mirror_grid(g_ptr);
+ bool old_los = cave_have_flag_bold(floor_ptr, y, x, FF_LOS);
+ bool old_mirror = is_mirror_grid(g_ptr);
- /* Clear mimic type */
g_ptr->mimic = 0;
-
- /* Change the feature */
g_ptr->feat = feat;
-
- /* Remove flag for mirror/glyph */
g_ptr->info &= ~(CAVE_OBJECT);
-
- if (old_mirror && (d_info[p_ptr->dungeon_idx].flags1 & DF1_DARKNESS))
+ if (old_mirror && (d_info[floor_ptr->dungeon_idx].flags1 & DF1_DARKNESS))
{
g_ptr->info &= ~(CAVE_GLOW);
if (!view_torch_grids) g_ptr->info &= ~(CAVE_MARK);
- update_local_illumination(p_ptr, y, x);
+ update_local_illumination(player_ptr, y, x);
}
- /* Check for change to boring grid */
if (!have_flag(f_ptr->flags, FF_REMEMBER)) g_ptr->info &= ~(CAVE_MARK);
- if (g_ptr->m_idx) update_monster(p_ptr, g_ptr->m_idx, FALSE);
+ if (g_ptr->m_idx) update_monster(player_ptr, g_ptr->m_idx, FALSE);
- note_spot(y, x);
- lite_spot(y, x);
-
- /* Check if los has changed */
+ note_spot(player_ptr, y, x);
+ lite_spot(player_ptr, y, x);
if (old_los ^ have_flag(f_ptr->flags, FF_LOS))
{
#ifdef COMPLEX_WALL_ILLUMINATION /* COMPLEX_WALL_ILLUMINATION */
- update_local_illumination(p_ptr, y, x);
+ update_local_illumination(player_ptr, y, x);
#endif /* COMPLEX_WALL_ILLUMINATION */
- /* Update the visuals */
- p_ptr->update |= (PU_VIEW | PU_LITE | PU_MON_LITE | PU_MONSTERS);
+ player_ptr->update |= (PU_VIEW | PU_LITE | PU_MON_LITE | PU_MONSTERS);
}
- /* Hack -- glow the GLOW terrain */
- if (have_flag(f_ptr->flags, FF_GLOW) && !(d_info[p_ptr->dungeon_idx].flags1 & DF1_DARKNESS))
+ if (!have_flag(f_ptr->flags, FF_GLOW) || (d_info[player_ptr->dungeon_idx].flags1 & DF1_DARKNESS))
+ return;
+
+ for (DIRECTION i = 0; i < 9; i++)
{
- DIRECTION i;
- POSITION yy, xx;
+ POSITION yy = y + ddy_ddd[i];
+ POSITION xx = x + ddx_ddd[i];
+ if (!in_bounds2(floor_ptr, yy, xx)) continue;
+
grid_type *cc_ptr;
+ cc_ptr = &floor_ptr->grid_array[yy][xx];
+ cc_ptr->info |= CAVE_GLOW;
- for (i = 0; i < 9; i++)
+ if (player_has_los_grid(cc_ptr))
{
- yy = y + ddy_ddd[i];
- xx = x + ddx_ddd[i];
- if (!in_bounds2(floor_ptr, yy, xx)) continue;
- cc_ptr = &floor_ptr->grid_array[yy][xx];
- cc_ptr->info |= CAVE_GLOW;
-
- if (player_has_los_grid(cc_ptr))
- {
- if (cc_ptr->m_idx) update_monster(p_ptr, cc_ptr->m_idx, FALSE);
- note_spot(yy, xx);
- lite_spot(yy, xx);
- }
-
- update_local_illumination(p_ptr, yy, xx);
+ if (cc_ptr->m_idx) update_monster(player_ptr, cc_ptr->m_idx, FALSE);
+ note_spot(player_ptr, yy, xx);
+ lite_spot(player_ptr, yy, xx);
}
- if (p_ptr->special_defense & NINJA_S_STEALTH)
- {
- if (floor_ptr->grid_array[p_ptr->y][p_ptr->x].info & CAVE_GLOW) set_superstealth(p_ptr, FALSE);
- }
+ update_local_illumination(player_ptr, yy, xx);
+ }
+
+ if (player_ptr->special_defense & NINJA_S_STEALTH)
+ {
+ if (floor_ptr->grid_array[player_ptr->y][player_ptr->x].info & CAVE_GLOW) set_superstealth(player_ptr, FALSE);
}
}
/*!
* @brief 所定の位置にさまざまな状態や種類のドアを配置する / Place a random type of door at the given location
+ * @param player_ptr プレーヤーへの参照ポインタ
* @param y ドアの配置を試みたいマスのY座標
* @param x ドアの配置を試みたいマスのX座標
* @param room 部屋に接している場合向けのドア生成か否か
* @return なし
*/
-void place_random_door(floor_type *floor_ptr, POSITION y, POSITION x, bool room)
+void place_random_door(player_type *player_ptr, POSITION y, POSITION x, bool room)
{
- int tmp, type;
- FEAT_IDX feat = feat_none;
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
grid_type *g_ptr = &floor_ptr->grid_array[y][x];
-
- /* Initialize mimic info */
g_ptr->mimic = 0;
if (d_info[floor_ptr->dungeon_idx].flags1 & DF1_NO_DOORS)
{
- place_floor_bold(floor_ptr, y, x);
+ place_bold(player_ptr, y, x, GB_FLOOR);
return;
}
- type = ((d_info[floor_ptr->dungeon_idx].flags1 & DF1_CURTAIN) &&
+ int type = ((d_info[floor_ptr->dungeon_idx].flags1 & DF1_CURTAIN) &&
one_in_((d_info[floor_ptr->dungeon_idx].flags1 & DF1_NO_CAVE) ? 16 : 256)) ? DOOR_CURTAIN :
((d_info[floor_ptr->dungeon_idx].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR);
- /* Choose an object */
- tmp = randint0(1000);
-
- /* Open doors (300/1000) */
+ int tmp = randint0(1000);
+ FEAT_IDX feat = feat_none;
if (tmp < 300)
{
- /* Create open door */
feat = feat_door[type].open;
}
-
- /* Broken doors (100/1000) */
else if (tmp < 400)
{
- /* Create broken door */
feat = feat_door[type].broken;
}
-
- /* Secret doors (200/1000) */
else if (tmp < 600)
{
- /* Create secret door */
- place_closed_door(floor_ptr, y, x, type);
+ place_closed_door(player_ptr, y, x, type);
if (type != DOOR_CURTAIN)
{
- /* Hide. If on the edge of room, use outer wall. */
g_ptr->mimic = room ? feat_wall_outer : feat_wall_type[randint0(100)];
-
- /* Floor type terrain cannot hide a door */
if (feat_supports_los(g_ptr->mimic) && !feat_supports_los(g_ptr->feat))
{
if (have_flag(f_info[g_ptr->mimic].flags, FF_MOVE) || have_flag(f_info[g_ptr->mimic].flags, FF_CAN_FLY))
}
}
}
+ else
+ {
+ place_closed_door(player_ptr, y, x, type);
+ }
- /* Closed, locked, or stuck doors (400/1000) */
- else place_closed_door(floor_ptr, y, x, type);
+ if (tmp >= 400)
+ {
+ delete_monster(player_ptr, y, x);
+ return;
+ }
- if (tmp < 400)
+ if (feat != feat_none)
{
- if (feat != feat_none)
- {
- set_cave_feat(floor_ptr, y, x, feat);
- }
- else
- {
- place_floor_bold(floor_ptr, y, x);
- }
+ set_cave_feat(floor_ptr, y, x, feat);
+ }
+ else
+ {
+ place_bold(player_ptr, y, x, GB_FLOOR);
}
- delete_monster(y, x);
+ delete_monster(player_ptr, y, x);
}
-
/*!
* @brief グローバルオブジェクト配列を初期化する /
* Delete all the items when player leaves the level
*/
void wipe_o_list(floor_type *floor_ptr)
{
- int i;
-
- /* Delete the existing objects */
- for (i = 1; i < floor_ptr->o_max; i++)
+ for (int i = 1; i < floor_ptr->o_max; i++)
{
object_type *o_ptr = &floor_ptr->o_list[i];
-
if (!OBJECT_IS_VALID(o_ptr)) continue;
- /* Mega-Hack -- preserve artifacts */
if (!current_world_ptr->character_dungeon || preserve_mode)
{
- /* Hack -- Preserve unknown artifacts */
if (object_is_fixed_artifact(o_ptr) && !object_is_known(o_ptr))
{
- /* Mega-Hack -- Preserve the artifact */
a_info[o_ptr->name1].cur_num = 0;
}
}
{
monster_type *m_ptr;
m_ptr = &floor_ptr->m_list[o_ptr->held_m_idx];
-
- /* Hack -- see above */
m_ptr->hold_o_idx = 0;
+ object_wipe(o_ptr);
+ continue;
}
- /* Dungeon */
- else
- {
- grid_type *g_ptr;
-
- /* Access location */
- POSITION y = o_ptr->iy;
- POSITION x = o_ptr->ix;
-
- /* Access grid */
- g_ptr = &floor_ptr->grid_array[y][x];
+ grid_type *g_ptr;
+ POSITION y = o_ptr->iy;
+ POSITION x = o_ptr->ix;
- /* Hack -- see above */
- g_ptr->o_idx = 0;
- }
+ g_ptr = &floor_ptr->grid_array[y][x];
+ g_ptr->o_idx = 0;
object_wipe(o_ptr);
}
- /* Reset "floor_ptr->o_max" */
floor_ptr->o_max = 1;
-
- /* Reset "floor_ptr->o_cnt" */
floor_ptr->o_cnt = 0;
}
/*!
* @brief 所定の位置に各種の閉じたドアを配置する / Place a random type of normal door at the given location.
+ * @param player_ptr プレーヤーへの参照ポインタ
* @param y ドアの配置を試みたいマスのY座標
* @param x ドアの配置を試みたいマスのX座標
* @param type ドアの地形ID
* @return なし
*/
-void place_closed_door(floor_type *floor_ptr, POSITION y, POSITION x, int type)
+void place_closed_door(player_type *player_ptr, POSITION y, POSITION x, int type)
{
- int tmp;
- FEAT_IDX feat = feat_none;
-
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
if (d_info[floor_ptr->dungeon_idx].flags1 & DF1_NO_DOORS)
{
- place_floor_bold(floor_ptr, y, x);
+ place_bold(player_ptr, y, x, GB_FLOOR);
return;
}
- /* Choose an object */
- tmp = randint0(400);
-
- /* Closed doors (300/400) */
+ int tmp = randint0(400);
+ FEAT_IDX feat = feat_none;
if (tmp < 300)
{
/* Create closed door */
feat = feat_door[type].closed;
}
-
- /* Locked doors (99/400) */
else if (tmp < 399)
{
- /* Create locked door */
feat = feat_locked_door_random(type);
}
-
- /* Stuck doors (1/400) */
else
{
- /* Create jammed door */
feat = feat_jammed_door_random(type);
}
- if (feat != feat_none)
- {
- cave_set_feat(floor_ptr, y, x, feat);
-
- /* Now it is not floor */
- floor_ptr->grid_array[y][x].info &= ~(CAVE_MASK);
- }
- else
+ if (feat == feat_none)
{
- place_floor_bold(floor_ptr, y, x);
+ place_bold(player_ptr, y, x, GB_FLOOR);
+ return;
}
+
+ cave_set_feat(player_ptr, y, x, feat);
+ floor_ptr->grid_array[y][x].info &= ~(CAVE_MASK);
}
+
/*!
* @brief 特殊な部屋向けに各種アイテムを配置する(vault_trapのサブセット) / Place a trap with a given displacement of point
* @param y トラップを配置したいマスの中心Y座標
* @details
* Only really called by some of the "vault" routines.
*/
-void vault_trap_aux(floor_type *floor_ptr, POSITION y, POSITION x, POSITION yd, POSITION xd)
+void vault_trap_aux(player_type *player_ptr, POSITION y, POSITION x, POSITION yd, POSITION xd)
{
- int count = 0, y1 = y, x1 = x;
- int dummy = 0;
-
grid_type *g_ptr;
-
- /* Place traps */
- for (count = 0; count <= 5; count++)
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ int y1 = y, x1 = x;
+ int dummy = 0;
+ for (int count = 0; count <= 5; count++)
{
- /* Get a location */
while (dummy < SAFE_MAX_ATTEMPTS)
{
y1 = rand_spread(y, yd);
msg_print(_("警告！地下室のトラップを配置できません！", "Warning! Could not place vault trap!"));
}
- /* Require "naked" floor grids */
g_ptr = &floor_ptr->grid_array[y1][x1];
if (!is_floor_grid(g_ptr) || g_ptr->o_idx || g_ptr->m_idx) continue;
- /* Place the trap */
- place_trap(floor_ptr, y1, x1);
-
+ place_trap(player_ptr, y1, x1);
break;
}
}
+
/*!
* @brief 指定のマスが床系地形であるかを返す / Function that sees if a square is a floor. (Includes range checking.)
* @param x チェックするマスのX座標
*/
bool get_is_floor(floor_type *floor_ptr, POSITION x, POSITION y)
{
- if (!in_bounds(p_ptr->current_floor_ptr, y, x))
+ if (!in_bounds(floor_ptr, y, x))
+ {
+ return FALSE;
+ }
+
+ if (is_floor_bold(floor_ptr, y, x)) return TRUE;
+
+ return FALSE;
+}
+
+
+/*!
+* @brief 隣接4マスに存在する通路の数を返す / Count the number of "corridor" grids adjacent to the given grid.
+* @param y1 基準となるマスのY座標
+* @param x1 基準となるマスのX座標
+* @return 通路の数
+* @note Assumes "in_bounds(y1, x1)"
+* @details
+* XXX XXX This routine currently only counts actual "empty floor"\n
+* grids which are not in rooms. We might want to also count stairs,\n
+* open doors, closed doors, etc.
+*/
+static int next_to_corr(floor_type *floor_ptr, POSITION y1, POSITION x1)
+{
+ int k = 0;
+ for (int i = 0; i < 4; i++)
+ {
+ POSITION y = y1 + ddy_ddd[i];
+ POSITION x = x1 + ddx_ddd[i];
+ grid_type *g_ptr;
+ g_ptr = &floor_ptr->grid_array[y][x];
+
+ if (cave_have_flag_grid(g_ptr, FF_WALL)) continue;
+ if (!is_floor_grid(g_ptr)) continue;
+ if (g_ptr->info & (CAVE_ROOM)) continue;
+
+ k++;
+ }
+
+ return k;
+}
+
+/*!
+* @brief ドアを設置可能な地形かを返す / Determine if the given location is "between" two walls, and "next to" two corridor spaces.
+* @param y 判定を行いたいマスのY座標
+* @param x 判定を行いたいマスのX座標
+* @return ドアを設置可能ならばTRUEを返す
+* @note Assumes "in_bounds()"
+* @details
+* \n
+* Assumes "in_bounds()"\n
+*/
+static bool possible_doorway(floor_type *floor_ptr, POSITION y, POSITION x)
+{
+ if (next_to_corr(floor_ptr, y, x) < 2) return FALSE;
+
+ /* Check Vertical */
+ if (cave_have_flag_bold(floor_ptr, y - 1, x, FF_WALL) &&
+ cave_have_flag_bold(floor_ptr, y + 1, x, FF_WALL))
+ {
+ return TRUE;
+ }
+
+ /* Check Horizontal */
+ if (cave_have_flag_bold(floor_ptr, y, x - 1, FF_WALL) &&
+ cave_have_flag_bold(floor_ptr, y, x + 1, FF_WALL))
{
- /* Out of bounds */
- return (FALSE);
+ return TRUE;
}
- /* Do the real check */
- if (is_floor_bold(p_ptr->current_floor_ptr, y, x)) return (TRUE);
+ return FALSE;
+}
+
+
+/*!
+* @brief ドアの設置を試みる / Places door at y, x position if at least 2 walls found
+* @param player_ptr プレーヤーへの参照ポインタ
+* @param y 設置を行いたいマスのY座標
+* @param x 設置を行いたいマスのX座標
+* @return なし
+*/
+void try_door(player_type *player_ptr, POSITION y, POSITION x)
+{
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ if (!in_bounds(floor_ptr, y, x)) return;
+
+ if (cave_have_flag_bold(floor_ptr, y, x, FF_WALL)) return;
+ if (floor_ptr->grid_array[y][x].info & (CAVE_ROOM)) return;
- return (FALSE);
+ bool can_place_door = randint0(100) < dun_tun_jct;
+ can_place_door &= possible_doorway(floor_ptr, y, x);
+ can_place_door &= (d_info[player_ptr->dungeon_idx].flags1 & DF1_NO_DOORS) == 0;
+ if (can_place_door)
+ {
+ place_random_door(player_ptr, y, x, FALSE);
+ }
+}
+
+
+FEAT_IDX conv_dungeon_feat(floor_type *floor_ptr, FEAT_IDX newfeat)
+{
+ feature_type *f_ptr = &f_info[newfeat];
+ if (have_flag(f_ptr->flags, FF_CONVERT))
+ {
+ switch (f_ptr->subtype)
+ {
+ case CONVERT_TYPE_FLOOR:
+ return feat_ground_type[randint0(100)];
+ case CONVERT_TYPE_WALL:
+ return feat_wall_type[randint0(100)];
+ case CONVERT_TYPE_INNER:
+ return feat_wall_inner;
+ case CONVERT_TYPE_OUTER:
+ return feat_wall_outer;
+ case CONVERT_TYPE_SOLID:
+ return feat_wall_solid;
+ case CONVERT_TYPE_STREAM1:
+ return d_info[floor_ptr->dungeon_idx].stream1;
+ case CONVERT_TYPE_STREAM2:
+ return d_info[floor_ptr->dungeon_idx].stream2;
+ default:
+ return newfeat;
+ }
+ }
+ else return newfeat;
+}
+
+
+/*!
+ * @brief 特殊な部屋向けに各種アイテムを配置する / Create up to "num" objects near the given coordinates
+ * @param player_ptr プレーヤーへの参照ポインタ
+ * @param y 配置したい中心マスのY座標
+ * @param x 配置したい中心マスのX座標
+ * @param num 配置したい数
+ * @return なし
+ * @details
+ * Only really called by some of the "vault" routines.
+ */
+void vault_objects(player_type *player_ptr, POSITION y, POSITION x, int num)
+{
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ for (; num > 0; --num)
+ {
+ int j = y, k = x;
+ int dummy = 0;
+ for (int i = 0; i < 11; ++i)
+ {
+ while (dummy < SAFE_MAX_ATTEMPTS)
+ {
+ j = rand_spread(y, 2);
+ k = rand_spread(x, 3);
+ dummy++;
+ if (!in_bounds(floor_ptr, j, k)) continue;
+ break;
+ }
+
+ if (dummy >= SAFE_MAX_ATTEMPTS && cheat_room)
+ {
+ msg_print(_("警告！地下室のアイテムを配置できません！", "Warning! Could not place vault object!"));
+ }
+
+ grid_type *g_ptr;
+ g_ptr = &floor_ptr->grid_array[j][k];
+ if (!is_floor_grid(g_ptr) || g_ptr->o_idx) continue;
+
+ if (randint0(100) < 75)
+ {
+ place_object(player_ptr, j, k, 0L);
+ }
+ else
+ {
+ place_gold(player_ptr, j, k);
+ }
+
+ break;
+ }
+ }
+}
+
+
+/*!
+ * @brief 始点から終点への直線経路を返す /
+ * Determine the path taken by a projection.
+ * @param player_ptr プレーヤーへの参照ポインタ
+ * @param gp 経路座標リストを返す参照ポインタ
+ * @param range 距離
+ * @param y1 始点Y座標
+ * @param x1 始点X座標
+ * @param y2 終点Y座標
+ * @param x2 終点X座標
+ * @param flg フラグID
+ * @return リストの長さ
+ * @details
+ * <pre>
+ * The projection will always start from the grid (y1,x1), and will travel
+ * towards the grid (y2,x2), touching one grid per unit of distance along
+ * the major axis, and stopping when it enters the destination grid or a
+ * wall grid, or has travelled the maximum legal distance of "range".
+ *
+ * Note that "distance" in this function (as in the "update_view()" code)
+ * is defined as "MAX(dy,dx) + MIN(dy,dx)/2", which means that the player
+ * actually has an "octagon of projection" not a "circle of projection".
+ *
+ * The path grids are saved into the grid array pointed to by "gp", and
+ * there should be room for at least "range" grids in "gp". Note that
+ * due to the way in which distance is calculated, this function normally
+ * uses fewer than "range" grids for the projection path, so the result
+ * of this function should never be compared directly to "range". Note
+ * that the initial grid (y1,x1) is never saved into the grid array, not
+ * even if the initial grid is also the final grid.
+ *
+ * The "flg" flags can be used to modify the behavior of this function.
+ *
+ * In particular, the "PROJECT_STOP" and "PROJECT_THRU" flags have the same
+ * semantics as they do for the "project" function, namely, that the path
+ * will stop as soon as it hits a monster, or that the path will continue
+ * through the destination grid, respectively.
+ *
+ * The "PROJECT_JUMP" flag, which for the "project()" function means to
+ * start at a special grid (which makes no sense in this function), means
+ * that the path should be "angled" slightly if needed to avoid any wall
+ * grids, allowing the player to "target" any grid which is in "view".
+ * This flag is non-trivial and has not yet been implemented, but could
+ * perhaps make use of the "vinfo" array (above).
+ *
+ * This function returns the number of grids (if any) in the path. This
+ * function will return zero if and only if (y1,x1) and (y2,x2) are equal.
+ *
+ * This algorithm is similar to, but slightly different from, the one used
+ * by "update_view_los()", and very different from the one used by "los()".
+ * </pre>
+ */
+sint project_path(player_type *player_ptr, u16b *gp, POSITION range, POSITION y1, POSITION x1, POSITION y2, POSITION x2, BIT_FLAGS flg)
+{
+ if ((x1 == x2) && (y1 == y2)) return 0;
+
+ POSITION y, x;
+ POSITION ay, ax;
+ POSITION sy, sx;
+ int frac;
+ int m;
+
+ if (y2 < y1)
+ {
+ ay = (y1 - y2);
+ sy = -1;
+ }
+ else
+ {
+ ay = (y2 - y1);
+ sy = 1;
+ }
+
+ if (x2 < x1)
+ {
+ ax = (x1 - x2);
+ sx = -1;
+ }
+ else
+ {
+ ax = (x2 - x1);
+ sx = 1;
+ }
+
+ int half = (ay * ax);
+ int full = half << 1;
+
+ /* Vertical */
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ int n = 0;
+ int k = 0;
+ if (ay > ax)
+ {
+ m = ax * ax * 2;
+ y = y1 + sy;
+ x = x1;
+ frac = m;
+ if (frac > half)
+ {
+ x += sx;
+ frac -= full;
+ k++;
+ }
+
+ while (TRUE)
+ {
+ gp[n++] = GRID(y, x);
+ if ((n + (k >> 1)) >= range) break;
+
+ if (!(flg & (PROJECT_THRU)))
+ {
+ if ((x == x2) && (y == y2)) break;
+ }
+
+ if (flg & (PROJECT_DISI))
+ {
+ if ((n > 0) && cave_stop_disintegration(floor_ptr, y, x)) break;
+ }
+ else if (flg & (PROJECT_LOS))
+ {
+ if ((n > 0) && !cave_los_bold(floor_ptr, y, x)) break;
+ }
+ else if (!(flg & (PROJECT_PATH)))
+ {
+ if ((n > 0) && !cave_have_flag_bold(floor_ptr, y, x, FF_PROJECT)) break;
+ }
+
+ if (flg & (PROJECT_STOP))
+ {
+ if ((n > 0) &&
+ (player_bold(player_ptr, y, x) || floor_ptr->grid_array[y][x].m_idx != 0))
+ break;
+ }
+
+ if (!in_bounds(floor_ptr, y, x)) break;
+
+ if (m)
+ {
+ frac += m;
+ if (frac > half)
+ {
+ x += sx;
+ frac -= full;
+ k++;
+ }
+ }
+
+ y += sy;
+ }
+
+ return n;
+ }
+
+ /* Horizontal */
+ if (ax > ay)
+ {
+ m = ay * ay * 2;
+ y = y1;
+ x = x1 + sx;
+ frac = m;
+ if (frac > half)
+ {
+ y += sy;
+ frac -= full;
+ k++;
+ }
+
+ while (TRUE)
+ {
+ gp[n++] = GRID(y, x);
+ if ((n + (k >> 1)) >= range) break;
+
+ if (!(flg & (PROJECT_THRU)))
+ {
+ if ((x == x2) && (y == y2)) break;
+ }
+
+ if (flg & (PROJECT_DISI))
+ {
+ if ((n > 0) && cave_stop_disintegration(floor_ptr, y, x)) break;
+ }
+ else if (flg & (PROJECT_LOS))
+ {
+ if ((n > 0) && !cave_los_bold(floor_ptr, y, x)) break;
+ }
+ else if (!(flg & (PROJECT_PATH)))
+ {
+ if ((n > 0) && !cave_have_flag_bold(floor_ptr, y, x, FF_PROJECT)) break;
+ }
+
+ if (flg & (PROJECT_STOP))
+ {
+ if ((n > 0) &&
+ (player_bold(player_ptr, y, x) || floor_ptr->grid_array[y][x].m_idx != 0))
+ break;
+ }
+
+ if (!in_bounds(floor_ptr, y, x)) break;
+
+ if (m)
+ {
+ frac += m;
+ if (frac > half)
+ {
+ y += sy;
+ frac -= full;
+ k++;
+ }
+ }
+
+ x += sx;
+ }
+
+ return n;
+ }
+
+ y = y1 + sy;
+ x = x1 + sx;
+
+ while (TRUE)
+ {
+ gp[n++] = GRID(y, x);
+ if ((n + (n >> 1)) >= range) break;
+
+ if (!(flg & (PROJECT_THRU)))
+ {
+ if ((x == x2) && (y == y2)) break;
+ }
+
+ if (flg & (PROJECT_DISI))
+ {
+ if ((n > 0) && cave_stop_disintegration(floor_ptr, y, x)) break;
+ }
+ else if (flg & (PROJECT_LOS))
+ {
+ if ((n > 0) && !cave_los_bold(floor_ptr, y, x)) break;
+ }
+ else if (!(flg & (PROJECT_PATH)))
+ {
+ if ((n > 0) && !cave_have_flag_bold(floor_ptr, y, x, FF_PROJECT)) break;
+ }
+
+ if (flg & (PROJECT_STOP))
+ {
+ if ((n > 0) &&
+ (player_bold(player_ptr, y, x) || floor_ptr->grid_array[y][x].m_idx != 0))
+ break;
+ }
+
+ if (!in_bounds(floor_ptr, y, x)) break;
+
+ y += sy;
+ x += sx;
+ }
+
+ return n;
+}
+
+
+/*!
+ * @brief 指定のマスを床地形に変える / Set a square to be floor. (Includes range checking.)
+ * @param player_ptr プレーヤーへの参照ポインタ
+ * @param x 地形を変えたいマスのX座標
+ * @param y 地形を変えたいマスのY座標
+ * @return なし
+ */
+void set_floor(player_type *player_ptr, POSITION x, POSITION y)
+{
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ if (!in_bounds(floor_ptr, y, x))
+ {
+ return;
+ }
+
+ if (floor_ptr->grid_array[y][x].info & CAVE_ROOM)
+ {
+ return;
+ }
+
+ if (is_extra_bold(floor_ptr, y, x))
+ place_bold(player_ptr, y, x, GB_FLOOR);
+}
+
+
+/*!
+ * @brief フロアの指定位置に生成階に応じたベースアイテムの生成を行う。
+ * Attempt to place an object (normal or good/great) at the given location.
+ * @param owner_ptr プレーヤーへの参照ポインタ
+ * @param y 配置したいフロアのY座標
+ * @param x 配置したいフロアのX座標
+ * @param mode オプションフラグ
+ * @return 生成に成功したらTRUEを返す。
+ * @details
+ * This routine plays nasty games to generate the "special artifacts".\n
+ * This routine uses "object_level" for the "generation level".\n
+ * This routine requires a clean floor grid destination.\n
+ */
+void place_object(player_type *owner_ptr, POSITION y, POSITION x, BIT_FLAGS mode)
+{
+ floor_type *floor_ptr = owner_ptr->current_floor_ptr;
+ grid_type *g_ptr = &floor_ptr->grid_array[y][x];
+ object_type forge;
+ object_type *q_ptr;
+ if (!in_bounds(floor_ptr, y, x)) return;
+ if (!cave_drop_bold(floor_ptr, y, x)) return;
+ if (g_ptr->o_idx) return;
+
+ q_ptr = &forge;
+ object_wipe(q_ptr);
+ if (!make_object(owner_ptr, q_ptr, mode)) return;
+
+ OBJECT_IDX o_idx = o_pop(floor_ptr);
+ if (o_idx == 0)
+ {
+ if (object_is_fixed_artifact(q_ptr))
+ {
+ a_info[q_ptr->name1].cur_num = 0;
+ }
+
+ return;
+ }
+
+ object_type *o_ptr;
+ o_ptr = &floor_ptr->o_list[o_idx];
+ object_copy(o_ptr, q_ptr);
+
+ o_ptr->iy = y;
+ o_ptr->ix = x;
+ o_ptr->next_o_idx = g_ptr->o_idx;
+
+ g_ptr->o_idx = o_idx;
+ note_spot(owner_ptr, y, x);
+ lite_spot(owner_ptr, y, x);
+}
+
+
+/*!
+ * @brief フロアの指定位置に生成階に応じた財宝オブジェクトの生成を行う。
+ * Places a treasure (Gold or Gems) at given location
+ * @param player_ptr プレーヤーへの参照ポインタ
+ * @param y 配置したいフロアのY座標
+ * @param x 配置したいフロアのX座標
+ * @return 生成に成功したらTRUEを返す。
+ * @details
+ * The location must be a legal, clean, floor grid.
+ */
+void place_gold(player_type *player_ptr, POSITION y, POSITION x)
+{
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ grid_type *g_ptr = &floor_ptr->grid_array[y][x];
+ if (!in_bounds(floor_ptr, y, x)) return;
+ if (!cave_drop_bold(floor_ptr, y, x)) return;
+ if (g_ptr->o_idx) return;
+
+ object_type forge;
+ object_type *q_ptr;
+ q_ptr = &forge;
+ object_wipe(q_ptr);
+ if (!make_gold(floor_ptr, q_ptr)) return;
+
+ OBJECT_IDX o_idx = o_pop(floor_ptr);
+ if (o_idx == 0) return;
+
+ object_type *o_ptr;
+ o_ptr = &floor_ptr->o_list[o_idx];
+ object_copy(o_ptr, q_ptr);
+
+ o_ptr->iy = y;
+ o_ptr->ix = x;
+ o_ptr->next_o_idx = g_ptr->o_idx;
+
+ g_ptr->o_idx = o_idx;
+ note_spot(player_ptr, y, x);
+ lite_spot(player_ptr, y, x);
+}
+
+
+/*!
+ * @brief 指定位置に存在するモンスターを削除する / Delete the monster, if any, at a given location
+ * @param player_ptr プレーヤーへの参照ポインタ
+ * @param x 削除位置x座標
+ * @param y 削除位置y座標
+ * @return なし
+ */
+void delete_monster(player_type *player_ptr, POSITION y, POSITION x)
+{
+ grid_type *g_ptr;
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ if (!in_bounds(floor_ptr, y, x)) return;
+
+ g_ptr = &floor_ptr->grid_array[y][x];
+ if (g_ptr->m_idx) delete_monster_idx(player_ptr, g_ptr->m_idx);
+}
+
+
+/*!
+ * @brief グローバルオブジェクト配列に対し指定範囲のオブジェクトを整理してIDの若い順に寄せる /
+ * Move an object from index i1 to index i2 in the object list
+ * @param i1 整理したい配列の始点
+ * @param i2 整理したい配列の終点
+ * @return なし
+ */
+static void compact_objects_aux(floor_type *floor_ptr, OBJECT_IDX i1, OBJECT_IDX i2)
+{
+ if (i1 == i2) return;
+
+ object_type *o_ptr;
+ for (OBJECT_IDX i = 1; i < floor_ptr->o_max; i++)
+ {
+ o_ptr = &floor_ptr->o_list[i];
+ if (!o_ptr->k_idx) continue;
+
+ if (o_ptr->next_o_idx == i1)
+ {
+ o_ptr->next_o_idx = i2;
+ }
+ }
+
+ o_ptr = &floor_ptr->o_list[i1];
+
+ if (OBJECT_IS_HELD_MONSTER(o_ptr))
+ {
+ monster_type *m_ptr;
+ m_ptr = &floor_ptr->m_list[o_ptr->held_m_idx];
+ if (m_ptr->hold_o_idx == i1)
+ {
+ m_ptr->hold_o_idx = i2;
+ }
+ }
+ else
+ {
+ POSITION y = o_ptr->iy;
+ POSITION x = o_ptr->ix;
+ grid_type *g_ptr;
+ g_ptr = &floor_ptr->grid_array[y][x];
+
+ if (g_ptr->o_idx == i1)
+ {
+ g_ptr->o_idx = i2;
+ }
+ }
+
+ floor_ptr->o_list[i2] = floor_ptr->o_list[i1];
+ object_wipe(o_ptr);
+}
+
+
+/*!
+ * @brief グローバルオブジェクト配列から優先度の低いものを削除し、データを圧縮する。 /
+ * Compact and Reorder the object list.
+ * @param player_ptr プレーヤーへの参照ポインタ
+ * @param size 最低でも減らしたいオブジェクト数の水準
+ * @return なし
+ * @details
+ * （危険なので使用には注意すること）
+ * This function can be very dangerous, use with caution!\n
+ *\n
+ * When actually "compacting" objects, we base the saving throw on a\n
+ * combination of object level, distance from player, and current\n
+ * "desperation".\n
+ *\n
+ * After "compacting" (if needed), we "reorder" the objects into a more\n
+ * compact order, and we reset the allocation info, and the "live" array.\n
+ */
+void compact_objects(player_type *player_ptr, int size)
+{
+ object_type *o_ptr;
+ if (size)
+ {
+ msg_print(_("アイテム情報を圧縮しています...", "Compacting objects..."));
+ player_ptr->redraw |= (PR_MAP);
+ player_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
+ }
+
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ for (int num = 0, cnt = 1; num < size; cnt++)
+ {
+ int cur_lev = 5 * cnt;
+ int cur_dis = 5 * (20 - cnt);
+ for (OBJECT_IDX i = 1; i < floor_ptr->o_max; i++)
+ {
+ o_ptr = &floor_ptr->o_list[i];
+
+ if (!OBJECT_IS_VALID(o_ptr)) continue;
+ if (k_info[o_ptr->k_idx].level > cur_lev) continue;
+
+ POSITION y, x;
+ if (OBJECT_IS_HELD_MONSTER(o_ptr))
+ {
+ monster_type *m_ptr;
+ m_ptr = &floor_ptr->m_list[o_ptr->held_m_idx];
+ y = m_ptr->fy;
+ x = m_ptr->fx;
+
+ if (randint0(100) < 90) continue;
+ }
+ else
+ {
+ y = o_ptr->iy;
+ x = o_ptr->ix;
+ }
+
+ if ((cur_dis > 0) && (distance(player_ptr->y, player_ptr->x, y, x) < cur_dis)) continue;
+
+ int chance = 90;
+ if ((object_is_fixed_artifact(o_ptr) || o_ptr->art_name) &&
+ (cnt < 1000)) chance = 100;
+
+ if (randint0(100) < chance) continue;
+
+ delete_object_idx(player_ptr, i);
+ num++;
+ }
+ }
+
+ for (OBJECT_IDX i = floor_ptr->o_max - 1; i >= 1; i--)
+ {
+ o_ptr = &floor_ptr->o_list[i];
+ if (o_ptr->k_idx) continue;
+
+ compact_objects_aux(floor_ptr, floor_ptr->o_max - 1, i);
+ floor_ptr->o_max--;
+ }
+}
+
+
+/*!
+ * @brief 特殊な部屋向けに各種アイテムを配置する(メインルーチン) / Place some traps with a given displacement of given location
+ * @param player_ptr プレーヤーへの参照ポインタ
+ * @param y トラップを配置したいマスの中心Y座標
+ * @param x トラップを配置したいマスの中心X座標
+ * @param yd Y方向の配置分散マス数
+ * @param xd X方向の配置分散マス数
+ * @param num 配置したいトラップの数
+ * @return なし
+ * @details
+ * Only really called by some of the "vault" routines.
+ */
+void vault_traps(player_type *player_ptr, POSITION y, POSITION x, POSITION yd, POSITION xd, int num)
+{
+ for (int i = 0; i < num; i++)
+ {
+ vault_trap_aux(player_ptr, y, x, yd, xd);
+ }
+}
+
+
+/*
+ * Standard "find me a location" function
+ *
+ * Obtains a legal location within the given distance of the initial
+ * location, and with "los()" from the source to destination location.
+ *
+ * This function is often called from inside a loop which searches for
+ * locations while increasing the "d" distance.
+ *
+ * Currently the "m" parameter is unused.
+ */
+void scatter(player_type *player_ptr, POSITION *yp, POSITION *xp, POSITION y, POSITION x, POSITION d, BIT_FLAGS mode)
+{
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ POSITION nx, ny;
+ while (TRUE)
+ {
+ ny = rand_spread(y, d);
+ nx = rand_spread(x, d);
+
+ if (!in_bounds(floor_ptr, ny, nx)) continue;
+ if ((d > 1) && (distance(y, x, ny, nx) > d)) continue;
+ if (mode & PROJECT_LOS)
+ {
+ if (los(player_ptr, y, x, ny, nx)) break;
+ continue;
+ }
+
+ if (projectable(player_ptr, y, x, ny, nx)) break;
+ }
+
+ *yp = ny;
+ *xp = nx;
+}
+
+
+/*
+ * @brief 指定のマスが光を通すか(LOSフラグを持つか)を返す。 / Aux function -- see below
+ * @param floor_ptr 配置するフロアの参照ポインタ
+ * @param y 指定Y座標
+ * @param x 指定X座標
+ * @return 光を通すならばtrueを返す。
+ */
+bool cave_los_bold(floor_type *floor_ptr, POSITION y, POSITION x)
+{
+ return feat_supports_los(floor_ptr->grid_array[y][x].feat);
}
OSDN Git Service
