diff options
| author | Steve Huston <shuston@riverace.com> | 1999-06-15 19:53:48 +0000 |
|---|---|---|
| committer | Steve Huston <shuston@riverace.com> | 1999-06-15 19:53:48 +0000 |
| commit | 93214f7ba2b10e918328f4875182ca889ef82725 (patch) | |
| tree | 50db320c326d636f4aa584957d821498340f2b74 /ace/Containers_T.cpp | |
| parent | b1dee563ce1f606b6aae92ba4eb34988d7cde984 (diff) | |
| download | ATCD-93214f7ba2b10e918328f4875182ca889ef82725.tar.gz | |
Added ACE_TYPENAME where HP-UX aC++ complained it was needed.
Diffstat (limited to 'ace/Containers_T.cpp')
| -rw-r--r-- | ace/Containers_T.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/ace/Containers_T.cpp b/ace/Containers_T.cpp index 15d6dda2c4b..83b4f168e3d 100644 --- a/ace/Containers_T.cpp +++ b/ace/Containers_T.cpp @@ -1210,7 +1210,7 @@ ACE_Bounded_Set<T>::ACE_Bounded_Set (void) ACE_TRACE ("ACE_Bounded_Set<T>::ACE_Bounded_Set"); ACE_NEW (this->search_structure_, - ACE_Bounded_Set<T>::Search_Structure[this->max_size_]); + ACE_TYPENAME ACE_Bounded_Set<T>::Search_Structure[this->max_size_]); for (size_t i = 0; i < this->max_size_; i++) this->search_structure_[i].is_free_ = 1; @@ -1224,7 +1224,7 @@ ACE_Bounded_Set<T>::ACE_Bounded_Set (const ACE_Bounded_Set<T> &bs) ACE_TRACE ("ACE_Bounded_Set<T>::ACE_Bounded_Set"); ACE_NEW (this->search_structure_, - ACE_Bounded_Set<T>::Search_Structure[this->max_size_]); + ACE_TYPENAME ACE_Bounded_Set<T>::Search_Structure[this->max_size_]); for (size_t i = 0; i < this->cur_size_; i++) this->search_structure_[i] = bs.search_structure_[i]; @@ -1240,7 +1240,7 @@ ACE_Bounded_Set<T>::operator= (const ACE_Bounded_Set<T> &bs) if (this->max_size_ < bs.cur_size_) { delete [] this->search_structure_; - ACE_NEW (this->search_structure_, + ACE_NEW (this->search_structure_, ACE_TYPENAME ACE_Bounded_Set<T>::Search_Structure[bs.cur_size_]); this->max_size_ = bs.cur_size_; } @@ -1259,7 +1259,7 @@ ACE_Bounded_Set<T>::ACE_Bounded_Set (size_t size) { ACE_TRACE ("ACE_Bounded_Set<T>::ACE_Bounded_Set"); ACE_NEW (this->search_structure_, - ACE_Bounded_Set<T>::Search_Structure[size]); + ACE_TYPENAME ACE_Bounded_Set<T>::Search_Structure[size]); for (size_t i = 0; i < this->max_size_; i++) this->search_structure_[i].is_free_ = 1; |