diff options
Diffstat (limited to 'ACE/ace/Containers_T.h')
| -rw-r--r-- | ACE/ace/Containers_T.h | 200 |
1 files changed, 100 insertions, 100 deletions
diff --git a/ACE/ace/Containers_T.h b/ACE/ace/Containers_T.h index 90a967b6f6b..5cbbca05813 100644 --- a/ACE/ace/Containers_T.h +++ b/ACE/ace/Containers_T.h @@ -103,7 +103,7 @@ public: /** * Deallocate the memory used by the Bounded_Stack. */ - ~ACE_Bounded_Stack (void); + ~ACE_Bounded_Stack (); // = Classic Stack operations. @@ -137,22 +137,22 @@ public: /** * Performs constant time check to determine if the stack is empty. */ - int is_empty (void) const; + int is_empty () const; /// Returns 1 if the container is full, otherwise returns 0. /** * Performs constant time check to determine if the stack is at capacity. */ - int is_full (void) const; + int is_full () const; /// The number of items in the stack. /** * Return the number of items currently in the stack. */ - size_t size (void) const; + size_t size () const; /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -210,7 +210,7 @@ public: /** * Initialize an empty stack. */ - ACE_Fixed_Stack (void); + ACE_Fixed_Stack (); /// The copy constructor (performs initialization). /** @@ -228,7 +228,7 @@ public: /** * Destroy the stack. */ - ~ACE_Fixed_Stack (void); + ~ACE_Fixed_Stack (); // = Classic Stack operations. @@ -262,22 +262,22 @@ public: /** * Performs constant time check to see if stack is empty. */ - int is_empty (void) const; + int is_empty () const; /// Returns 1 if the container is full, otherwise returns 0. /** * Performs constant time check to see if stack is full. */ - int is_full (void) const; + int is_full () const; /// The number of items in the stack. /** * Constant time access to the current size of the stack. */ - size_t size (void) const; + size_t size () const; /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -311,7 +311,7 @@ class ACE_DNode public: /// This isn't necessary, but it keeps some compilers happy. - ~ACE_DNode (void); + ~ACE_DNode (); /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -399,7 +399,7 @@ public: /** * Destroy the underlying list for the stack. */ - ~ACE_Unbounded_Stack (void); + ~ACE_Unbounded_Stack (); // = Classic Stack operations. @@ -434,13 +434,13 @@ public: /** * Constant time check to see if the stack is empty. */ - int is_empty (void) const; + int is_empty () const; /// Returns 1 if the container is full, otherwise returns 0. /** * Always resturns 0 since the stack is unbounded. */ - int is_full (void) const; + int is_full () const; // = Auxiliary methods (not strictly part of the Stack ADT). @@ -469,17 +469,17 @@ public: /** * Constant time access to the current stack size. */ - size_t size (void) const; + size_t size () const; /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; private: /// Delete all the nodes in the stack. - void delete_all_nodes (void); + void delete_all_nodes (); /// Copy all nodes from {s} to {this}. void copy_all_nodes (const ACE_Unbounded_Stack<T> &s); @@ -514,17 +514,17 @@ public: /// Move forward by one element in the Stack. Returns 0 when all the /// items in the Stack have been seen, else 1. - int advance (void); + int advance (); /// Move to the first element in the Stack. Returns 0 if the /// Stack 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; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -560,14 +560,14 @@ public: * @deprecated Return the address of next (current) unvisited item in * the list. 0 if there is no more element available. */ - T *next (void) const; + T *next () const; /// Returns 1 when all items have been seen, else 0. - int done (void) const; + int done () const; /// STL-like iterator dereference operator: returns a reference /// to the node underneath the iterator. - T & operator* (void) const ; + T & operator* () const ; /** * Retasks the iterator to iterate over a new @@ -598,11 +598,11 @@ protected: * @note the head of the ACE_DLList is actually a null entry, so the * first element is actually the 2n'd entry */ - int go_head (void); + int go_head (); /// Move to the last element of the list. Returns 0 if the list is /// empty, else 1. - int go_tail (void); + int go_tail (); /** * Check if we reach the end of the list. Can also be used to get @@ -610,18 +610,18 @@ protected: * current item if there are still elements left , 0 if we run out * of element. */ - T *not_done (void) const ; + T *not_done () const ; /// Advance to the next element in the list. Return the address of the /// next element if there are more, 0 otherwise. - T *do_advance (void); + T *do_advance (); /// Retreat to the previous element in the list. Return the address /// of the previous element if there are more, 0 otherwise. - T *do_retreat (void); + T *do_retreat (); /// Dump the state of an object. - void dump_i (void) const; + void dump_i () const; /// Remember where we are. T *current_; @@ -661,11 +661,11 @@ public: /// Move to the first element in the list. Returns 0 if the /// list is empty, else 1. - int first (void); + int first (); /// 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 (); /** * Advance the iterator while removing the original item from the @@ -678,19 +678,19 @@ public: // = STL-style iteration methods /// Prefix advance. - ACE_Double_Linked_List_Iterator<T> & operator++ (void); + ACE_Double_Linked_List_Iterator<T> & operator++ (); /// Postfix advance. ACE_Double_Linked_List_Iterator<T> operator++ (int); /// Prefix reverse. - ACE_Double_Linked_List_Iterator<T> & operator-- (void); + ACE_Double_Linked_List_Iterator<T> & operator-- (); /// Postfix reverse. ACE_Double_Linked_List_Iterator<T> operator-- (int); /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -729,11 +729,11 @@ public: /// Move to the first element in the list. Returns 0 if the /// list is empty, else 1. - int first (void); + int first (); /// 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 (); /** * Advance the iterator while removing the original item from the @@ -746,19 +746,19 @@ public: // = STL-style iteration methods /// Prefix advance. - ACE_Double_Linked_List_Reverse_Iterator<T> & operator++ (void); + ACE_Double_Linked_List_Reverse_Iterator<T> & operator++ (); /// Postfix advance. ACE_Double_Linked_List_Reverse_Iterator<T> operator++ (int); /// Prefix reverse. - ACE_Double_Linked_List_Reverse_Iterator<T> & operator-- (void); + ACE_Double_Linked_List_Reverse_Iterator<T> & operator-- (); /// Postfix reverse. ACE_Double_Linked_List_Reverse_Iterator<T> operator-- (int); /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -846,7 +846,7 @@ public: /** * Clean up the memory allocated for the nodes of the list. */ - ~ACE_Double_Linked_List (void); + ~ACE_Double_Linked_List (); // = Check boundary conditions. @@ -854,13 +854,13 @@ public: /** * Performs constant time check to determine if the list is empty. */ - int is_empty (void) const; + int is_empty () const; /// The list is unbounded, so this always returns 0. /** * Since the list is unbounded, the method simply returns 0. */ - int is_full (void) const; + int is_full () const; // = Classic queue operations. @@ -884,7 +884,7 @@ public: * internal node's address on success, 0 if the queue was empty. * This method will *not* free the internal node. */ - T* delete_head (void); + T* delete_head (); /// Removes the tail of the list and returns a pointer to that item. /** @@ -892,7 +892,7 @@ public: * internal nodes's address on success, 0 if the queue was * empty. This method will *not* free the internal node. */ - T *delete_tail (void); + T *delete_tail (); // = Additional utility methods. @@ -902,7 +902,7 @@ public: * Notice that since no one is interested in the items within, * This operation will delete all items. */ - void reset (void); + void reset (); /// Get the {slot}th element in the set. Returns -1 if the element /// isn't in the range {0..{size} - 1}, else 0. @@ -916,10 +916,10 @@ public: /** * Constant time call to return the current size of the list. */ - size_t size (void) const; + size_t size () const; /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Use DNode address directly. /** @@ -935,7 +935,7 @@ protected: /** * Removes and deallocates memory for all of the list nodes. */ - void delete_nodes (void); + void delete_nodes (); /// Copy nodes from {rhs} into this list. /** @@ -948,7 +948,7 @@ protected: /** * Initialize the head pointer so that the list has a dummy node. */ - void init_head (void); + void init_head (); ///Constant time insert a new item into the list structure. /** @@ -1052,7 +1052,7 @@ public: * @return Pointer to previously inserted item; 0 if the list is empty, * an error occurred, or the original pointer inserted was 0. */ - T *delete_head (void); + T *delete_head (); /** * Removes the item at the tail of the list and returns its pointer. @@ -1060,7 +1060,7 @@ public: * @return Pointer to previously inserted item; 0 if the list is empty, * an error occurred, or the original pointer inserted was 0. */ - T *delete_tail (void); + T *delete_tail (); //@} /** @@ -1076,7 +1076,7 @@ public: int get (T *&item, size_t slot = 0); /// Delegates to ACE_Double_Linked_List. - void dump (void) const; + void dump () const; /// Delegates to ACE_Double_Linked_List. int remove (ACE_DLList_Node *n); @@ -1107,7 +1107,7 @@ public: delete *p; @endcode */ - ~ACE_DLList (void); + ~ACE_DLList (); }; /** @@ -1142,7 +1142,7 @@ public: // = Iteration methods. /// 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 (); /// Pass back the {next_item} that hasn't been seen in the list. /// Returns 0 when all items have been seen, else 1. @@ -1153,7 +1153,7 @@ public: * whereas the Double_Linked_List version of next returns the node, this next * returns the contents of the node */ - T *next (void) const; + T *next () const; /** * Removes the current item (i.e., {next}) from the list. @@ -1161,10 +1161,10 @@ public: * directly (defined in its base class) and you will need to * release the element returned by it. */ - int remove (void); + int remove (); /// Delegates to ACE_Double_Linked_List_Iterator. - void dump (void) const; + void dump () const; private: ACE_DLList<T> *list_; @@ -1202,23 +1202,23 @@ public: // = Iteration methods. /// 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 (); /// Pass back the {next_item} that hasn't been seen in the list. /// Returns 0 when all items have been seen, else 1. int next (T *&); /// @deprecated Delegates to ACE_Double_Linked_List_Iterator. - T *next (void) const; + T *next () const; /// Removes the current item (i.e., {next}) from the list. /// Note that DLList iterators do not support {advance_and_remove} /// directly (defined in its base class) and you will need to /// release the element returned by it. - int remove (void); + int remove (); /// Delegates to ACE_Double_Linked_List_Iterator. - void dump (void) const; + void dump () const; private: ACE_DLList<T> *list_; @@ -1245,14 +1245,14 @@ 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; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -1270,7 +1270,7 @@ protected: size_t iterated_items_; /// Dump the state of an object. - void dump_i (void) const; + void dump_i () const; /// Pass back the {next_item} that hasn't been seen in the Set. /// Returns 0 when all items have been seen, else 1. @@ -1298,7 +1298,7 @@ public: int next (T *&next_item); /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Remove the item where the itearetor is located at. /// Returns 1 if it removes a item, else 0. @@ -1307,7 +1307,7 @@ public: /// STL-like iterator dereference operator: returns a reference /// to the node underneath the iterator. - T & operator* (void); + T & operator* (); /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -1333,11 +1333,11 @@ public: int next (const T *&next_item); /// Dump the state of an object. - void dump (void) const; + void dump () const; /// STL-like iterator dereference operator: returns a reference /// to the node underneath the iterator. - const T & operator* (void) const ; + const T & operator* () const ; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -1391,7 +1391,7 @@ public: /** * Creates an empy set */ - ACE_Fixed_Set (void); + ACE_Fixed_Set (); /// Copy constructor. /** @@ -1409,7 +1409,7 @@ public: /** * Destroys a set. */ - ~ACE_Fixed_Set (void); + ~ACE_Fixed_Set (); // = Check boundary conditions. @@ -1417,13 +1417,13 @@ public: /** * Performs constant time check to determine if a set is empty. */ - int is_empty (void) const; + int is_empty () const; /// Returns 1 if the container is full, otherwise returns 0. /** * Performs a constant time check to see if the set is full. */ - int is_full (void) const; + int is_full () const; // = Classic unordered set operations. @@ -1453,10 +1453,10 @@ public: /** * Returns the current 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; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -1505,17 +1505,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; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -1584,7 +1584,7 @@ public: * The default constructor initializes the Bounded_Set to a maximum size * specified by the DEFAULT_SIZE. */ - ACE_Bounded_Set (void); + ACE_Bounded_Set (); /// Construct a Bounded_Set with the provided sizeB. /** @@ -1612,7 +1612,7 @@ public: * Clean up the underlying dynamically allocated memory that is used by * the Bounded_Set. */ - ~ACE_Bounded_Set (void); + ~ACE_Bounded_Set (); // = Check boundary conditions. @@ -1621,14 +1621,14 @@ public: * A constant time check is performed to determine if the Bounded_Set is * empty. */ - int is_empty (void) const; + int is_empty () const; /// Returns 1 if the container is full, otherwise returns 0. /** * Performs a constant time check to determine if the Bounded_Set is at * capacity. */ - int is_full (void) const; + int is_full () const; // = Classic unordered set operations. @@ -1661,10 +1661,10 @@ public: /** * Returns a size_t representing the current 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; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -1713,28 +1713,28 @@ public: /// Repositions the iterator at the first item in the ordered multiset /// Returns 0 if the list is empty else 1. - int first (void); + int first (); /// Repositions the iterator at the last item in the ordered multiset /// Returns 0 if the list is empty else 1. - int last (void); + int last (); /// 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 backward by one element in the set. Returns 0 when all the /// items in the set have been seen, else 1. - int retreat (void); + int retreat (); /// 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; /// Returns a reference to the internal element {this} is pointing to. - T& operator* (void); + T& operator* (); /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -1808,7 +1808,7 @@ public: /** * Delete the nodes of the set. */ - ~ACE_Ordered_MultiSet (void); + ~ACE_Ordered_MultiSet (); /// Assignment operator. /** @@ -1822,13 +1822,13 @@ public: /** * Constant time check to determine if the set is empty. */ - int is_empty (void) const; + int is_empty () const; /// Size of the set. /** * Constant time check to determine the size of the set. */ - size_t size (void) const; + size_t size () const; // = Classic unordered set operations. @@ -1868,10 +1868,10 @@ public: /** * Delete the nodes inside the set. */ - void reset (void); + void reset (); /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -1900,7 +1900,7 @@ private: ACE_DNode<T> *&new_position) const; /// Delete all the nodes in the Set. - void delete_nodes (void); + void delete_nodes (); /// Copy nodes into this set. void copy_nodes (const ACE_Ordered_MultiSet<T> &); |