1

/* $Id$ */

     2

     3

/** @file town_type.h Types related to towns. */

     4

     5

#ifndef TOWN_TYPE_H

     6

#define TOWN_TYPE_H

     7

     8

#include "core/enum_type.hpp"

     9

    10

typedef uint16 TownID;

    11

typedef uint16 HouseID;

    12

typedef uint16 HouseClassID;

    13

    14

struct Town;

    15

struct HouseSpec;

    16

    17

enum TownSizeMode {

    18

	TSM_RANDOM,

    19

	TSM_FIXED,

    20

	TSM_CITY

    21

};

    22

    23

enum {

    24

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

    25

	 * MAXIMUM RATINGS BOUNDARIES */

    26

	RATING_MINIMUM     = -1000,

    27

	RATING_APPALLING   =  -400,

    28

	RATING_VERYPOOR    =  -200,

    29

	RATING_POOR        =     0,

    30

	RATING_MEDIOCRE    =   200,

    31

	RATING_GOOD        =   400,

    32

	RATING_VERYGOOD    =   600,

    33

	RATING_EXCELLENT   =   800,

    34

	RATING_OUTSTANDING =  1000,         ///< OUTSTANDING

    35

    36

	RATING_MAXIMUM = RATING_OUTSTANDING,

    37

    38

	RATING_INITIAL = 500, ///< initial rating

    39

    40

	/* RATINGS AFFECTING NUMBERS */

    41

	RATING_TREE_DOWN_STEP = -35,

    42

	RATING_TREE_MINIMUM   = RATING_MINIMUM,

    43

	RATING_TREE_UP_STEP   = 7,

    44

	RATING_TREE_MAXIMUM   = 220,

    45

    46

	RATING_GROWTH_UP_STEP    =   5, ///< when a town grows, all companies have rating increased a bit ...

    47

	RATING_GROWTH_MAXIMUM    = RATING_MEDIOCRE, ///< ... up to RATING_MEDIOCRE

    48

	RATING_STATION_UP_STEP   =  12, ///< when a town grows, company gains reputation for all well serviced stations ...

    49

	RATING_STATION_DOWN_STEP = -15, ///< ... but loses for bad serviced stations

    50

    51

	RATING_TUNNEL_BRIDGE_DOWN_STEP = -250,

    52

	RATING_TUNNEL_BRIDGE_MINIMUM   = 0,

    53

    54

	RATING_ROAD_DOWN_STEP_INNER = -50, ///< removing a roadpiece in the middle

    55

	RATING_ROAD_DOWN_STEP_EDGE  = -18, ///< removing a roadpiece at the edge

    56

	RATING_ROAD_MINIMUM   = -100,

    57

	RATING_HOUSE_MINIMUM  = RATING_MINIMUM,

    58

    59

	RATING_BRIBE_UP_STEP = 200,

    60

	RATING_BRIBE_MAXIMUM = 800,

    61

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

    62

};

    63

    64

/**

    65

 * Town Layouts

    66

 */

    67

enum TownLayout {

    68

	TL_NO_ROADS     = 0, ///< Build no more roads, but still build houses

    69

	TL_ORIGINAL,         ///< Original algorithm (min. 1 distance between roads)

    70

	TL_BETTER_ROADS,     ///< Extended original algorithm (min. 2 distance between roads)

    71

	TL_2X2_GRID,         ///< Geometric 2x2 grid algorithm

    72

	TL_3X3_GRID,         ///< Geometric 3x3 grid algorithm

    73

    74

	TL_RANDOM,           ///< Random town layout

    75

    76

	NUM_TLS,             ///< Number of town layouts

    77

};

    78

    79

/* It needs to be 8bits, because we save and load it as such */

    80

/** Define basic enum properties */

    81

template <> struct EnumPropsT<TownLayout> : MakeEnumPropsT<TownLayout, byte, TL_NO_ROADS, NUM_TLS, NUM_TLS> {};

    82

typedef TinyEnumT<TownLayout> TownLayoutByte; //typedefing-enumification of TownLayout

    83

    84

enum {

    85

	MAX_LENGTH_TOWN_NAME_BYTES  =  31, ///< The maximum length of a town name in bytes including '\0'

    86

	MAX_LENGTH_TOWN_NAME_PIXELS = 130, ///< The maximum length of a town name in pixels

    87

};

    88

    89

#endif /* TOWN_TYPE_H */