1

/* $Id */

     2

     3

/** @file */

     4

     5

#include "stdafx.h"

     6

#include "openttd.h"

     7

#include "road_map.h"

     8

#include "town.h"

     9

#include "town_map.h"

    10

    11

/* static */

    12

int64 Town::GetTilePrice(TileIndex tile)

    13

{

    14

	uint rad;

    15

	const Town *t = GetRadiusGroupForTile(tile, rad);

    16

	FixedT<int64, 16> price = t->GetActivity();

    17

	DEBUG(eco, 6, "Getting price for tile 0x%x at %f (authority at 0x%x)", tile, (double)price, t->xy);

    18

	price *=  _eco->GetPrice(CEconomy::PURCHASE_LAND) * rad * rad * 10;

    19

    20

	return price;

    21

}

    22

    23

/* static */

    24

const Town *Town::GetRadiusGroupForTile(TileIndex tile, uint &group)

    25

{

    26

	const Town *t;

    27

	group = 0;

    28

	const Town *best_town = NULL;

    29

    30

	DEBUG(eco, 7, "Obtaining highest town radius for tile 0x%x", tile);

    31

    32

	/* We do have a tile that directly belongs to a town */

    33

	if (IsTileType(tile, MP_HOUSE) ||

    34

			(IsTileType(tile, MP_STREET) &&

    36

		t = GetTownByTile(tile);

    37

		group = t->GetRadiusGroup(tile, true) + 1;

    38

		DEBUG(eco, 6, "Tile 0x%x belongs to town at 0x%x, level %d", tile, t->xy, group);

    39

		return t;

    40

	}

    41

    42

	uint best_dist = UINT_MAX;

    43

	FOR_ALL_TOWNS(t) {

    44

		if (1 + t->GetRadiusGroup(tile, true) > group) {

    45

			group = t->GetRadiusGroup(tile, true) + 1;

    46

			DEBUG(eco, 7, "Higher group (%d) found for town at 0x%x", group, t->xy);

    47

			best_town = t;

    48

			if (best_dist > DistanceSquare(tile, t->xy)) best_dist = DistanceSquare(tile, t->xy);

    49

		} else if (1 + t->GetRadiusGroup(tile, true) == group) {

    50

			DEBUG(eco, 7, "Same group found town at 0x%x is closer", t->xy);

    51

			if (best_dist > DistanceSquare(tile, t->xy)) {

    52

				best_dist = DistanceSquare(tile, t->xy);

    53

				best_town = t;

    54

			}

    55

		}

    56

	}

    57

    58

	assert(best_town != NULL);

    59

    60

	return best_town;

    61

}

    62

    63

uint Town::GetRadiusGroup(TileIndex tile, bool ignore_funding) const

    64

{

    65

	uint dist = DistanceSquare(tile, xy);

    66

	uint smallest = 0;

    67

    68

	if (!ignore_funding && fund_buildings_months > 0 && dist < 25) return 4;

    69

    70

	for (uint i = 0; i != lengthof(radius); i++) if (dist < radius[i]) smallest = i;

    71

    72

	return smallest;

    73

}

    74

    75

void Town::UpdateActivity()

    76

{

    77

	if (new_act_pass == 0 && act_pass == 0) {

    78

		DEBUG(eco, 7, "Town is not connected, bailing out");

    79

		return;

    80

	}

    81

    82

	static const FixedT<int, 12> max_activity_change   (1, 400);

    83

	static const FixedT<int, 12> min_activity_change = -max_activity_change;

    84

	FixedT<int, 12>              activity_change       (1, 200);

    85

    86

	activity_change *= act_pass;

    87

	activity_change /= max_pass;

    88

	activity_change -= max_activity_change;

    89

	DEBUG(eco, 6, "Raw EAL change for town at 0x%x is %f", xy, (double)activity_change);

    90

    91

	if (activity_change > max_activity_change) activity_change = max_activity_change;

    92

	if (activity_change < min_activity_change) activity_change = min_activity_change;

    93

    94

	this->SetActivity(this->GetActivity() + activity_change);

    95

    96

	DEBUG(eco, 5, "Modifying EAL for town at 0x%x by %f to %f", xy, (double)activity_change, (double)this->GetActivity());

    97

}