summaryrefslogtreecommitdiff
path: root/src/map.h
blob: 38b880b76e03e8ea5a6ebe69abf576dd4672ac34 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
/*
 *  The Mana World
 *  Copyright 2004 The Mana World Development Team
 *
 *  This file is part of The Mana World.
 *
 *  The Mana World 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; either version 2 of the License, or
 *  any later version.
 *
 *  The Mana World 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 The Mana World; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 *  $Id$
 */

#ifndef _TMW_MAP_H
#define _TMW_MAP_H

#include "being.h"

// Tile flags
#define TILE_WALKABLE  1
#define TILE_ANIMATED  2

/**
 * A tile on a tile map.
 */
class Tile
{
    public:
        /**
         * Constructor.
         */
        Tile();

        // Tile data
        int layers[3];
        char flags;

        // Pathfinding members
        int Fcost, Gcost, Hcost;
        int whichList;
        int parentX, parentY;
};

/**
 * A location on a tile map. Used for pathfinding, open list.
 */
class Location
{
    public:
        /**
         * Constructor.
         */
        Location(int x, int y, Tile *tile);

        /**
         * Comparison operator.
         */
        bool operator< (const Location &loc) const;

        int x, y;
        Tile *tile;
};

/**
 * A tile map.
 */
class Map
{
    public:
        /**
         * Constructor.
         */
        Map();

        /**
         * Destructor.
         */
        ~Map();

        /**
         * Loads a map file.
         */
        bool load(char *mapFile);

        /**
         * Sets the size of the map. This will destroy any existing map data.
         */
        void setSize(int width, int height);

        /**
         * Set tile ID.
         */
        void setTile(int x, int y, int layer, int id);

        /**
         * Get tile ID.
         */
        int getTile(int x, int y, int layer);

        /**
         * Set walkability flag for a tile
         */
        void setWalk(int x, int y, bool walkable);

        /**
         * Tell if a tile is walkable or not
         */
        bool getWalk(int x, int y);

        /**
         * Returns the width of this map.
         */
        int getWidth();

        /**
         * Returns the height of this map.
         */
        int getHeight();

        /**
         * Find a path from one location to the next.
         */
        PATH_NODE *findPath(int startX, int startY, int destX, int destY);

    private:
        int width, height;
        Tile *tiles;

        // Pathfinding members
        int onClosedList, onOpenList;
};

extern Map tiledMap;

#endif