nethack-gwaa-kiwi/nethack
1
0
Fork 0
Code Pull Requests Activity

end.c bit - unnecessary 'else'

Browse Source
This commit is contained in:
PatR
2023-01-21 01:56:07 -08:00
parent f3ed09bb8e
commit 9dca76bb50
1 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/end.c
View File

@@ -930,7 +930,7 @@ savelife(int how)
"killed by <something>, while " "killed by <something>, while "
in high scores entry, if any, and in logfile (but not on tombstone) */ in high scores entry, if any, and in logfile (but not on tombstone) */
gm.multi_reason = Role_if(PM_TOURIST) ? "being toyed with by Fate" gm.multi_reason = Role_if(PM_TOURIST) ? "being toyed with by Fate"
: "attempting to cheat Death"; : "attempting to cheat Death";
if (u.utrap && u.utraptype == TT_LAVA) if (u.utrap && u.utraptype == TT_LAVA)
reset_utrap(FALSE); reset_utrap(FALSE);
@@ -992,8 +992,9 @@ get_valuables(struct obj *list) /* inventory or container contents */
* as easily use qsort, but we don't care about efficiency here. * as easily use qsort, but we don't care about efficiency here.
*/ */
static void static void
sort_valuables(struct valuable_data list[], sort_valuables(
int size) /* max value is less than 20 */ struct valuable_data list[],
int size) /* max value is less than 20 */
{ {
register int i, j; register int i, j;
struct valuable_data ltmp; struct valuable_data ltmp;
@@ -1003,12 +1004,11 @@ sort_valuables(struct valuable_data list[],
if (list[i].count == 0) if (list[i].count == 0)
continue; /* empty slot */ continue; /* empty slot */
ltmp = list[i]; /* structure copy */ ltmp = list[i]; /* structure copy */
for (j = i; j > 0; --j) for (j = i; j > 0; --j) {
if (list[j - 1].count >= ltmp.count) if (list[j - 1].count >= ltmp.count)
break; break;
else { list[j] = list[j - 1];
list[j] = list[j - 1]; }
}
list[j] = ltmp; list[j] = ltmp;
} }
return; return;