diff options
| -rw-r--r-- | ace/Hash_Map_Manager.cpp | 32 | ||||
| -rw-r--r-- | ace/Hash_Map_Manager.h | 10 |
2 files changed, 0 insertions, 42 deletions
diff --git a/ace/Hash_Map_Manager.cpp b/ace/Hash_Map_Manager.cpp index 47475036f12..1116cff29dd 100644 --- a/ace/Hash_Map_Manager.cpp +++ b/ace/Hash_Map_Manager.cpp @@ -687,19 +687,6 @@ ACE_Hash_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK>::reverse_i (void) return 1; } -// Resets the iterator, to the beginning or the end depending on the -// head value. -template <class EXT_ID, class INT_ID, class ACE_LOCK> void -ACE_Hash_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK>::reset_i (int head) -{ - index_ = (head != 0 ? -1 : ACE_static_cast (ssize_t, - this->map_man_->total_size_)); - next_ = 0; - ACE_TRACE ("ACE_Hash_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK>::ACE_Hash_Map_Iterator_Base"); - if (this->map_man_->table_ != 0) - this->next_ = &this->map_man_->table_[ (head != 0 ? 0 : this->map_man_->total_size_ - 1 ) ]; -} - template <class EXT_ID, class INT_ID, class ACE_LOCK> ACE_Hash_Map_Entry<EXT_ID, INT_ID>& ACE_Hash_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK>::operator* (void) @@ -767,16 +754,6 @@ ACE_Hash_Map_Iterator<EXT_ID, INT_ID, ACE_LOCK>::advance (void) return this->forward_i (); } -// Resets the iterator to the beginning of the Table. -template <class EXT_ID, class INT_ID, class ACE_LOCK> void -ACE_Hash_Map_Iterator<EXT_ID, INT_ID, ACE_LOCK>::reset (int tail) -{ - ACE_TRACE ("ACE_Hash_Map_Iterator<EXT_ID, INT_ID, ACE_LOCK>::reset"); - this->reset_i (1); - if (tail == 0) - this->forward_i (); -} - template <class EXT_ID, class INT_ID, class ACE_LOCK> ACE_Hash_Map_Iterator<EXT_ID, INT_ID, ACE_LOCK> ACE_Hash_Map_Iterator<EXT_ID, INT_ID, ACE_LOCK>::operator++ (void) @@ -843,15 +820,6 @@ ACE_Hash_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::advance (void) return this->reverse_i (); } -// Resets the iterator to the end. -template <class EXT_ID, class INT_ID, class ACE_LOCK> void -ACE_Hash_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::reset (int head) -{ - this->reset_i (head); - if (head == 0) - this->reverse_i (); -} - template <class EXT_ID, class INT_ID, class ACE_LOCK> ACE_Hash_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK> ACE_Hash_Map_Reverse_Iterator<EXT_ID, INT_ID, ACE_LOCK>::operator++ (void) diff --git a/ace/Hash_Map_Manager.h b/ace/Hash_Map_Manager.h index 7e19ee6cbe0..81e0129675d 100644 --- a/ace/Hash_Map_Manager.h +++ b/ace/Hash_Map_Manager.h @@ -358,10 +358,6 @@ protected: // Move backward by one element in the set. Returns 0 when there's // no more item in the set before the current item, else 1. - void reset_i (int head); - // If head != 0, the iterator reset to the head of the map else it - // is positioned to the end. - void dump_i (void) const; // Dump the state of an object. @@ -395,9 +391,6 @@ public: // Move forward by one element in the set. Returns 0 when all the // items in the set have been seen, else 1. - void reset (int tail = 0); - // Resets the iterator to the begining, if one exists. - void dump (void) const; // Dump the state of an object. @@ -438,9 +431,6 @@ public: // Move forward by one element in the set. Returns 0 when all the // items in the set have been seen, else 1. - void reset (int head = 0); - // Resets the iterator to the end again. - void dump (void) const; // Dump the state of an object. |