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
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
|
// $Id$
// ============================================================================
//
// = LIBRARY
// tests
//
// = FILENAME
// Lazy_Map_Manager_Test.cpp
//
// = DESCRIPTION
// This is a simple test of the <ACE_Map_Manager> and
// <ACE_Active_Map_Manager> that illustrates how lazy map managers
// allow the deletion of entries while iterating over the map.
//
// = AUTHOR
// Irfan Pyarali <irfan@cs.wustl.edu>,
//
// ============================================================================
#include "test_config.h"
#include "ace/Map_Manager.h"
#include "ace/Active_Map_Manager.h"
#include "ace/Synch.h"
#include "ace/streams.h"
ACE_RCSID(tests, Map_Manager_Test, "$Id$")
// Simple map manager.
typedef ACE_Map_Manager<int, int, ACE_Null_Mutex> MAP;
// Displaying the contents of a map manager.
void
display_map (MAP &map)
{
{
// Simple iteration printing the entries.
for (MAP::iterator iter = map.begin ();
iter != map.end ();
++iter)
{
MAP::ENTRY &entry = *iter;
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("%d "),
entry.int_id_));
}
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
}
{
// Simple reverse iteration printing the entries.
for (MAP::reverse_iterator iter = map.rbegin ();
iter != map.rend ();
++iter)
{
MAP::ENTRY &entry = *iter;
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("%d "),
entry.int_id_));
}
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("\n")));
}
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("\n")));
}
// Test for map manager.
void
map_test (void)
{
// Map of size 3.
MAP map (3);
int i = 0;
// Insert a few entries.
for (i = 0; i < 3; ++i)
map.bind (i, i);
display_map (map);
// Remove middle one.
map.unbind (1);
display_map (map);
// Remove the entry on one end.
map.unbind (0);
display_map (map);
// Remove the entry on the other end.
map.unbind (2);
display_map (map);
// If we have lazy map managers, we can delete entries while
// iterating over the map.
#if defined (ACE_HAS_LAZY_MAP_MANAGER)
// Insert a few entries.
for (i = 0; i < 3; ++i)
map.bind (i, i);
display_map (map);
// Remove middle one.
{
// Deletion while iterating.
for (MAP::iterator iter = map.begin ();
iter != map.end ();
++iter)
{
MAP::ENTRY &entry = *iter;
if (entry.int_id_ == 1)
map.unbind (1);
}
display_map (map);
}
// Remove the entry on one end.
{
// Deletion while iterating.
for (MAP::iterator iter = map.begin ();
iter != map.end ();
++iter)
{
MAP::ENTRY &entry = *iter;
if (entry.int_id_ == 0)
map.unbind (0);
}
display_map (map);
}
// Remove the entry on the other end.
{
// Deletion while iterating.
for (MAP::iterator iter = map.begin ();
iter != map.end ();
++iter)
{
MAP::ENTRY &entry = *iter;
if (entry.int_id_ == 2)
map.unbind (2);
}
display_map (map);
}
#endif /* ACE_HAS_LAZY_MAP_MANAGER */
// Insert a few entries. This will force an increase in map size.
for (i = 0; i < 4; ++i)
map.bind (i, i);
display_map (map);
// Remove a few entries (in reverse order).
for (i = 3; i >= 0; --i)
map.unbind (i);
display_map (map);
}
// Simple active map manager.
typedef ACE_Active_Map_Manager<int> ACTIVE_MAP;
// Displaying the contents of an active map manager.
void
display_map (ACTIVE_MAP &map)
{
{
// Simple iteration printing the entries.
for (ACTIVE_MAP::iterator iter = map.begin ();
iter != map.end ();
++iter)
{
ACTIVE_MAP::ENTRY &entry = *iter;
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("%d "),
entry.int_id_));
}
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("\n")));
}
{
// Simple reverse iteration printing the entries.
for (ACTIVE_MAP::reverse_iterator iter = map.rbegin ();
iter != map.rend ();
++iter)
{
ACTIVE_MAP::ENTRY &entry = *iter;
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("%d "),
entry.int_id_));
}
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("\n")));
}
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("\n")));
}
// Test for active map manager.
void
active_map_test (void)
{
// Map of size 3.
ACTIVE_MAP map (3);
ACE_Active_Map_Manager_Key keys[4];
int i = 0;
// Insert a few entries.
for (i = 0; i < 3; ++i)
map.bind (i, keys[i]);
display_map (map);
// Remove middle one.
map.unbind (keys[1]);
display_map (map);
// Remove the entry on one end.
map.unbind (keys[0]);
display_map (map);
// Remove the entry on the other end.
map.unbind (keys[2]);
display_map (map);
// If we have lazy map managers, we can delete entries while
// iterating over the map.
#if defined (ACE_HAS_LAZY_MAP_MANAGER)
// Insert a few entries.
for (i = 0; i < 3; ++i)
map.bind (i, keys[i]);
display_map (map);
// Remove middle one.
{
// Deletion while iterating.
for (ACTIVE_MAP::iterator iter = map.begin ();
iter != map.end ();
++iter)
{
ACTIVE_MAP::ENTRY &entry = *iter;
if (entry.int_id_ == 1)
map.unbind (keys[1]);
}
display_map (map);
}
// Remove the entry on one end.
{
// Deletion while iterating.
for (ACTIVE_MAP::iterator iter = map.begin ();
iter != map.end ();
++iter)
{
ACTIVE_MAP::ENTRY &entry = *iter;
if (entry.int_id_ == 0)
map.unbind (keys[0]);
}
display_map (map);
}
// Remove the entry on the other end.
{
// Deletion while iterating.
for (ACTIVE_MAP::iterator iter = map.begin ();
iter != map.end ();
++iter)
{
ACTIVE_MAP::ENTRY &entry = *iter;
if (entry.int_id_ == 2)
map.unbind (keys[2]);
}
display_map (map);
}
#endif /* ACE_HAS_LAZY_MAP_MANAGER */
// Insert a few entries. This will force an increase in map size.
for (i = 0; i < 4; ++i)
map.bind (i, keys[i]);
display_map (map);
// Remove a few entries (in reverse order).
for (i = 3; i >= 0; --i)
map.unbind (keys[i]);
display_map (map);
}
int
main (int, ACE_TCHAR *[])
{
ACE_START_TEST (ACE_TEXT ("Lazy_Map_Manager_Test"));
ACE_LOG_MSG->clr_flags (ACE_Log_Msg::VERBOSE_LITE);
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("\nMap Manager...\n\n")));
map_test ();
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("\nActive Map Manager...\n\n")));
active_map_test ();
ACE_LOG_MSG->set_flags (ACE_Log_Msg::VERBOSE_LITE);
ACE_END_TEST;
return 0;
}
#if defined (ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION)
template class ACE_Map_Manager<int, int, ACE_Null_Mutex>;
template class ACE_Map_Iterator_Base<int, int, ACE_Null_Mutex>;
template class ACE_Map_Iterator<int, int, ACE_Null_Mutex>;
template class ACE_Map_Reverse_Iterator<int, int, ACE_Null_Mutex>;
template class ACE_Map_Entry<int, int>;
template class ACE_Active_Map_Manager<int>;
template class ACE_Map_Manager<ACE_Active_Map_Manager_Key, int, ACE_Null_Mutex>;
template class ACE_Map_Iterator_Base<ACE_Active_Map_Manager_Key, int, ACE_Null_Mutex>;
template class ACE_Map_Iterator<ACE_Active_Map_Manager_Key, int, ACE_Null_Mutex>;
template class ACE_Map_Reverse_Iterator<ACE_Active_Map_Manager_Key, int, ACE_Null_Mutex>;
template class ACE_Map_Entry<ACE_Active_Map_Manager_Key, int>;
#elif defined (ACE_HAS_TEMPLATE_INSTANTIATION_PRAGMA)
#pragma instantiate ACE_Map_Manager<int, int, ACE_Null_Mutex>
#pragma instantiate ACE_Map_Iterator_Base<int, int, ACE_Null_Mutex>
#pragma instantiate ACE_Map_Iterator<int, int, ACE_Null_Mutex>
#pragma instantiate ACE_Map_Reverse_Iterator<int, int, ACE_Null_Mutex>
#pragma instantiate ACE_Map_Entry<int, int>
#pragma instantiate ACE_Active_Map_Manager<int>
#pragma instantiate ACE_Map_Manager<ACE_Active_Map_Manager_Key, int, ACE_Null_Mutex>
#pragma instantiate ACE_Map_Iterator_Base<ACE_Active_Map_Manager_Key, int, ACE_Null_Mutex>
#pragma instantiate ACE_Map_Iterator<ACE_Active_Map_Manager_Key, int, ACE_Null_Mutex>
#pragma instantiate ACE_Map_Reverse_Iterator<ACE_Active_Map_Manager_Key, int, ACE_Null_Mutex>
#pragma instantiate ACE_Map_Entry<ACE_Active_Map_Manager_Key, int>
#endif /* ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION */
|
