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
|
// $Id$
#include "ace/Log_Msg.h"
#include "ace/Map_Manager.h"
#include "ace/Synch.h" // Needed for the lock.
#include "DataElement.h"
#include "KeyType.h"
/*
** This needs to stay in the book for 2nd printing, but is the same as
** what's in KeyType.h.
*/
#if 0
// Listing 1 code/ch05
class KeyType
{
public:
KeyType () : val_(0) {}
KeyType (int i) : val_(i) {}
KeyType (const KeyType& kt) { this->val_ = kt.val_; };
operator int () const { return val_; };
private:
int val_;
};
template<>
int
ACE_Map_Manager<KeyType, DataElement, ACE_Null_Mutex>::equal
(const KeyType& r1, const KeyType &r2)
{
return (r1 == r2);
}
// Listing 1
#else
ACE_BEGIN_VERSIONED_NAMESPACE_DECL
template<>
int
ACE_Map_Manager<KeyType, DataElement, ACE_Null_Mutex>::equal
(const KeyType& r1, const KeyType &r2)
{
return (r1 == r2);
}
ACE_END_VERSIONED_NAMESPACE_DECL
#endif /* 0 */
class Map_Example
{
public:
// Illustrate the ACE_Map_Manager<>.
int run (void);
private:
// Iterate in the forward direction.
void iterate_forward (void);
// Iterate in the other direction.
void iterate_reverse (void);
// Remove all elements from the map.
void remove_all (void);
private:
ACE_Map_Manager<KeyType,DataElement,ACE_Null_Mutex> map_;
};
int Map_Example::run (void)
{
ACE_TRACE ("Map_Example::run");
// Corresponding KeyType objects are created on the fly.
for (int i = 0; i < 100; i++)
{
map_.bind (i, DataElement (i));
}
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Map has\n")));
for (int j = 0; j < 100; j++)
{
DataElement d;
int result = map_.find (j,d);
if (result == 0)
{
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("%d:"), d.getData ()));
}
}
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
// Iterate in the forward direction.
this->iterate_forward ();
// Iterate in the other direction.
this->iterate_reverse ();
// Remove all elements from the map.
this->remove_all ();
// Iterate in the forward direction.
this->iterate_forward ();
return 0;
}
void Map_Example::iterate_forward (void)
{
ACE_TRACE ("Map_Example::iterate_forward");
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Forward iteration\n")));
for (ACE_Map_Manager<KeyType, DataElement, ACE_Null_Mutex>::iterator
iter = map_.begin ();
iter!= map_.end ();
iter++)
{
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("%d:"), (*iter).int_id_.getData ()));
}
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
}
void Map_Example::iterate_reverse (void)
{
ACE_TRACE ("Map_Example::iterate_reverse");
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Reverse iteration\n")));
for (ACE_Map_Manager<KeyType, DataElement, ACE_Null_Mutex>::reverse_iterator
iter = map_.rbegin ();
iter!= map_.end ();
iter++)
{
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("%d:"), (*iter).int_id_.getData ()));
}
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
}
void Map_Example::remove_all (void)
{
ACE_TRACE ("Map_Example::remove_all");
// Note that we can't use the iterators here
// as they are invalidated after deletions
// or insertions.
for (int i = 0; i < 100; i++)
{
map_.unbind (i);
}
}
int ACE_TMAIN (int, ACE_TCHAR *[])
{
Map_Example me;
return me.run ();
}
|
