*/
void do_cmd_travel(void)
{
- int x, y, i;
+ POSITION x, y;
+ int i;
int dx, dy, sx, sy;
feature_type *f_ptr;
else
{
#ifdef JP
- sprintf(note_level_buf, "%d階(%s):", dun_level, d_name+d_info[dungeon_type].name);
+ sprintf(note_level_buf, "%d階(%s):", (int)dun_level, d_name+d_info[dungeon_type].name);
#else
- sprintf(note_level_buf, "%s L%d:", d_name+d_info[dungeon_type].name, dun_level);
+ sprintf(note_level_buf, "%s L%d:", d_name+d_info[dungeon_type].name, (int)dun_level);
#endif
note_level = note_level_buf;
}
case NIKKI_MAXDEAPTH:
{
fprintf(fff, _(" %2d:%02d %20s %sの最深階%d階に到達した。\n",
- " %2d:%02d %20s reached level %d of %s for the first time.\n"), hour, min, note_level,
+ " %2d:%02d %20s reached level %d of %s for the first time.\n"), hour, min, (int)note_level,
_(d_name+d_info[dungeon_type].name, num),
_(num, d_name+d_info[dungeon_type].name));
break;
case NIKKI_TRUMP:
{
fprintf(fff, _(" %2d:%02d %20s %s%sの最深階を%d階にセットした。\n",
- " %2d:%02d %20s reset recall level of %s to %d %s.\n"), hour, min, note_level, note,
+ " %2d:%02d %20s reset recall level of %s to %d %s.\n"), hour, min, (int)note_level, note,
_(d_name + d_info[num].name, max_dlv[num]),
_(max_dlv[num], d_name + d_info[num].name));
break;
monster_race *r_ptr = &r_info[who[k]];
/* Print a message */
- fprintf(fff, _(" %s (レベル%d)\n", " %s (level %d)\n"), r_name + r_ptr->name, (DEPTH)r_ptr->level);
+ fprintf(fff, _(" %s (レベル%d)\n", " %s (level %d)\n"), r_name + r_ptr->name, (int)r_ptr->level);
}
/* Free the "who" array */
if (cast)
{
- int y, x;
+ POSITION y, x;
if (!tgt_pt(&x, &y)) return NULL;
if (desc) return _("モンスターの隣のマスに瞬間移動する。", "Teleports you close to a monster.");
if (cast)
{
- int i, y, x, dir;
+ int i, dir;
+ POSITION y, x;
bool flag;
for (i = 0; i < 3; i++)
sprintf(ppp, _("テレポート先:(%d-%d)", "Teleport to level (%d-%d): "), min_level, max_level);
/* Default */
- sprintf(tmp_val, "%d", dun_level);
+ sprintf(tmp_val, "%d", (DEPTH)dun_level);
/* Ask for a level */
if (!get_string(ppp, tmp_val, 10)) return;
!((q_idx == QUEST_OBERON) || (q_idx == QUEST_SERPENT))))
strcpy(buf,_("クエスト", "in a quest"));
else
- sprintf(buf,_("%d階", "level %d"), dun_level);
+ sprintf(buf,_("%d階", "level %d"), (DEPTH)dun_level);
sprintf(tmp, _("%sで%sに殺された。", "killed by %s %s."), buf, p_ptr->died_from);
do_cmd_write_nikki(NIKKI_BUNSHOU, 0, tmp);
long total_points(void)
{
int i, mult = 100;
- s16b max_dl = 0;
+ DEPTH max_dl = 0;
u32b point, point_h, point_l;
int arena_win = MIN(p_ptr->arena_number, MAX_ARENA_MONS);
byte slot; /* Standard slot value */
byte rating; /* Rating boost */
- byte level; /* Minimum level */
- byte rarity; /* Object rarity */
+ DEPTH level; /* Minimum level */
+ RARITY rarity; /* Object rarity */
byte max_to_h; /* Maximum to-hit bonus */
byte max_to_d; /* Maximum to-dam bonus */
byte max_to_a; /* Maximum to-ac bonus */
- byte max_pval; /* Maximum pval */
+ PARAMETER_VALUE max_pval; /* Maximum pval */
s32b cost; /* Ego-item "cost" */
u32b gen_flags; /* flags for generate */
- byte act_idx; /* Activative ability index */
+ IDX act_idx; /* Activative ability index */
};
fprintf(fff, "[%d]: ", r_ptr->next_r_idx);
r_ptr = &r_info[r_ptr->next_r_idx];
fprintf(fff, _("%s (レベル%d, '%c')\n", "%s (Level %d, '%c')\n"),
- r_name + r_ptr->name, r_ptr->level, r_ptr->d_char);
+ r_name + r_ptr->name, (int)r_ptr->level, r_ptr->d_char);
}
/* End of evolution tree */
wiz_display_item(o_ptr);
p = "Enter new 'to_d' setting: ";
- sprintf(tmp_val, "%d", o_ptr->to_d);
+ sprintf(tmp_val, "%d", (int)o_ptr->to_d);
if (!get_string(p, tmp_val, 5)) return;
o_ptr->to_d = (s16b)atoi(tmp_val);
wiz_display_item(o_ptr);
sprintf(ppp, "Jump to level (0, %d-%d): ", d_info[tmp_dungeon_type].mindepth, d_info[tmp_dungeon_type].maxdepth);
/* Default */
- sprintf(tmp_val, "%d", dun_level);
+ sprintf(tmp_val, "%d", (int)dun_level);
/* Ask for a level */
if (!get_string(ppp, tmp_val, 10)) return;
feature_type *f_ptr;
char tmp_val[160];
int tmp_feat, tmp_mimic;
- int y, x;
+ POSITION y, x;
if (!tgt_pt(&x, &y)) return;
* XAngband: determine if a given location is "interesting"
* based on target_set_accept function.
*/
-static bool tgt_pt_accept(int y, int x)
+static bool tgt_pt_accept(POSITION y, POSITION x)
{
cave_type *c_ptr;
*/
static void tgt_pt_prepare(void)
{
- int y, x;
+ POSITION y, x;
/* Reset "temp" array */
temp_n = 0;