1

#ifndef MAP_H

     2

#define MAP_H

     3

     4

#include "stdafx.h"

     5

     6

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

     7

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

     8

     9

extern byte   *_map_type_and_height;

    10

extern byte   *_map_owner;

    11

extern uint16 *_map2;

    12

extern byte   *_map3_lo;

    13

extern byte   *_map3_hi;

    14

extern byte   *_map5;

    15

extern byte   *_map_extra_bits;

    16

    17

void InitMap(uint log_x, uint log_y);

    18

    19

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

    20

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

    21

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

    22

/* The size of the map */

    23

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

    24

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

    25

/* The maximum coordinates */

    26

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

    27

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

    28

/* The number of tiles in the map */

    29

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

    30

    31

// Scale a number relative to the map size

    32

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

    33

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

    34

    35

typedef uint32 TileIndex;

    47

    48

static inline TileIndex TileVirtXY(uint x, uint y)

    49

{

    50

	return (y >> 4 << MapLogX()) + (x >> 4);

    51

}

    52

    53

typedef enum {

    54

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

    55

	OWNER_NONE			= 0x10,	// nobody owns the tile

    56

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

    57

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

    58

} Owner;

    59

    60

enum {

    61

	INVALID_TILE = (TileIndex)-1

    62

};

    63

    64

enum {

    65

	TILE_SIZE   = 16,   /* Tiles are 16x16 "units" in size */

    66

	TILE_PIXELS = 32,   /* a tile is 32x32 pixels */

    67

	TILE_HEIGHT = 8,    /* The standard height-difference between tiles on two levels is 8 (z-diff 8) */

    68

};

    69

    70

    71

static inline uint TileX(TileIndex tile)

    72

{

    73

	return tile & MapMaxX();

    74

}

    75

    76

static inline uint TileY(TileIndex tile)

    77

{

    78

	return tile >> MapLogX();

    79

}

    80

    81

    82

typedef struct TileIndexDiffC {

    83

	int16 x;

    84

	int16 y;

    85

} TileIndexDiffC;

    86

    87

static inline TileIndexDiff ToTileIndexDiff(TileIndexDiffC tidc)

    88

{

    89

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

    90

}

    91

    92

    93

#ifndef _DEBUG

    94

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

    95

#else

    96

	extern TileIndex TileAdd(TileIndex tile, TileIndexDiff add,

    97

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

    98

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

    99

#endif

   100

   102

   103

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

   104

   105

static inline TileIndexDiffC TileIndexDiffCByDir(uint dir) {

   106

	extern const TileIndexDiffC _tileoffs_by_dir[4];

   107

	return _tileoffs_by_dir[dir];

   108

}

   109

   110

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

   111

 * outside of the map, INVALID_TILE is returned instead.

   112

 */

   113

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

   114

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

   115

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

   116

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

   117

		return INVALID_TILE;

   118

	else

   120

}

   121

   122

// Functions to calculate distances

   123

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

   124

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

   125

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

   126

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

   127

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

   128

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

   129

   130

   131

static inline TileIndexDiff TileOffsByDir(uint dir)

   132

{

   133

	extern const TileIndexDiffC _tileoffs_by_dir[4];

   134

   135

	assert(dir < lengthof(_tileoffs_by_dir));

   136

	return ToTileIndexDiff(_tileoffs_by_dir[dir]);

   137

}

   138

   139

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

   140

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

   141

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

   142

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

   143

 * rounding! Be careful when using this!

   144

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

   145

#define STRAIGHT_TRACK_LENGTH 7071/10000

   146

   147

#endif