*** empty log message ***

2 files changed, 29 insertions, 1 deletions

diff --git a/ace/Containers.h b/ace/Containers.h
index 787f8bc3c29..6a1cf76614b 100644
--- a/ace/Containers.h
+++ b/ace/Containers.h
@@ -68,6 +68,9 @@ public:
   int is_full (void) const;
   // Returns 1 if the container is full, otherwise returns 0. 
 
+  size_t size (void) const;
+  // The number of items in the stack.
+
   void dump (void) const;
   // Dump the state of an object.
 
@@ -135,6 +138,9 @@ public:
   int is_full (void) const;
   // Returns 1 if the container is full, otherwise returns 0. 
 
+  size_t size (void) const;
+  // The number of items in the stack.
+
   void dump (void) const;
   // Dump the state of an object.
 
@@ -197,6 +203,7 @@ class ACE_Unbounded_Stack
   // = DESCRIPTION
   //     This implementation of an unbounded Stack uses a linked list.
 {
+  friend class ACE_Unbounded_Stack_Iterator<T>;
 public:
   // = Initialization, assignemnt, and termination methods.
   ACE_Unbounded_Stack (void);
@@ -250,6 +257,9 @@ public:
   int find (const T &item) const;
   // Finds if <item> occurs the set.  Returns 1 if finds, else 0.
 
+  size_t size (void) const;
+  // The number of items in the stack.
+
   void dump (void) const;
   // Dump the state of an object.
 
diff --git a/ace/Containers.i b/ace/Containers.i
index 87ea4b4016a..2ca3093f72c 100644
--- a/ace/Containers.i
+++ b/ace/Containers.i
@@ -56,6 +56,12 @@ ACE_Bounded_Stack<T>::top (T &item) const
     return 0;
 }
 
+template <class T> ACE_INLINE size_t
+ACE_Bounded_Stack<T>::size (void) const
+{
+  return this->size_;
+}
+
 //----------------------------------------
 
 template <class T, size_t SIZE> ACE_INLINE int 
@@ -111,6 +117,12 @@ ACE_Fixed_Stack<T, SIZE>::top (T &item) const
     return 0;
 }
 
+template <class T, size_t SIZE> ACE_INLINE size_t
+ACE_Fixed_Stack<T, SIZE>::size (void) const
+{
+  return this->size_;
+}
+
 //----------------------------------------
 
 template <class T> ACE_INLINE int 
@@ -141,13 +153,19 @@ ACE_Unbounded_Stack<T>::is_full (void) const
 }
 
 template <class T> ACE_INLINE size_t
-ACE_Unbounded_Queue<T>::size (void) const
+ACE_Unbounded_Stack<T>::size (void) const
 {
   return this->cur_size_;
 }
 
 // --- 
 
+template <class T> ACE_INLINE size_t
+ACE_Unbounded_Queue<T>::size (void) const
+{
+  return this->cur_size_;
+}
+
 template <class T> ACE_INLINE int 
 ACE_Unbounded_Queue<T>::is_empty (void) const
 {