2008-01-07 14:02:26 +00:00
|
|
|
/* $Id$ */
|
|
|
|
|
2009-08-21 20:21:05 +00:00
|
|
|
/*
|
|
|
|
* This file is part of OpenTTD.
|
|
|
|
* OpenTTD is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 2.
|
|
|
|
* OpenTTD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
* See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with OpenTTD. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2008-01-07 14:02:26 +00:00
|
|
|
/** @file town_type.h Types related to towns. */
|
|
|
|
|
|
|
|
#ifndef TOWN_TYPE_H
|
|
|
|
#define TOWN_TYPE_H
|
|
|
|
|
|
|
|
#include "core/enum_type.hpp"
|
|
|
|
|
|
|
|
typedef uint16 TownID;
|
|
|
|
struct Town;
|
|
|
|
|
2009-02-05 13:33:37 +00:00
|
|
|
/** Supported initial town sizes */
|
|
|
|
enum TownSize {
|
|
|
|
TS_SMALL, ///< small town
|
|
|
|
TS_MEDIUM, ///< medium town
|
|
|
|
TS_LARGE, ///< large town
|
|
|
|
TS_RANDOM, ///< random size, bigger than small, smaller than large
|
2008-01-07 14:02:26 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
enum {
|
|
|
|
/* These refer to the maximums, so Appalling is -1000 to -400
|
|
|
|
* MAXIMUM RATINGS BOUNDARIES */
|
|
|
|
RATING_MINIMUM = -1000,
|
|
|
|
RATING_APPALLING = -400,
|
|
|
|
RATING_VERYPOOR = -200,
|
|
|
|
RATING_POOR = 0,
|
|
|
|
RATING_MEDIOCRE = 200,
|
|
|
|
RATING_GOOD = 400,
|
|
|
|
RATING_VERYGOOD = 600,
|
|
|
|
RATING_EXCELLENT = 800,
|
|
|
|
RATING_OUTSTANDING = 1000, ///< OUTSTANDING
|
|
|
|
|
|
|
|
RATING_MAXIMUM = RATING_OUTSTANDING,
|
|
|
|
|
2008-04-04 14:53:06 +00:00
|
|
|
RATING_INITIAL = 500, ///< initial rating
|
|
|
|
|
2008-01-07 14:02:26 +00:00
|
|
|
/* RATINGS AFFECTING NUMBERS */
|
|
|
|
RATING_TREE_DOWN_STEP = -35,
|
|
|
|
RATING_TREE_MINIMUM = RATING_MINIMUM,
|
|
|
|
RATING_TREE_UP_STEP = 7,
|
|
|
|
RATING_TREE_MAXIMUM = 220,
|
|
|
|
|
2008-09-30 20:51:04 +00:00
|
|
|
RATING_GROWTH_UP_STEP = 5, ///< when a town grows, all companies have rating increased a bit ...
|
2008-04-04 14:53:06 +00:00
|
|
|
RATING_GROWTH_MAXIMUM = RATING_MEDIOCRE, ///< ... up to RATING_MEDIOCRE
|
2008-09-30 20:51:04 +00:00
|
|
|
RATING_STATION_UP_STEP = 12, ///< when a town grows, company gains reputation for all well serviced stations ...
|
2008-04-04 14:53:06 +00:00
|
|
|
RATING_STATION_DOWN_STEP = -15, ///< ... but loses for bad serviced stations
|
|
|
|
|
2009-05-11 11:55:41 +00:00
|
|
|
RATING_TUNNEL_BRIDGE_DOWN_STEP = -250, ///< penalty for removing town owned tunnel or bridge
|
|
|
|
RATING_TUNNEL_BRIDGE_MINIMUM = 0, ///< minimum rating after removing tunnel or bridge
|
|
|
|
RATING_TUNNEL_BRIDGE_NEEDED_PERMISSIVE = 144, ///< rating needed, "Permissive" difficulty settings
|
|
|
|
RATING_TUNNEL_BRIDGE_NEEDED_NEUTRAL = 208, ///< "Neutral"
|
|
|
|
RATING_TUNNEL_BRIDGE_NEEDED_HOSTILE = 400, ///< "Hostile"
|
|
|
|
|
|
|
|
RATING_ROAD_DOWN_STEP_INNER = -50, ///< removing a roadpiece in the middle
|
|
|
|
RATING_ROAD_DOWN_STEP_EDGE = -18, ///< removing a roadpiece at the edge
|
|
|
|
RATING_ROAD_MINIMUM = -100, ///< minimum rating after removing town owned road
|
|
|
|
RATING_ROAD_NEEDED_PERMISSIVE = 16, ///< rating needed, "Permissive" difficulty settings
|
|
|
|
RATING_ROAD_NEEDED_NEUTRAL = 64, ///< "Neutral"
|
|
|
|
RATING_ROAD_NEEDED_HOSTILE = 112, ///< "Hostile"
|
2008-01-07 14:02:26 +00:00
|
|
|
|
|
|
|
RATING_HOUSE_MINIMUM = RATING_MINIMUM,
|
|
|
|
|
|
|
|
RATING_BRIBE_UP_STEP = 200,
|
|
|
|
RATING_BRIBE_MAXIMUM = 800,
|
|
|
|
RATING_BRIBE_DOWN_TO = -50 // XXX SHOULD BE SOMETHING LOWER?
|
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Town Layouts
|
|
|
|
*/
|
|
|
|
enum TownLayout {
|
2009-02-04 20:17:25 +00:00
|
|
|
TL_BEGIN = 0,
|
|
|
|
TL_ORIGINAL = 0, ///< Original algorithm (min. 1 distance between roads)
|
2008-01-07 14:02:26 +00:00
|
|
|
TL_BETTER_ROADS, ///< Extended original algorithm (min. 2 distance between roads)
|
|
|
|
TL_2X2_GRID, ///< Geometric 2x2 grid algorithm
|
|
|
|
TL_3X3_GRID, ///< Geometric 3x3 grid algorithm
|
|
|
|
|
2008-04-01 16:27:01 +00:00
|
|
|
TL_RANDOM, ///< Random town layout
|
|
|
|
|
2008-01-07 14:02:26 +00:00
|
|
|
NUM_TLS, ///< Number of town layouts
|
|
|
|
};
|
|
|
|
|
2009-05-26 11:19:04 +00:00
|
|
|
/** It needs to be 8bits, because we save and load it as such */
|
|
|
|
typedef SimpleTinyEnumT<TownLayout, byte> TownLayoutByte; // typedefing-enumification of TownLayout
|
2008-01-07 14:02:26 +00:00
|
|
|
|
2008-08-13 06:05:01 +00:00
|
|
|
enum {
|
|
|
|
MAX_LENGTH_TOWN_NAME_BYTES = 31, ///< The maximum length of a town name in bytes including '\0'
|
|
|
|
MAX_LENGTH_TOWN_NAME_PIXELS = 130, ///< The maximum length of a town name in pixels
|
|
|
|
};
|
|
|
|
|
2008-01-07 14:02:26 +00:00
|
|
|
#endif /* TOWN_TYPE_H */
|