ACE/examples/APG/Containers/RB_Tree.cpp

   1 #include "ace/RB_Tree.h"
   2 #include "ace/Log_Msg.h"
   3 #include "ace/Synch.h"
   4 #include "DataElement.h"
   5
   6 // Little helper class.
   7 template<class EXT_ID, class INT_ID>
   8 class Tree : public ACE_RB_Tree<EXT_ID, INT_ID,
   9                                 ACE_Less_Than<EXT_ID>,
  10                                 ACE_Null_Mutex>
  11 {};
  12
  13 class Tree_Example
  14 {
  15 public:
  16   // Illustrate the tree.
  17   int run ();
  18
  19 private:
  20   // Use the forward iterator.
  21   void iterate_forward ();
  22
  23   // Use the reverse iterator.
  24   void iterate_reverse ();
  25
  26   // Remove all elements from the tree.
  27   int remove_all ();
  28
  29 private:
  30   Tree<int, DataElement*> tree_;
  31 };
  32
  33 // Listing 1 code/ch05
  34 int Tree_Example::run ()
  35 {
  36   ACE_TRACE ("Tree_Example::run");
  37
  38   DataElement *d  = 0;
  39   for (int i = 0; i < 100; i++)
  40     {
  41       ACE_NEW_RETURN (d, DataElement (i), -1);
  42       int result = tree_.bind (i, d);
  43       if (result!= 0)
  44         {
  45           ACE_ERROR_RETURN ((LM_ERROR, ACE_TEXT ("%p\n"),
  46                              ACE_TEXT ("Bind")),
  47                             -1);
  48         }
  49     }
  50
  51   ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Using find:\n")));
  52   for (int j = 0; j < 100; j++)
  53     {
  54       tree_.find (j, d);
  55       ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("%d:"), d->getData ()));
  56     }
  57   ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
  58
  59   // Use the forward iterator.
  60   this->iterate_forward ();
  61
  62   // Use the reverse iterator.
  63   this->iterate_reverse ();
  64
  65   // Remove all elements from the tree.
  66   ACE_ASSERT (this->remove_all ()!= -1);
  67
  68   // Iterate through once again.
  69   this->iterate_forward ();
  70
  71   return 0;
  72 }
  73
  74 void Tree_Example::iterate_forward ()
  75 {
  76   ACE_TRACE ("Tree_Example::iterate_forward");
  77
  78   ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Forward Iteration:\n")));
  79   for (Tree<int, DataElement*>::iterator iter = tree_.begin ();
  80        iter != tree_.end (); iter++)
  81     {
  82       ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("%d:"),
  83                   (*iter).item ()->getData ()));
  84     }
  85   ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
  86 }
  87
  88 void Tree_Example::iterate_reverse ()
  89 {
  90   ACE_TRACE ("Tree_Example::iterate_reverse");
  91
  92   ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Reverse Iteration:\n")));
  93   for (Tree<int, DataElement*>::reverse_iterator iter
  94          = tree_.rbegin ();
  95        iter != tree_.rend (); iter++)
  96     {
  97       ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("%d:"),
  98                   (*iter).item ()->getData ()));
  99     }
 100   ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("\n")));
 101 }
 102
 103 int Tree_Example::remove_all ()
 104 {
 105   ACE_TRACE ("Tree_Example::remove_all");
 106   ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Removing elements\n")));
 107
 108   // Note that we can't use the iterators here as they are
 109   // invalidated after deletions or insertions.
 110   for (int i = 0; i < 100; i++)
 111     {
 112       DataElement * d = 0;
 113       int result = tree_.unbind (i, d);
 114       if (result != 0)
 115         {
 116           ACE_ERROR_RETURN ((LM_ERROR, ACE_TEXT ("%p\n"),
 117                              ACE_TEXT ("Unbind")),
 118                             -1);
 119         }
 120       ACE_ASSERT (d!= 0);
 121       delete d;
 122     }
 123
 124   return 0;
 125 }
 126 // Listing 1
 127
 128 int ACE_TMAIN (int, ACE_TCHAR *[])
 129 {
 130   Tree_Example te;
 131   return te.run ();
 132 }
 133