diff options
| -rw-r--r-- | ChangeLog | 4 | ||||
| -rw-r--r-- | ChangeLogs/ChangeLog-02a | 4 | ||||
| -rw-r--r-- | ChangeLogs/ChangeLog-03a | 4 | ||||
| -rw-r--r-- | ace/Containers_T.cpp | 8 |
4 files changed, 15 insertions, 5 deletions
diff --git a/ChangeLog b/ChangeLog index a0f0e8c5063..73bd55e0b8d 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,7 +1,9 @@ Wed Apr 19 07:04:13 2000 Douglas C. Schmidt <schmidt@tango.cs.wustl.edu> * ace/Containers_T.cpp (copy_nodes): insert_head() should have - been insert_tail(). Thanks to Umar for clarifying this. + been insert_tail(). Thanks to Umar Syyid for clarifying this. + Also, added some comments to explain what's going on in + insert_tail() since the code was somewhat non-intuitive ;-). Wed Apr 19 15:00:44 2000 Carlos O'Ryan <coryan@uci.edu> diff --git a/ChangeLogs/ChangeLog-02a b/ChangeLogs/ChangeLog-02a index a0f0e8c5063..73bd55e0b8d 100644 --- a/ChangeLogs/ChangeLog-02a +++ b/ChangeLogs/ChangeLog-02a @@ -1,7 +1,9 @@ Wed Apr 19 07:04:13 2000 Douglas C. Schmidt <schmidt@tango.cs.wustl.edu> * ace/Containers_T.cpp (copy_nodes): insert_head() should have - been insert_tail(). Thanks to Umar for clarifying this. + been insert_tail(). Thanks to Umar Syyid for clarifying this. + Also, added some comments to explain what's going on in + insert_tail() since the code was somewhat non-intuitive ;-). Wed Apr 19 15:00:44 2000 Carlos O'Ryan <coryan@uci.edu> diff --git a/ChangeLogs/ChangeLog-03a b/ChangeLogs/ChangeLog-03a index a0f0e8c5063..73bd55e0b8d 100644 --- a/ChangeLogs/ChangeLog-03a +++ b/ChangeLogs/ChangeLog-03a @@ -1,7 +1,9 @@ Wed Apr 19 07:04:13 2000 Douglas C. Schmidt <schmidt@tango.cs.wustl.edu> * ace/Containers_T.cpp (copy_nodes): insert_head() should have - been insert_tail(). Thanks to Umar for clarifying this. + been insert_tail(). Thanks to Umar Syyid for clarifying this. + Also, added some comments to explain what's going on in + insert_tail() since the code was somewhat non-intuitive ;-). Wed Apr 19 15:00:44 2000 Carlos O'Ryan <coryan@uci.edu> diff --git a/ace/Containers_T.cpp b/ace/Containers_T.cpp index c7587780cdb..a8998b0aea1 100644 --- a/ace/Containers_T.cpp +++ b/ace/Containers_T.cpp @@ -478,7 +478,9 @@ ACE_Unbounded_Queue<T>::enqueue_head (const T &new_item) (ACE_Node<T> *) this->allocator_->malloc (sizeof (ACE_Node<T>)), ACE_Node<T> (new_item, this->head_->next_), -1); - // Link this pointer into the front of the list. + // Link this pointer into the front of the list. Note that the + // "real" head of the queue is <head_->next_>, whereas <head_> is + // just a pointer to the dummy node. this->head_->next_ = temp; this->cur_size_++; @@ -492,7 +494,9 @@ ACE_Unbounded_Queue<T>::enqueue_tail (const T &new_item) ACE_Node<T> *temp; - // Insert <item> into the old dummy node location. + // Insert <item> into the old dummy node location. Note that this + // isn't actually the "head" item in the queue, it's a dummy node at + // the "tail" of the queue... this->head_->item_ = new_item; // Create a new dummy node. |