Project

General

Profile

Download (3.65 KB)

Feature #1119 » 0038-Fix-advisors-comment-typos.patch

S3_2, S3_1 - Marko Lindqvist, 11/15/2024 09:09 PM

View differences:

client/gui-qt/ratesdlg.cpp
}
/**********************************************************************//**
Ok pressed - send mulipliers value.
Ok pressed - send multipliers' values.
**************************************************************************/
void multipler_rates_dialog::slot_ok_button_pressed()
{
server/advisors/advdata.c
that we use later in ai/default/daicity.c. We mark improvements as
'calculate' if we want to run a full test on them, as 'estimate' if
we just want to do some guesses on them, or as 'unused' is they are
useless to us. Then we find the largest range of calculatable effects
useless to us. Then we find the largest range of calculable effects
in the improvement and record it for later use.
**************************************************************************/
static void adv_data_city_impr_calc(struct player *pplayer,
server/advisors/advgoto.c
}
/**********************************************************************//**
Basic (i.e. not taking attacker specific corections into account)
Basic (i.e. not taking attacker specific corrections into account)
defense rating of this particular unit.
**************************************************************************/
int adv_unit_def_rating_basic(const struct unit *punit)
server/advisors/autoexplorer.c
/* The desirability of the best tile possible without cities or huts.
* TER_SCORE is given per 1% of certainty about the terrain, so
* muliply by 100 to compensate. */
* multiply by 100 to compensate. */
#define BEST_NORMAL_TILE \
(100 * MAX_NEW_TILES * DIFF_TER_SCORE +\
100 * (VISION_TILES - MAX_NEW_TILES) * KNOWN_DIFF_TER_SCORE)
server/advisors/autosettlers.c
/* Time it will take worker to complete its given task */
int completion_time = 0;
/* Terminate what might be an inifite recursion of two units
/* Terminate what might be an infinite recursion of two units
* displacing each other, but leave enough space for
* finite recursion. */
if (recursion > 5
(2-2/2)