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
|
#ifndef __RBTREE_H
#define __RBTREE_H
#include <bsd/sys/tree.h>
#include <glib.h>
#include "undo.h"
class RBTree {
public:
class RBEntry;
private:
RB_HEAD(Tree, RBEntry) head;
RB_PROTOTYPE_INTERNAL(Tree, RBEntry, nodes, /* unused */, static);
public:
class RBEntry {
public:
RB_ENTRY(RBEntry) nodes;
inline RBEntry *
next(void)
{
return RBTree::Tree_RB_NEXT(this);
}
inline RBEntry *
prev(void)
{
return RBTree::Tree_RB_PREV(this);
}
virtual int operator <(RBEntry &entry) = 0;
};
private:
static inline int
compare_entries(RBEntry *e1, RBEntry *e2)
{
return *e1 < *e2;
}
public:
RBTree()
{
RB_INIT(&head);
}
virtual
~RBTree()
{
RBEntry *cur, *next;
RB_FOREACH_SAFE(cur, Tree, &head, next)
delete cur;
}
inline RBEntry *
insert(RBEntry *entry)
{
RB_INSERT(Tree, &head, entry);
return entry;
}
inline RBEntry *
remove(RBEntry *entry)
{
return RB_REMOVE(Tree, &head, entry);
}
inline RBEntry *
find(RBEntry *entry)
{
return RB_FIND(Tree, &head, entry);
}
inline RBEntry *
nfind(RBEntry *entry)
{
return RB_NFIND(Tree, &head, entry);
}
inline RBEntry *
min(void)
{
return RB_MIN(Tree, &head);
}
inline RBEntry *
max(void)
{
return RB_MAX(Tree, &head);
}
};
template <typename KeyType, typename ValueType>
class Table : public RBTree {
class TableEntry : public RBEntry {
public:
KeyType key;
ValueType value;
TableEntry(KeyType &_key, ValueType &_value)
: key(_key), value(_value) {}
int
operator <(RBEntry &entry)
{
return key < ((TableEntry &)entry).key;
}
};
public:
ValueType nil;
Table(ValueType &_nil) : RBTree(), nil(_nil) {}
inline bool
hasEntry(KeyType &key)
{
return find(&TableEntry(key, nil)) != NULL;
}
ValueType &
operator [](KeyType &key)
{
TableEntry *entry = new TableEntry(key, nil);
TableEntry *existing = (TableEntry *)find(entry);
if (existing)
delete entry;
else
existing = (TableEntry *)insert(entry);
return existing->value;
}
inline void
remove(KeyType &key)
{
TableEntry entry(key, nil);
TableEntry *existing = (TableEntry *)find(&entry);
if (existing)
RBTree::remove(existing);
}
#if 0
void
dump(void)
{
RBEntry *cur;
RB_FOREACH(cur, Tree, &head)
g_printf("tree[\"%s\"] = %d\n", cur->name, cur->pc);
g_printf("---END---\n");
}
#endif
void
clear(void)
{
RBEntry *cur;
while ((cur = min())) {
RBTree::remove(cur);
delete cur;
}
}
};
class CString {
public:
gchar *str;
CString(const gchar *_str) : str(g_strdup(_str)) {}
~CString()
{
g_free(str);
}
inline int
operator <(CString &obj)
{
return (int)g_strcmp0(str, obj.str);
}
};
template <typename ValueType>
class StringTable : public Table<CString, ValueType> {
public:
StringTable(ValueType &nil) : Table<CString, ValueType>(nil) {}
inline bool
hasEntry(const gchar *key)
{
CString str(key);
return Table<CString, ValueType>::hasEntry(str);
}
inline ValueType &
operator [](const gchar *key)
{
CString str(key);
return (Table<CString, ValueType>::operator [])(str);
}
inline void
remove(const gchar *key)
{
CString str(key);
Table<CString, ValueType>::remove(str);
}
};
template <typename ValueType>
class StringTableUndo : public StringTable<ValueType> {
class UndoTokenSet : public UndoToken {
StringTableUndo *table;
CString name;
ValueType value;
public:
UndoTokenSet(StringTableUndo *_table, CString &_name, ValueType &_value)
: table(_table), name(_name), value(_value) {}
void
run(void)
{
table->Table<CString, ValueType>::operator [](name) = value;
name.str = NULL;
#if 0
table->dump();
#endif
}
};
class UndoTokenRemove : public UndoToken {
StringTableUndo *table;
CString name;
public:
UndoTokenRemove(StringTableUndo *_table, CString &_name)
: table(_table), name(_name) {}
void
run(void)
{
table->Table<CString, ValueType>::remove(name);
#if 0
table->dump();
#endif
}
};
public:
StringTableUndo(ValueType &nil) : StringTable<ValueType>(nil) {}
void
set(const gchar *key, ValueType &value)
{
ValueType &old = (StringTable<ValueType>::operator [])(key);
CString str(key);
if (old == StringTable<ValueType>::nil)
undo.push(new UndoTokenRemove(this, str));
else
undo.push(new UndoTokenSet(this, str, old));
old = value;
}
};
#endif
|
