mirror of
https://github.com/JGRennison/OpenTTD-patches.git
synced 2024-10-27 15:46:22 +00:00
63e97754fb
(in prepare of dynamic arrays):
- DEREF_XXX is changed into GetXXX
- All direct call are directed via GetXXX
- struct Industry has now an index-field
- ENUM'd some stuff
- Replaced home built loops with FOR_ALL_XXX
- Added _stations_size, _vehicles_size, ... which gives the length of the
array (which will be dynamic in the near future)
- Changed lengtof(XXX) to _XXX_size (e.g. _stations_size)
- Removed all endof(XXX) (because mostly it was part of a FOR_ALL_XXX)
- Made the sort-functions of all 4 dynamic
- Made all 4 Initialize functions more of the same
- Some minor tab-fixing and stuff
(tnx to Tron for proof-reading my 100kb patch ;))
Note for all: please do NOT directly call _stations, _vehicles, _towns and
_industries, but use the right wrapper to access them. Thank you.
Ps: please also do not use 'v++', where v is of type Vehicle *.
116 lines
2.5 KiB
C
116 lines
2.5 KiB
C
#ifndef TOWN_H
|
|
#define TOWN_H
|
|
|
|
#include "player.h"
|
|
|
|
struct Town {
|
|
TileIndex xy;
|
|
|
|
// Current population of people and amount of houses.
|
|
uint16 num_houses;
|
|
uint32 population;
|
|
|
|
// Town name
|
|
uint16 townnametype;
|
|
uint32 townnameparts;
|
|
|
|
// NOSAVE: Location of name sign, UpdateTownVirtCoord updates this.
|
|
ViewportSign sign;
|
|
|
|
// Makes sure we don't build certain house types twice.
|
|
byte flags12;
|
|
|
|
// Which players have a statue?
|
|
byte statues;
|
|
|
|
// Sort index in listings
|
|
byte sort_index_obsolete;
|
|
|
|
// Player ratings as well as a mask that determines which players have a rating.
|
|
byte have_ratings;
|
|
uint8 unwanted[MAX_PLAYERS]; // how many months companies aren't wanted by towns (bribe)
|
|
uint8 exclusivity; // which player has exslusivity
|
|
uint8 exclusive_counter; // months till the exclusivity expires
|
|
int16 ratings[MAX_PLAYERS];
|
|
|
|
// Maximum amount of passengers and mail that can be transported.
|
|
uint16 max_pass;
|
|
uint16 max_mail;
|
|
uint16 new_max_pass;
|
|
uint16 new_max_mail;
|
|
uint16 act_pass;
|
|
uint16 act_mail;
|
|
uint16 new_act_pass;
|
|
uint16 new_act_mail;
|
|
|
|
// Amount of passengers that were transported.
|
|
byte pct_pass_transported;
|
|
byte pct_mail_transported;
|
|
|
|
// Amount of food and paper that was transported. Actually a bit mask would be enough.
|
|
uint16 act_food;
|
|
uint16 act_water;
|
|
uint16 new_act_food;
|
|
uint16 new_act_water;
|
|
|
|
// Time until we rebuild a house.
|
|
byte time_until_rebuild;
|
|
|
|
// When to grow town next time.
|
|
byte grow_counter;
|
|
byte growth_rate;
|
|
|
|
// Fund buildings program in action?
|
|
byte fund_buildings_months;
|
|
|
|
// Fund road reconstruction in action?
|
|
byte road_build_months;
|
|
|
|
// Index in town array
|
|
uint16 index;
|
|
|
|
// NOSAVE: UpdateTownRadius updates this given the house count.
|
|
uint16 radius[5];
|
|
};
|
|
|
|
|
|
void UpdateTownVirtCoord(Town *t);
|
|
void InitializeTown();
|
|
void ShowTownViewWindow(uint town);
|
|
void DeleteTown(Town *t);
|
|
void ExpandTown(Town *t);
|
|
bool GrowTown(Town *t);
|
|
Town *CreateRandomTown();
|
|
|
|
enum {
|
|
ROAD_REMOVE = 0,
|
|
UNMOVEABLE_REMOVE = 1,
|
|
TUNNELBRIDGE_REMOVE = 1,
|
|
INDUSTRY_REMOVE = 2
|
|
};
|
|
|
|
bool CheckforTownRating(uint tile, uint32 flags, Town *t, byte type);
|
|
|
|
VARDEF Town _towns[70];
|
|
VARDEF uint _towns_size;
|
|
|
|
VARDEF uint16 *_town_sort;
|
|
|
|
static inline Town *GetTown(uint index)
|
|
{
|
|
assert(index < _towns_size);
|
|
return &_towns[index];
|
|
}
|
|
|
|
#define FOR_ALL_TOWNS(t) for(t = _towns; t != &_towns[_towns_size]; t++)
|
|
|
|
VARDEF int _total_towns; // For the AI: the amount of towns active
|
|
|
|
VARDEF bool _town_sort_dirty;
|
|
VARDEF byte _town_sort_order;
|
|
|
|
VARDEF Town *_cleared_town;
|
|
VARDEF int _cleared_town_rating;
|
|
|
|
#endif /* TOWN_H */
|