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
|
// $Id$
// ============================================================================
//
// = LIBRARY
// tests
//
// = FILENAME
// Map_Manager_Test.cpp
//
// = DESCRIPTION
// This is a simple test of the ACE_Map_Manager and
// ACE_Hash_Map_Manager that illustrates how to use the forward
// and reverse iterators.
//
// = AUTHOR
// Irfan Pyarali and Douglas C. Schmidt
//
// ============================================================================
#include "test_config.h"
#include "ace/Map_Manager.h"
#include "ace/Hash_Map_Manager.h"
#include "ace/Profile_Timer.h"
#include "ace/Synch.h"
typedef ACE_Null_Mutex MUTEX;
typedef size_t VALUE;
#if defined (ACE_HAS_TEMPLATE_SPECIALIZATION)
// We need this template specialization since KEY is defined as a
// size_t, which doesn't have a hash() method defined on it.
u_long
ACE_Hash_Map_Manager<KEY, VALUE, MUTEX>::hash (const KEY& ext_id)
{
return ext_id;
}
#endif /* ACE_HAS_TEMPLATE_SPECIALIZATION */
typedef ACE_Map_Manager <KEY, VALUE, MUTEX> MAP_MANAGER;
typedef ACE_Map_Iterator <KEY, VALUE, MUTEX> ITERATOR;
typedef ACE_Map_Reverse_Iterator <KEY, VALUE, MUTEX> REVERSE_ITERATOR;
typedef ACE_Map_Entry <KEY, VALUE> ENTRY;
typedef ACE_Hash_Map_Manager <KEY, VALUE, MUTEX> HASH_MAP_MANAGER;
typedef ACE_Hash_Map_Iterator <KEY, VALUE, MUTEX> HASH_ITERATOR;
typedef ACE_Hash_Map_Entry <KEY, VALUE> HASH_ENTRY;
static void
test_hash_map_manager (size_t table_size, size_t iterations)
{
HASH_MAP_MANAGER map (table_size);
VALUE i;
VALUE j;
for (i = 0; i < iterations; i++)
ACE_ASSERT (map.bind (KEY (i), i) != -1);
{
HASH_ITERATOR iterator (map);
for (HASH_ENTRY *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
continue;
}
{
HASH_MAP_MANAGER::ITERATOR iterator (map);
for (HASH_MAP_MANAGER::ENTRY *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
continue;
}
for (i = 0; i < iterations; i++)
{
ACE_ASSERT (map.find (KEY (i), j) != -1);
ACE_ASSERT (i == j);
}
for (i = 0; i < iterations; i++)
ACE_ASSERT (map.unbind (KEY (i)) != -1);
ACE_ASSERT (map.current_size () == 0);
}
static void
test_map_manager (size_t table_size, size_t iterations)
{
MAP_MANAGER map (table_size);
VALUE i;
VALUE j;
for (i = 0; i < iterations; i++)
ACE_ASSERT (map.bind (KEY (i), i) != -1);
{
ITERATOR iterator (map);
for (ENTRY *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
continue;
}
{
REVERSE_ITERATOR iterator (map);
for (ENTRY *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
continue;
}
{
MAP_MANAGER::ITERATOR iterator (map);
for (MAP_MANAGER::ENTRY *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
continue;
}
{
MAP_MANAGER::REVERSE_ITERATOR iterator (map);
for (MAP_MANAGER::ENTRY *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
continue;
}
for (i = 0; i < iterations; i++)
{
ACE_ASSERT (map.find (KEY (i), j) != -1);
ACE_ASSERT (i == j);
}
for (i = 0; i < iterations; i++)
ACE_ASSERT (map.unbind (KEY (i)) != -1);
ACE_ASSERT (map.current_size () == 0);
}
static void
run_test (void (*ptf) (size_t, size_t),
size_t table_size,
size_t iterations,
const char *test_name)
{
ACE_Profile_Timer timer;
timer.start ();
(*ptf) (table_size, iterations);
timer.stop ();
ACE_Profile_Timer::ACE_Elapsed_Time et;
timer.elapsed_time (et);
ACE_DEBUG ((LM_DEBUG, "time to test a %d item map for %d iterations using %s\n",
table_size, iterations, test_name));
ACE_DEBUG ((LM_DEBUG, "real time = %f secs, user time = %f secs, system time = %f secs\n",
et.real_time, et.user_time, et.system_time));
ACE_DEBUG ((LM_DEBUG, "time per call = %f usecs\n",
(et.real_time / double (iterations)) * 1000000));
}
int
main (int argc, char *argv[])
{
ACE_START_TEST ("Map_Manager_Test");
size_t table_size = ACE_MAX_ITERATIONS;
size_t iterations = ACE_MAX_ITERATIONS;
if (argc > 1)
table_size = ACE_OS::atoi (argv[1]);
if (argc > 2)
iterations = ACE_OS::atoi (argv[2]);
run_test (&test_hash_map_manager, table_size, iterations, "Hash_Map_Manager");
run_test (&test_map_manager, table_size, iterations, "Map_Manager");
ACE_END_TEST;
return 0;
}
#if defined (ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION)
template class ACE_Hash_Map_Manager<KEY, VALUE, MUTEX>;
template class ACE_Hash_Map_Iterator<KEY, VALUE, MUTEX>;
template class ACE_Hash_Map_Entry<KEY, VALUE>;
template class ACE_Map_Manager<KEY, VALUE, MUTEX>;
template class ACE_Map_Iterator<KEY, VALUE, MUTEX>;
template class ACE_Map_Reverse_Iterator<KEY, VALUE, MUTEX>;
template class ACE_Map_Entry<KEY, VALUE>;
#elif defined (ACE_HAS_TEMPLATE_INSTANTIATION_PRAGMA)
#pragma instantiate ACE_Hash_Map_Manager<KEY, VALUE, MUTEX>
#pragma instantiate ACE_Hash_Map_Iterator<KEY, VALUE, MUTEX>
#pragma instantiate ACE_Hash_Map_Entry<KEY, VALUE>
#pragma instantiate ACE_Map_Manager<KEY, VALUE, MUTEX>
#pragma instantiate ACE_Map_Iterator<KEY, VALUE, MUTEX>
#pragma instantiate ACE_Map_Reverse_Iterator<KEY, VALUE, MUTEX>
#pragma instantiate ACE_Map_Entry<KEY, VALUE>
#endif /* ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION */
|
