1

/* $Id$ */

     2

     3

#ifndef TOWN_H

     4

#define TOWN_H

     5

     6

#include "pool.h"

     7

#include "player.h"

     8

     9

struct Town {

    10

	TileIndex xy;

    11

    12

	// Current population of people and amount of houses.

    13

	uint16 num_houses;

    14

	uint32 population;

    15

    16

	// Town name

    17

	uint16 townnametype;

    18

	uint32 townnameparts;

    19

    20

	// NOSAVE: Location of name sign, UpdateTownVirtCoord updates this.

    21

	ViewportSign sign;

    22

    23

	// Makes sure we don't build certain house types twice.

    24

	byte flags12;

    25

    26

	// Which players have a statue?

    27

	byte statues;

    28

    29

	// Sort index in listings

    30

	byte sort_index_obsolete;

    31

    32

	// Player ratings as well as a mask that determines which players have a rating.

    33

	byte have_ratings;

    34

	uint8 unwanted[MAX_PLAYERS]; // how many months companies aren't wanted by towns (bribe)

    35

	PlayerID exclusivity;        // which player has exslusivity

    36

	uint8 exclusive_counter;     // months till the exclusivity expires

    37

	int16 ratings[MAX_PLAYERS];

    38

    39

	// Maximum amount of passengers and mail that can be transported.

    40

	uint32 max_pass;

    41

	uint32 max_mail;

    42

	uint32 new_max_pass;

    43

	uint32 new_max_mail;

    44

	uint32 act_pass;

    45

	uint32 act_mail;

    46

	uint32 new_act_pass;

    47

	uint32 new_act_mail;

    48

    49

	// Amount of passengers that were transported.

    50

	byte pct_pass_transported;

    51

	byte pct_mail_transported;

    52

    53

	// Amount of food and paper that was transported. Actually a bit mask would be enough.

    54

	uint16 act_food;

    55

	uint16 act_water;

    56

	uint16 new_act_food;

    57

	uint16 new_act_water;

    58

    59

	// Time until we rebuild a house.

    60

	byte time_until_rebuild;

    61

    62

	// When to grow town next time.

    63

	byte grow_counter;

    64

	byte growth_rate;

    65

    66

	// Fund buildings program in action?

    67

	byte fund_buildings_months;

    68

    69

	// Fund road reconstruction in action?

    70

	byte road_build_months;

    71

    72

	// Index in town array

    73

	uint16 index;

    74

    75

	// NOSAVE: UpdateTownRadius updates this given the house count.

    76

	uint16 radius[5];

    77

};

    78

    79

uint32 GetWorldPopulation(void);

    80

    81

void UpdateTownVirtCoord(Town *t);

    82

void InitializeTown(void);

    83

void ShowTownViewWindow(uint town);

    84

void DeleteTown(Town *t);

    85

void ExpandTown(Town *t);

    86

bool GrowTown(Town *t);

    87

Town *CreateRandomTown(uint attempts);

    88

    89

enum {

    90

	ROAD_REMOVE = 0,

    91

	UNMOVEABLE_REMOVE = 1,

    92

	TUNNELBRIDGE_REMOVE = 1,

    93

	INDUSTRY_REMOVE = 2

    94

};

    95

    96

enum {

    97

	// These refer to the maximums, so Appalling is -1000 to -400

    98

	// MAXIMUM RATINGS BOUNDARIES

    99

	RATING_MINIMUM 		= -1000,

   100

	RATING_APPALLING 	= -400,

   101

	RATING_VERYPOOR 	= -200,

   102

	RATING_POOR 			= 0,

   103

	RATING_MEDIOCRE		= 200,

   104

	RATING_GOOD				= 400,

   105

	RATING_VERYGOOD		= 600,

   106

	RATING_EXCELLENT	= 800,

   107

	RATING_OUTSTANDING= 1000, 	// OUTSTANDING

   108

   109

	RATING_MAXIMUM = RATING_OUTSTANDING,

   110

   111

	// RATINGS AFFECTING NUMBERS

   112

	RATING_TREE_DOWN_STEP = -35,

   113

	RATING_TREE_MINIMUM = RATING_MINIMUM,

   114

	RATING_TREE_UP_STEP = 7,

   115

	RATING_TREE_MAXIMUM = 220,

   116

   117

	RATING_TUNNEL_BRIDGE_DOWN_STEP = -250,

   118

	RATING_TUNNEL_BRIDGE_MINIMUM = 0,

   119

   120

	RATING_INDUSTRY_DOWN_STEP = -1500,

   121

	RATING_INDUSTRY_MINIMUM = RATING_MINIMUM,

   122

   123

	RATING_ROAD_DOWN_STEP = -50,

   124

	RATING_ROAD_MINIMUM = -100,

   125

	RATING_HOUSE_MINIMUM = RATING_MINIMUM,

   126

   127

	RATING_BRIBE_UP_STEP = 200,

   128

	RATING_BRIBE_MAXIMUM = 800,

   129

	RATING_BRIBE_DOWN_TO = -50 					// XXX SHOULD BE SOMETHING LOWER?

   130

};

   131

   132

bool CheckforTownRating(TileIndex tile, uint32 flags, Town *t, byte type);

   133

   134

VARDEF uint16 *_town_sort;

   135

   136

extern MemoryPool _town_pool;

   137

   138

/**

   139

 * Check if a Town really exists.

   140

 */

   141

static inline bool IsValidTown(const Town* town)

   142

{

   143

	return town->xy != 0; /* XXX: Replace by INVALID_TILE someday */

   144

}

   145

   146

/**

   147

 * Get the pointer to the town with index 'index'

   148

 */

   149

static inline Town *GetTown(uint index)

   150

{

   151

	return (Town*)GetItemFromPool(&_town_pool, index);

   152

}

   153

   154

/**

   155

 * Get the current size of the TownPool

   156

 */

   157

static inline uint16 GetTownPoolSize(void)

   158

{

   159

	return _town_pool.total_items;

   160

}

   161

   162

static inline bool IsTownIndex(uint index)

   163

{

   164

	return index < GetTownPoolSize();

   165

}

   166

   167

#define FOR_ALL_TOWNS_FROM(t, start) for (t = GetTown(start); t != NULL; t = (t->index + 1 < GetTownPoolSize()) ? GetTown(t->index + 1) : NULL)

   168

#define FOR_ALL_TOWNS(t) FOR_ALL_TOWNS_FROM(t, 0)

   169

   170

VARDEF uint _total_towns; // For the AI: the amount of towns active

   171

   172

VARDEF bool _town_sort_dirty;

   173

VARDEF byte _town_sort_order;

   174

   175

VARDEF Town *_cleared_town;

   176

VARDEF int _cleared_town_rating;

   177

   178

#endif /* TOWN_H */