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
|
// $Id: RB_Tree.cpp 94310 2011-07-09 19:10:06Z schmidt $
#include "ace/RB_Tree.h"
#include "ace/Log_Msg.h"
#include "ace/Synch.h"
#include "DataElement.h"
// Little helper class.
template<class EXT_ID, class INT_ID>
class Tree : public ACE_RB_Tree<EXT_ID, INT_ID,
ACE_Less_Than<EXT_ID>,
ACE_Null_Mutex>
{};
class Tree_Example
{
public:
// Illustrate the tree.
int run (void);
private:
// Use the forward iterator.
void iterate_forward (void);
// Use the reverse iterator.
void iterate_reverse (void);
// Remove all elements from the tree.
int remove_all (void);
private:
Tree<int, DataElement*> tree_;
};
// Listing 1 code/ch05
int Tree_Example::run (void)
{
ACE_TRACE ("Tree_Example::run");
DataElement *d = 0;
for (int i = 0; i < 100; i++)
{
ACE_NEW_RETURN (d, DataElement (i), -1);
int result = tree_.bind (i, d);
if (result!= 0)
{
ACE_ERROR_RETURN ((LM_ERROR, ACE_TEXT ("%p\n"),
ACE_TEXT ("Bind")),
-1);
}
}
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Using find:\n")));
for (int j = 0; j < 100; j++)
{
tree_.find (j, d);
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("%d:"), d->getData ()));
}
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
// Use the forward iterator.
this->iterate_forward ();
// Use the reverse iterator.
this->iterate_reverse ();
// Remove all elements from the tree.
ACE_ASSERT (this->remove_all ()!= -1);
// Iterate through once again.
this->iterate_forward ();
return 0;
}
void Tree_Example::iterate_forward (void)
{
ACE_TRACE ("Tree_Example::iterate_forward");
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Forward Iteration:\n")));
for (Tree<int, DataElement*>::iterator iter = tree_.begin ();
iter != tree_.end (); iter++)
{
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("%d:"),
(*iter).item ()->getData ()));
}
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
}
void Tree_Example::iterate_reverse (void)
{
ACE_TRACE ("Tree_Example::iterate_reverse");
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Reverse Iteration:\n")));
for (Tree<int, DataElement*>::reverse_iterator iter
= tree_.rbegin ();
iter != tree_.rend (); iter++)
{
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("%d:"),
(*iter).item ()->getData ()));
}
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
}
int Tree_Example::remove_all (void)
{
ACE_TRACE ("Tree_Example::remove_all");
ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Removing elements\n")));
// Note that we can't use the iterators here as they are
// invalidated after deletions or insertions.
for (int i = 0; i < 100; i++)
{
DataElement * d = 0;
int result = tree_.unbind (i, d);
if (result != 0)
{
ACE_ERROR_RETURN ((LM_ERROR, ACE_TEXT ("%p\n"),
ACE_TEXT ("Unbind")),
-1);
}
ACE_ASSERT (d!= 0);
delete d;
}
return 0;
}
// Listing 1
int ACE_TMAIN (int, ACE_TCHAR *[])
{
Tree_Example te;
return te.run ();
}
|
