#include <Vector_T.h>
Inheritance diagram for ACE_Vector< T, DEFAULT_SIZE >:
Public Types | |
typedef ACE_Vector_Iterator< T, DEFAULT_SIZE > | Iterator |
Public Member Functions | |
ACE_Vector (const size_t init_size=DEFAULT_SIZE, ACE_Allocator *alloc=0) | |
~ACE_Vector () | |
size_t | capacity (void) const |
size_t | size (void) const |
void | clear (void) |
void | resize (const size_t new_size, const T &t) |
void | push_back (const T &elem) |
void | pop_back (void) |
void | dump (void) const |
bool | operator== (const ACE_Vector< T, DEFAULT_SIZE > &s) const |
Equality comparison operator. | |
bool | operator!= (const ACE_Vector< T, DEFAULT_SIZE > &s) const |
Inequality comparison operator. | |
void | swap (ACE_Vector &rhs) |
Protected Attributes | |
size_t | length_ |
size_t | curr_max_size_ |
Friends | |
class | ACE_Vector_Iterator< T, DEFAULT_SIZE > |
This is an STL-like template vector container, a wrapper around ACE_Array. It provides at least the basic std::vector look and feel: push_back(), clear(), resize(), capacity(). This template class uses the copy semantic paradigm, though it is okay to use reference counted smart pointers (see ACE_Ptr<T>) with this template class.
Requirements and Performance Characteristics
Definition at line 70 of file Vector_T.h.
|
A short name for iterator for ACE_Vector. Definition at line 76 of file Vector_T.h. |
|
General constructor.
Definition at line 10 of file Vector_T.inl. References ACE_Vector< T, DEFAULT_SIZE >::curr_max_size_, and ACE_Array_Base< T >::max_size().
00012 : ACE_Array<T> (init_size == 0 ? DEFAULT_SIZE : init_size, alloc) 00013 { 00014 length_ = 0; 00015 curr_max_size_ = this->max_size (); 00016 } |
|
Destructor. Definition at line 19 of file Vector_T.inl.
00020 { 00021 } |
|
Returns the current vector capacity, that is, the currently allocated buffer size.
Definition at line 24 of file Vector_T.inl. References ACE_Vector< T, DEFAULT_SIZE >::curr_max_size_.
00025 { 00026 return curr_max_size_; 00027 } |
|
Clears out the vector. It does not reallocate the vector's buffer, it is just sets the vector's dynamic size to 0. Definition at line 36 of file Vector_T.inl.
00037 { 00038 length_ = 0; 00039 } |
|
This function dumps the content of the vector. TO BE MOVED out of this class. It needs to be implemented as a global template function that accepts a const ACE_Vector<T>, in order to make instances of this class compile on Linux, AIX. G++ and xlC have template instantiation algoriths, which are different from the one in Visual C++. The algorithms try to instantiate ALL methods declared in the template class, regardless of whether the functions are used or not. That is, all of the classes, that are used as elements in ACE_Vector's, have to have the dump() methods defined in them (seems to be overkill). This function calls T::dump() for each element of the vector. Definition at line 46 of file Vector_T.cpp. References ACE_Vector< T, DEFAULT_SIZE >::size().
00047 { 00048 #if defined (ACE_HAS_DUMP) 00049 #if 0 00050 // Can't do this unless the vector is an object with a dump 00051 // function. 00052 for (size_t i = 0; i < this->size (); ++i) 00053 (*this)[i].dump (); 00054 #endif /* 0 */ 00055 #endif /* ACE_HAS_DUMP */ 00056 } |
|
Inequality comparison operator. Compare this vector with
Definition at line 51 of file Vector_T.inl.
00052 { 00053 return !(*this == s); 00054 } |
|
Equality comparison operator. Compare this vector with
Definition at line 60 of file Vector_T.cpp. References ACE_Vector< T, DEFAULT_SIZE >::size().
|
|
Deletes the last element from the vector ("pop back"). What this function really does is decrement the dynamic size of the vector. The vector's buffer does not get reallocated for performance. Definition at line 42 of file Vector_T.inl.
|
|
Appends a new element to the vector ("push back"). If the dynamic size of the vector is equal to the capacity of the vector (vector is at capacity), the vector automatically doubles its capacity.
Definition at line 34 of file Vector_T.cpp. References ACE_Vector< T, DEFAULT_SIZE >::curr_max_size_, ACE_Array_Base< T >::max_size(), and ACE_Array_Base< T >::size().
00035 { 00036 if (length_ == curr_max_size_) 00037 { 00038 ACE_Array<T>::size (curr_max_size_ * 2); 00039 curr_max_size_ = this->max_size (); 00040 } 00041 ++length_; 00042 (*this)[length_-1] = elem; 00043 } |
|
Resizes the vector to the new capacity. If the vector's current capacity is smaller than the size to be specified, then the buffer gets reallocated. If the new capacity is less than the current capacity of the vector, the buffer size stays the same.
Definition at line 21 of file Vector_T.cpp. References ACE_Vector< T, DEFAULT_SIZE >::curr_max_size_, ACE_Array_Base< T >::max_size(), and ACE_Array_Base< T >::size().
00023 { 00024 ACE_Array<T>::size (new_size); 00025 if (new_size > length_) 00026 for (size_t i = length_; i < new_size; ++i) 00027 (*this)[i]=t; 00028 00029 curr_max_size_ = this->max_size (); 00030 length_ = new_size; 00031 } |
|
Returns the vector's dynamic size / actual current size of the vector. Do not confuse it with ACE_Array::size(), which returns the array's capacity. Unfortunately, ACE is not very consistent with the function names.
Reimplemented from ACE_Array_Base< T >. Definition at line 30 of file Vector_T.inl. Referenced by ACE_Vector< T, DEFAULT_SIZE >::dump(), and ACE_Vector< T, DEFAULT_SIZE >::operator==().
00031 { 00032 return length_; 00033 } |
|
Definition at line 57 of file Vector_T.inl. References ACE_Vector< T, DEFAULT_SIZE >::curr_max_size_, ACE_Vector< T, DEFAULT_SIZE >::length_, and ACE_Array_Base< T >::swap().
00058 { 00059 ACE_Array<T>::swap (rhs); 00060 std::swap (this->length_, rhs.length_); 00061 std::swap (this->curr_max_size_, rhs.curr_max_size_); 00062 } |
|
Definition at line 202 of file Vector_T.h. |
|
Current capacity (buffer size) of the vector. Definition at line 200 of file Vector_T.h. Referenced by ACE_Vector< T, DEFAULT_SIZE >::ACE_Vector(), ACE_Vector< T, DEFAULT_SIZE >::capacity(), ACE_Vector< T, DEFAULT_SIZE >::push_back(), ACE_Vector< T, DEFAULT_SIZE >::resize(), and ACE_Vector< T, DEFAULT_SIZE >::swap(). |
|
Dynamic size (length) of the vector. Definition at line 195 of file Vector_T.h. Referenced by ACE_Vector< T, DEFAULT_SIZE >::swap(). |