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
|
/* ScummVM - Scumm Interpreter
* Copyright (C) 2002 The ScummVM project
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* $Header$
*/
#ifndef COMMON_MAP_H
#define COMMON_MAP_H
#include "scummsys.h"
namespace ScummVM {
template <class Key, class Value>
class Map {
protected:
struct Node {
Node *_parent;
Node *_left, *_right;
Key _key;
Value _value;
Node() {}
Node(const Key &key, Node *parent) : _parent(parent), _key(key) {}
};
Node *_root;
Node *_header;
class Iterator {
Node *_node;
public:
Iterator(Node *node = 0) : _node(node) {}
Node &operator *() { assert(_node != 0); return *_node; }
const Node &operator *() const { assert(_node != 0); return *_node; }
const Node *operator->() const { assert(_node != 0); return _node; }
bool operator !=(const Iterator &iter) const { return _node != iter._node; }
void operator ++()
{
if (!_node)
return;
if (_node->_right) {
_node = _node->_right;
while (_node->_left)
_node = _node->_left;
} else {
Node *parent = _node->_parent;
while (_node == parent->_right) {
_node = parent;
parent = _node->_parent;
}
if (_node->_right != parent)
_node = parent;
}
if (_node->_parent == 0)
_node = 0;
}
};
public:
Map<Key, Value>() : _root(0)
{
_header = new Node();
_header->_right = _header->_left = _header;
}
/*
* Return the object for the given key. If no match is found, a new entry
* with the given key and the default data value is inserted.
*/
Value &operator [](const Key &key)
{
Node *node;
if (!_root)
node = _root = new Node(key, _header);
else
node = createNode(_root, key);
return node->_value;
}
const Value &operator [](const Key &key) const
{
Node *node = findNode(_root, key);
assert(node != 0);
return node->_value;
}
bool contains(const Key &key) const
{
return (findNode(_root, key) != 0);
}
void clear()
{
clearNodes(_root);
_root = 0;
}
bool isEmpty() const
{
return (_root == 0);
}
void remove(const Key &key)
{
// TODO - implement efficiently. Indeed, maybe switch to using red-black trees?
// For now, just a lame, bad remove algorithm. Rule: don't remove elements
// from one of our maps if you need to be efficient :-)
Node *node = findNode(_root, key);
if (!node)
return;
// Now we have to remove 'node'. There are two simple cases and one hard.
Node *parent = node->_parent;
Node *rep;
if (!node->_left) {
rep = node->_right;
} else if (!node->_right) {
rep = node->_left;
} else {
// We have to do it the hard way since both children are present.
Node *n2;
n2 = rep = node->_right;
// Now insert the left child leftmost into our right child
while (n2->_left)
n2 = n2->_left;
n2->_left = node->_left;
n2->_left->_parent = n2;
}
// Replace this node with node 'rep'
if (rep)
rep->_parent = parent;
if (!parent) // Root node?
_root = rep;
else if (parent->_left == node)
parent->_left = rep;
else
parent->_right = rep;
// Finally free the allocated memory
delete node;
}
void merge(Map<Key, Value> map)
{
// FIXME - this is a very bad algorithm.
// Right now we insert the items from 'map' using the default iterator,
// which gives us the objects ordered, leading to an unbalanced tree.
// This could be fixed by switching to a red black tree, or by using a
// different walk order (infix comes to mind).
if (map.isEmpty())
return;
Iterator x(map.begin()), end(map.end());
for (; x != end; ++x) {
(*this)[x->_key] = x->_value;
}
}
Iterator begin() const
{
Node *node = _root;
if (node) {
while (node->_left)
node = node->_left;
}
return Iterator(node);
}
Iterator end() const
{
return Iterator();
}
protected:
// Find the node matching the given key, if any
Node *findNode(Node *node, const Key &key) const
{
while (node && (key != node->_key)) {
if (key < node->_key) {
node = node->_left;
} else {
node = node->_right;
}
}
return node;
}
Node *createNode(Node *node, const Key &key)
{
Node *prevNode = 0;
bool left = true;
while (node) {
prevNode = node;
if (key == node->_key) {
return node;
} else if (key < node->_key) {
left = true;
node = node->_left;
} else {
left = false;
node = node->_right;
}
}
node = new Node(key, prevNode);
if (left) {
prevNode->_left = node;
} else {
prevNode->_right = node;
}
return node;
}
void clearNodes(Node *node)
{
if (!node)
return;
clearNodes(left);
clearNodes(right);
delete node;
}
};
class String;
typedef Map<String, String> StringMap;
}; // End of namespace ScummVM
#endif
|