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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
|
#include "map.h"
#include "frame.h"
#include "object.h"
#include "world.h"
#include "consts.h"
Map::Map(int id, World* world) : id(id), world(world)
{
mapdata = (int*) calloc(MAP_WIDTH * MAP_HEIGHT, sizeof(int));
}
Map::Map(const Map& map)
{
mapdata = (int*) malloc(MAP_WIDTH*MAP_HEIGHT*sizeof(int));
memcpy(mapdata, map.mapdata, MAP_WIDTH*MAP_HEIGHT*sizeof(int));
id = map.id;
title = map.title;
objects = map.objects;
world = map.world;
treeItemId = map.treeItemId;
children = map.children;
hidden = map.hidden;
adjacents = map.adjacents;
}
Map::Map(Map&& map) : Map(-1, map.world)
{
swap(*this, map);
}
Map::~Map()
{
free(mapdata);
}
Map& Map::operator= (Map map)
{
swap(*this, map);
return *this;
}
void swap(Map& first, Map& second)
{
std::swap(first.mapdata, second.mapdata);
std::swap(first.title, second.title);
std::swap(first.objects, second.objects);
std::swap(first.id, second.id);
std::swap(first.world, second.world);
std::swap(first.treeItemId, second.treeItemId);
std::swap(first.children, second.children);
std::swap(first.hidden, second.hidden);
std::swap(first.adjacents, second.adjacents);
}
std::list<Map::MoveType> Map::listMoveTypes()
{
return {MoveType::Wall, MoveType::Wrap, MoveType::Warp, MoveType::ReverseWarp};
}
std::string Map::stringForMoveType(MoveType type)
{
switch (type)
{
case MoveType::Wall: return "Wall";
case MoveType::Warp: return "Teleport";
case MoveType::Wrap: return "Wrap";
case MoveType::ReverseWarp: return "Reverse Teleport";
}
}
bool Map::moveTypeTakesMap(MoveType type)
{
switch (type)
{
case MoveType::Wall: return false;
case MoveType::Wrap: return false;
case MoveType::Warp: return true;
case MoveType::ReverseWarp: return true;
}
}
std::string Map::shortForMoveType(MoveType type)
{
switch (type)
{
case MoveType::Wall: return "wall";
case MoveType::Wrap: return "wrap";
case MoveType::Warp: return "warp";
case MoveType::ReverseWarp: return "reverseWarp";
}
}
std::string Map::shortForMoveDir(MoveDir dir)
{
switch (dir)
{
case MoveDir::Left: return "left";
case MoveDir::Right: return "right";
case MoveDir::Up: return "up";
case MoveDir::Down: return "down";
}
}
Map::MoveType Map::moveTypeForShort(std::string str)
{
if (str == "wrap") return MoveType::Wrap;
if (str == "warp") return MoveType::Warp;
if (str == "reverseWarp") return MoveType::ReverseWarp;
return MoveType::Wall;
}
Map::MoveDir Map::moveDirForShort(std::string str)
{
if (str == "right") return MoveDir::Right;
if (str == "up") return MoveDir::Up;
if (str == "down") return MoveDir::Down;
return MoveDir::Left;
}
int Map::getID() const
{
return id;
}
std::string Map::getTitle() const
{
return title;
}
int Map::getTileAt(int x, int y) const
{
return mapdata[x+y*MAP_WIDTH];
}
const std::list<std::shared_ptr<MapObjectEntry>>& Map::getObjects() const
{
return objects;
}
wxTreeItemId Map::getTreeItemId() const
{
return treeItemId;
}
std::list<std::shared_ptr<Map>> Map::getChildren() const
{
std::list<std::shared_ptr<Map>> ret;
for (auto id : children)
{
ret.push_back(world->getMap(id));
}
return ret;
}
bool Map::getExpanded() const
{
return expanded;
}
World* Map::getWorld() const
{
return world;
}
bool Map::getHidden() const
{
return hidden;
}
const std::map<Map::MoveDir, Map::Adjacent>& Map::getAdjacents() const
{
return adjacents;
}
const Map::Adjacent& Map::getAdjacent(MoveDir direction) const
{
if (adjacents.count(direction) > 0)
{
return adjacents.at(direction);
} else {
return defaultAdjacent;
}
}
void Map::setTitle(std::string title, bool dirty)
{
this->title = title;
if (dirty)
{
world->setDirty(true);
}
}
void Map::setTileAt(int x, int y, int tile, bool dirty)
{
mapdata[x+y*MAP_WIDTH] = tile;
if (dirty)
{
world->setDirty(true);
}
}
void Map::setMapdata(int* mapdata, bool dirty)
{
free(this->mapdata);
this->mapdata = mapdata;
if (dirty)
{
world->setDirty(true);
}
}
void Map::addObject(std::shared_ptr<MapObjectEntry> obj, bool dirty)
{
objects.push_back(obj);
if (dirty)
{
world->setDirty(true);
}
}
void Map::removeObject(std::shared_ptr<MapObjectEntry> obj, bool dirty)
{
objects.remove(obj);
if (dirty)
{
world->setDirty(true);
}
}
void Map::setTreeItemId(wxTreeItemId id)
{
this->treeItemId = id;
}
void Map::addChild(int id)
{
children.push_back(id);
}
void Map::setExpanded(bool exp)
{
expanded = exp;
}
void Map::setHidden(bool hid)
{
hidden = hid;
}
void Map::setAdjacent(MoveDir direction, MoveType type, int map, bool dirty)
{
Adjacent& cur = adjacents[direction];
cur.type = type;
if (map != -1) cur.map = map;
if (dirty)
{
world->setDirty(true);
}
}
|
