diff options
Diffstat (limited to 'TAO/orbsvcs/orbsvcs/Naming/Naming_Service_Container.h')
-rw-r--r-- | TAO/orbsvcs/orbsvcs/Naming/Naming_Service_Container.h | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/TAO/orbsvcs/orbsvcs/Naming/Naming_Service_Container.h b/TAO/orbsvcs/orbsvcs/Naming/Naming_Service_Container.h index df514f3a72a..8897a02cde2 100644 --- a/TAO/orbsvcs/orbsvcs/Naming/Naming_Service_Container.h +++ b/TAO/orbsvcs/orbsvcs/Naming/Naming_Service_Container.h @@ -44,7 +44,7 @@ public: friend class ACE_Unbounded_List<T>; friend class ACE_Unbounded_List_Iterator<T>; - ~ACE_NS_Node (void); + ~ACE_NS_Node (); private: ACE_NS_Node (const T &i, ACE_NS_Node<T> *n); @@ -76,11 +76,11 @@ public: /// Move forward by one element in the List. Returns 0 when all the /// items in the List have been seen, else 1. - int advance (void); + int advance (); /// Move to the first element in the List. Returns 0 if the /// List is empty, else 1. - int first (void); + int first (); /// Returns 1 when all items have been seen, else 0. int done () const; @@ -94,10 +94,10 @@ public: ACE_Unbounded_List_Iterator<T> operator++ (int); /// Prefix advance. - ACE_Unbounded_List_Iterator<T>& operator++ (void); + ACE_Unbounded_List_Iterator<T>& operator++ (); /// Returns a reference to the interal element <this> is pointing to. - T& operator* (void); + T& operator* (); /// Check if two iterators point to the same position bool operator== (const ACE_Unbounded_List_Iterator<T> &) const; @@ -144,7 +144,7 @@ public: void operator= (const ACE_Unbounded_List<T> &); /// Destructor. - ~ACE_Unbounded_List (void); + ~ACE_Unbounded_List (); // = Check boundary conditions. @@ -177,11 +177,11 @@ public: void dump () const; /// Reset the <ACE_Unbounded_List> to be empty. - void reset (void); + void reset (); // = STL-styled unidirectional iterator factory. - ACE_Unbounded_List_Iterator<T> begin (void); - ACE_Unbounded_List_Iterator<T> end (void); + ACE_Unbounded_List_Iterator<T> begin (); + ACE_Unbounded_List_Iterator<T> end (); /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -192,7 +192,7 @@ private: int insert_tail (const T &item); /// Delete all the nodes in the List. - void delete_nodes (void); + void delete_nodes (); /// Copy nodes into this set. void copy_nodes (const ACE_Unbounded_List<T> &); |