1

#ifndef MAP_H

     2

#define MAP_H

     3

     4

#include "stdafx.h"

     5

     6

#define TILE_FROM_XY(x,y) (TileIndex)((((y) >> 4) << MapLogX()) + ((x) >> 4))

     7

#define TILE_XY(x,y) (((y) << MapLogX()) + (x))

     8

     9

#define TILE_MASK(x) ((x) & ((1 << (MapLogX() + MapLogY())) - 1))

    10

#define TILE_ASSERT(x) assert(TILE_MASK(x) == (x));

    11

    12

extern byte   *_map_type_and_height;

    13

extern byte   *_map_owner;

    14

extern uint16 *_map2;

    15

extern byte   *_map3_lo;

    16

extern byte   *_map3_hi;

    17

extern byte   *_map5;

    18

extern byte   *_map_extra_bits;

    19

    20

void InitMap(uint log_x, uint log_y);

    21

    22

// binary logarithm of the map size, try to avoid using this one

    23

static inline uint MapLogX(void)  { extern uint _map_log_x; return _map_log_x; }

    24

static inline uint MapLogY(void)  { extern uint _map_log_y; return _map_log_y; }

    25

/* The size of the map */

    26

static inline uint MapSizeX(void) { return 1 << MapLogX(); }

    27

static inline uint MapSizeY(void) { return 1 << MapLogY(); }

    28

/* The maximum coordinates */

    29

static inline uint MapMaxX(void) { return MapSizeX() - 1; }

    30

static inline uint MapMaxY(void) { return MapSizeY() - 1; }

    31

/* The number of tiles in the map */

    32

static inline uint MapSize(void) { return MapSizeX() * MapSizeY(); }

    33

    34

// Scale a number relative to the map size

    35

uint ScaleByMapSize(uint); // Scale relative to the number of tiles

    36

uint ScaleByMapSize1D(uint); // Scale relative to the circumference of the map

    37

    38

typedef uint32 TileIndex;

    39

    40

typedef enum {

    41

	OWNER_TOWN			= 0xf,	// a town owns the tile

    42

	OWNER_NONE			= 0x10,	// nobody owns the tile

    43

	OWNER_WATER			= 0x11,	// "water" owns the tile

    44

	OWNER_SPECTATOR	= 0xff,	// spectator in MP or in scenario editor

    45

} Owner;

    46

    47

enum {

    48

	INVALID_TILE = (uint32) -1

    49

};

    50

    58

static inline uint TileX(TileIndex tile)

    59

{

    60

	return tile & MapMaxX();

    61

}

    62

    63

static inline uint TileY(TileIndex tile)

    64

{

    65

	return tile >> MapLogX();

    66

}

    67

    68

    69

typedef int32 TileIndexDiff;

    70

    71

typedef struct TileIndexDiffC {

    72

	int16 x;

    73

	int16 y;

    74

} TileIndexDiffC;

    75

    76

static inline TileIndexDiff ToTileIndexDiff(TileIndexDiffC tidc)

    77

{

    78

	return (tidc.y << MapLogX()) + tidc.x;

    79

}

    80

    81

    82

#ifndef _DEBUG

    83

	#define TILE_ADD(x,y) ((x) + (y))

    84

#else

    85

	extern TileIndex TileAdd(TileIndex tile, TileIndexDiff add,

    86

		const char *exp, const char *file, int line);

    87

	#define TILE_ADD(x, y) (TileAdd((x), (y), #x " + " #y, __FILE__, __LINE__))

    88

#endif

    89

    90

#define TILE_ADDXY(tile, x, y) TILE_ADD(tile, TILE_XY(x, y))

    91

    92

uint TileAddWrap(TileIndex tile, int addx, int addy);

    93

    94

static inline TileIndexDiffC TileIndexDiffCByDir(uint dir) {

    95

	extern const TileIndexDiffC _tileoffs_by_dir[4];

    96

	return _tileoffs_by_dir[dir];

    97

}

    98

    99

/* Returns tile + the diff given in diff. If the result tile would end up

   100

 * outside of the map, INVALID_TILE is returned instead.

   101

 */

   102

static inline TileIndex AddTileIndexDiffCWrap(TileIndex tile, TileIndexDiffC diff) {

   103

	int x = TileX(tile) + diff.x;

   104

	int y = TileY(tile) + diff.y;

   105

	if (x < 0 || y < 0 || x > (int)MapMaxX() || y > (int)MapMaxY())

   106

		return INVALID_TILE;

   107

	else

   108

		return TILE_XY(x, y);

   109

}

   110

   111

// Functions to calculate distances

   112

uint DistanceManhattan(TileIndex, TileIndex); // also known as L1-Norm. Is the shortest distance one could go over diagonal tracks (or roads)

   113

uint DistanceSquare(TileIndex, TileIndex); // euclidian- or L2-Norm squared

   114

uint DistanceMax(TileIndex, TileIndex); // also known as L-Infinity-Norm

   115

uint DistanceMaxPlusManhattan(TileIndex, TileIndex); // Max + Manhattan

   116

uint DistanceTrack(TileIndex, TileIndex); // Returns the shortest distance one could go over tracks

   117

uint DistanceFromEdge(TileIndex); // shortest distance from any edge of the map

   118

   119

   120

static inline TileIndexDiff TileOffsByDir(uint dir)

   121

{

   122

	extern const TileIndexDiffC _tileoffs_by_dir[4];

   123

   124

	assert(dir < lengthof(_tileoffs_by_dir));

   125

	return ToTileIndexDiff(_tileoffs_by_dir[dir]);

   126

}

   127

   128

/* Approximation of the length of a straight track, relative to a diagonal

   129

 * track (ie the size of a tile side). #defined instead of const so it can

   130

 * stay integer. (no runtime float operations) Is this needed?

   131

 * Watch out! There are _no_ brackets around here, to prevent intermediate

   132

 * rounding! Be careful when using this!

   133

 * This value should be sqrt(2)/2 ~ 0.7071 */

   134

#define STRAIGHT_TRACK_LENGTH 7071/10000

   135

   136

#endif