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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program 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 (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* $URL$
* $Id$
*
*/
#include "common/image-map.h"
namespace Common {
ImageMap::~ImageMap() {
removeAllAreas();
}
Rect *ImageMap::createRectArea(const String& id) {
if (_areas.contains(id)) {
warning("Image map already contains an area with target of '%s'");
return 0;
}
Rect *r = new Rect();
_areas[id] = r;
return r;
}
Polygon *ImageMap::createPolygonArea(const String& id) {
if (_areas.contains(id)) {
warning("Image map already contains an area with target of '%s'");
return 0;
}
Polygon *p = new Polygon();
_areas[id] = p;
return p;
}
void ImageMap::removeArea(const String& id) {
if (!_areas.contains(id))
return;
delete _areas[id];
_areas.erase(id);
}
void ImageMap::removeAllAreas() {
HashMap<String, Shape*>::iterator it;
for (it = _areas.begin(); it != _areas.end(); it++) {
delete it->_value;
}
_areas.clear();
}
String ImageMap::findMapArea(int16 x, int16 y) {
HashMap<String, Shape*>::iterator it;
for (it = _areas.begin(); it != _areas.end(); it++) {
if (it->_value->contains(x, y))
return it->_key;
}
return "";
}
} // End of namespace Common
|
