1 files changed, 23 insertions, 23 deletions

diff --git a/ACE/ace/Unbounded_Set_Ex.h b/ACE/ace/Unbounded_Set_Ex.h
index 7d5a3a4b6e3..c59c1ec81ae 100644
--- a/ACE/ace/Unbounded_Set_Ex.h
+++ b/ACE/ace/Unbounded_Set_Ex.h
@@ -62,17 +62,17 @@ public:
 
   /// Move forward by one element in the set.  Returns 0 when all the
   /// items in the set have been seen, else 1.
-  int advance (void);
+  int advance ();
 
   /// Move to the first element in the set.  Returns 0 if the
   /// set is empty, else 1.
-  int first (void);
+  int first ();
 
   /// Returns 1 when all items have been seen, else 0.
-  int done (void) const;
+  int done () const;
 
   /// Dump the state of an object.
-  void dump (void) const;
+  void dump () const;
 
   // = STL styled iteration, compare, and reference functions.
 
@@ -80,10 +80,10 @@ public:
   ACE_Unbounded_Set_Ex_Iterator<T, C> operator++ (int);
 
   /// Prefix advance.
-  ACE_Unbounded_Set_Ex_Iterator<T, C>& operator++ (void);
+  ACE_Unbounded_Set_Ex_Iterator<T, C>& operator++ ();
 
   /// Returns a reference to the internal element @c this is pointing to.
-  T& operator* (void);
+  T& operator* ();
 
   /// Check if two iterators point to the same position
   bool operator== (const ACE_Unbounded_Set_Ex_Iterator<T, C> &) const;
@@ -129,17 +129,17 @@ public:
 
   /// Move forward by one element in the set.  Returns 0 when all the
   /// items in the set have been seen, else 1.
-  int advance (void);
+  int advance ();
 
   /// Move to the first element in the set.  Returns 0 if the
   /// set is empty, else 1.
-  int first (void);
+  int first ();
 
   /// Returns 1 when all items have been seen, else 0.
-  int done (void) const;
+  int done () const;
 
   /// Dump the state of an object.
-  void dump (void) const;
+  void dump () const;
 
   // = STL styled iteration, compare, and reference functions.
 
@@ -147,10 +147,10 @@ public:
   ACE_Unbounded_Set_Ex_Const_Iterator<T, C> operator++ (int);
 
   /// Prefix advance.
-  ACE_Unbounded_Set_Ex_Const_Iterator<T, C>& operator++ (void);
+  ACE_Unbounded_Set_Ex_Const_Iterator<T, C>& operator++ ();
 
   /// Returns a reference to the internal element @c this is pointing to.
-  T& operator* (void);
+  T& operator* ();
 
   /// Check if two iterators point to the same position
   bool operator== (const ACE_Unbounded_Set_Ex_Const_Iterator<T, C> &) const;
@@ -258,7 +258,7 @@ public:
   /**
    * Destroy the nodes of the set.
    */
-  ~ACE_Unbounded_Set_Ex (void);
+  ~ACE_Unbounded_Set_Ex ();
 
   // = Check boundary conditions.
 
@@ -266,13 +266,13 @@ public:
   /**
    * Constant time is_empty check.
    */
-  bool is_empty (void) const;
+  bool is_empty () const;
 
   /// Returns @c false.
   /**
    * Always returns @c false since the set can never fill up.
    */
-  bool is_full (void) const;
+  bool is_full () const;
 
   // = Classic unordered set operations.
 
@@ -310,29 +310,29 @@ public:
   /**
    * Access the size of the set.
    */
-  size_t size (void) const;
+  size_t size () const;
 
   /// Dump the state of an object.
-  void dump (void) const;
+  void dump () const;
 
   /// Reset the ACE_Unbounded_Set_Ex to be empty.
   /**
    * Delete the nodes of the set.
    */
-  void reset (void);
+  void reset ();
 
   // = STL-styled unidirectional iterator factory.
-  iterator begin (void);
-  iterator end (void);
-  const_iterator begin (void) const;
-  const_iterator end (void) const;
+  iterator begin ();
+  iterator end ();
+  const_iterator begin () const;
+  const_iterator end () const;
 
   /// Declare the dynamic allocation hooks.
   ACE_ALLOC_HOOK_DECLARE;
 
 private:
   /// Delete all the nodes in the Set.
-  void delete_nodes (void);
+  void delete_nodes ();
 
   /// Copy nodes into this set.
   void copy_nodes (const ACE_Unbounded_Set_Ex<T, C> &);