ACE_Array_Base< T > Class Template Reference

Implement a simple dynamic array. More...

#include <Array_Base.h>

Inheritance diagram for ACE_Array_Base< T >:

[legend]Collaboration diagram for ACE_Array_Base< T >:

[legend]List of all members.

Public Types
typedef T	TYPE
typedef ACE_Array_Iterator< T >	ITERATOR
Public Member Functions
	ACE_Array_Base (size_t size=0, ACE_Allocator *the_allocator=0)
	Dynamically create an uninitialized array.
	ACE_Array_Base (size_t size, const T &default_value, ACE_Allocator *the_allocator=0)
	Dynamically initialize the entire array to the .
	ACE_Array_Base (const ACE_Array_Base< T > &s)
void	operator= (const ACE_Array_Base< T > &s)
	~ACE_Array_Base (void)
	Clean up the array (e.g., delete dynamically allocated memory).
T &	operator[] (size_t slot)
const T &	operator[] (size_t slot) const
int	set (const T &new_item, size_t slot)
int	get (T &item, size_t slot) const
size_t	size (void) const
	Returns the of the array.
int	size (size_t new_size)
size_t	max_size (void) const
	Returns the of the array.
int	max_size (size_t new_size)
Protected Member Functions
int	in_range (size_t slot) const
Protected Attributes
size_t	max_size_
size_t	cur_size_
T *	array_
	Pointer to the array's storage buffer.
ACE_Allocator *	allocator_
	Allocation strategy of the ACE_Array_Base.
Friends
class	ACE_Array_Iterator< T >

---

Detailed Description

template<class T>
class ACE_Array_Base< T >

Implement a simple dynamic array.

This parametric class implements a simple dynamic array; resizing must be controlled by the user. No comparison or find operations are implemented.

Definition at line 40 of file Array_Base.h.

---

Member Typedef Documentation

template<class T> typedef ACE_Array_Iterator<T> ACE_Array_Base< T >::ITERATOR

Reimplemented in ACE_Array< T >, ACE_Array< ACE_Get_Opt_Long_Option * >, and ACE_Array< ACE_INET_Addr >. Definition at line 46 of file Array_Base.h.

template<class T> typedef T ACE_Array_Base< T >::TYPE

Reimplemented in ACE_Array< T >, ACE_Array< ACE_Get_Opt_Long_Option * >, and ACE_Array< ACE_INET_Addr >. Definition at line 45 of file Array_Base.h.

---

Constructor & Destructor Documentation

template<class T> ACE_BEGIN_VERSIONED_NAMESPACE_DECL ACE_Array_Base< T >::ACE_Array_Base (  size_t  size = 0, ACE_Allocator *  the_allocator = 0 )

Dynamically create an uninitialized array. Definition at line 23 of file Array_Base.cpp. References ACE_ALLOCATOR, ACE_Array_Base< T >::array_, and ACE_Allocator::instance(). : max_size_ (size), cur_size_ (size), allocator_ (alloc) { if (this->allocator_ == 0) this->allocator_ = ACE_Allocator::instance (); if (size != 0) { ACE_ALLOCATOR (this->array_, (T *) this->allocator_->malloc (size * sizeof (T))); for (size_t i = 0; i < size; ++i) new (&array_[i]) T; } else this->array_ = 0; }

template<class T> ACE_Array_Base< T >::ACE_Array_Base (  size_t  size, const T &  default_value, ACE_Allocator *  the_allocator = 0 )

Dynamically initialize the entire array to the . Definition at line 44 of file Array_Base.cpp. References ACE_ALLOCATOR, ACE_Array_Base< T >::array_, and ACE_Allocator::instance(). : max_size_ (size), cur_size_ (size), allocator_ (alloc) { if (this->allocator_ == 0) this->allocator_ = ACE_Allocator::instance (); if (size != 0) { ACE_ALLOCATOR (this->array_, (T *) this->allocator_->malloc (size * sizeof (T))); for (size_t i = 0; i < size; ++i) new (&array_[i]) T (default_value); } else this->array_ = 0; }

template<class T> ACE_Array_Base< T >::ACE_Array_Base (  const ACE_Array_Base< T > &  s  )

The copy constructor performs initialization by making an exact copy of the contents of parameter , i.e., *this == s will return true. Definition at line 68 of file Array_Base.cpp. References ACE_ALLOCATOR, ACE_Array_Base< T >::array_, ACE_Allocator::instance(), and ACE_Array_Base< T >::size(). : max_size_ (s.size ()), cur_size_ (s.size ()), allocator_ (s.allocator_) { if (this->allocator_ == 0) this->allocator_ = ACE_Allocator::instance (); ACE_ALLOCATOR (this->array_, (T *) this->allocator_->malloc (s.size () * sizeof (T))); for (size_t i = 0; i < this->size (); i++) new (&this->array_[i]) T (s.array_[i]); }

template<class T> ACE_BEGIN_VERSIONED_NAMESPACE_DECL ACE_INLINE ACE_Array_Base< T >::~ACE_Array_Base (  void   )

Clean up the array (e.g., delete dynamically allocated memory). Definition at line 10 of file Array_Base.inl. References ACE_DES_ARRAY_FREE. { ACE_DES_ARRAY_FREE (this->array_, this->max_size_, this->allocator_->free, T); }

---

Member Function Documentation

template<class T> int ACE_Array_Base< T >::get (  T &  item, size_t  slot )  const

Get an item in the array at location . Returns -1 if is not in range, else returns 0. Note that this function copies the item. If you want to avoid the copy, you can use the const operator [], but then you'll be responsible for range checking. Definition at line 132 of file Array_Base.cpp. References ACE_Array_Base< T >::array_, and ACE_Array_Base< T >::in_range(). { if (this->in_range (slot)) { // Copies the item. If you don't want to copy, use operator [] // instead (but then you'll be responsible for range checking). item = this->array_[slot]; return 0; } else return -1; }

template<class T> ACE_INLINE int ACE_Array_Base< T >::in_range (  size_t  slot  )  const [protected]

Returns 1 if is within range, i.e., 0 >= < , else returns 0. Definition at line 31 of file Array_Base.inl. References ACE_Array_Base< T >::cur_size_. Referenced by ACE_Array_Base< T >::get(), and ACE_Array_Base< T >::set(). { return index < this->cur_size_; }

template<class T> int ACE_Array_Base< T >::max_size (  size_t  new_size  )

Changes the size of the array to match . It copies the old contents into the new array. Return -1 on failure. It does not affect new_size Definition at line 146 of file Array_Base.cpp. References ACE_ALLOCATOR_RETURN, ACE_DES_ARRAY_FREE, ACE_Array_Base< T >::array_, ACE_Array_Base< T >::cur_size_, and ACE_Array_Base< T >::max_size_. { if (new_size > this->max_size_) { T *tmp = 0; ACE_ALLOCATOR_RETURN (tmp, (T *) this->allocator_->malloc (new_size * sizeof (T)), -1); for (size_t i = 0; i < this->cur_size_; ++i) new (&tmp[i]) T (this->array_[i]); // Initialize the new portion of the array that exceeds the // previously allocated section. for (size_t j = this->cur_size_; j < new_size; j++) new (&tmp[j]) T; ACE_DES_ARRAY_FREE (this->array_, this->max_size_, this->allocator_->free, T); this->array_ = tmp; this->max_size_ = new_size; this->cur_size_ = new_size; } return 0; }

template<class T> ACE_INLINE size_t ACE_Array_Base< T >::max_size (  void   )  const

Returns the of the array. Definition at line 25 of file Array_Base.inl. References ACE_Array_Base< T >::max_size_. Referenced by ACE_Vector< T, DEFAULT_SIZE >::ACE_Vector(), ACE_DLL_Handle::get_dll_names(), ACE_DLL_Handle::open(), ACE_Vector< T, DEFAULT_SIZE >::push_back(), ACE_Vector< T, DEFAULT_SIZE >::resize(), and ACE_Array_Base< T >::size(). { return this->max_size_; }

template<class T> void ACE_Array_Base< T >::operator= (  const ACE_Array_Base< T > &  s  )

Assignment operator performs an assignment by making an exact copy of the contents of parameter , i.e., *this == s will return true. Note that if the of is >= than <s.max_size_> we can copy it without reallocating. However, if is < <s.max_size_> we must delete the , reallocate a new , and then copy the contents of . Definition at line 85 of file Array_Base.cpp. References ACE_ALLOCATOR, ACE_DES_ARRAY_FREE, ACE_DES_ARRAY_NOFREE, ACE_Array_Base< T >::array_, ACE_Array_Base< T >::cur_size_, ACE_Array_Base< T >::max_size_, and ACE_Array_Base< T >::size(). Referenced by ACE_Array< T >::operator=(). { // Check for "self-assignment". if (this != &s) { if (this->max_size_ < s.size ()) { ACE_DES_ARRAY_FREE (this->array_, this->max_size_, this->allocator_->free, T); ACE_ALLOCATOR (this->array_, (T *) this->allocator_->malloc (s.size () * sizeof (T))); this->max_size_ = s.size (); } else { ACE_DES_ARRAY_NOFREE (this->array_, s.size (), T); } this->cur_size_ = s.size (); for (size_t i = 0; i < this->size (); i++) new (&this->array_[i]) T (s.array_[i]); } }

template<class T> ACE_INLINE const T & ACE_Array_Base< T >::operator[] (  size_t  slot  )  const

Get item in the array at location . Doesn't perform range checking. Definition at line 43 of file Array_Base.inl. References ACE_Array_Base< T >::array_. { return this->array_[index]; }

template<class T> ACE_INLINE T & ACE_Array_Base< T >::operator[] (  size_t  slot  )

Set item in the array at location . Doesn't perform range checking. Definition at line 37 of file Array_Base.inl. References ACE_Array_Base< T >::array_. { return this->array_[index]; }

template<class T> int ACE_Array_Base< T >::set (  const T &  new_item, size_t  slot )

Set an item in the array at location . Returns -1 if is not in range, else returns 0. Definition at line 118 of file Array_Base.cpp. References ACE_Array_Base< T >::array_, and ACE_Array_Base< T >::in_range(). Referenced by ACE_DLL_Handle::get_dll_names(), and ACE_DLL_Handle::open(). { if (this->in_range (slot)) { this->array_[slot] = new_item; return 0; } else return -1; }

template<class T> int ACE_Array_Base< T >::size (  size_t  new_size  )

Changes the size of the array to match . It copies the old contents into the new array. Return -1 on failure. Definition at line 176 of file Array_Base.cpp. References ACE_Array_Base< T >::cur_size_, and ACE_Array_Base< T >::max_size(). { int r = this->max_size (new_size); if (r != 0) return r; this->cur_size_ = new_size; return 0; }

template<class T> ACE_INLINE size_t ACE_Array_Base< T >::size (  void   )  const

Returns the of the array. Reimplemented in ACE_Vector< T, DEFAULT_SIZE >. Definition at line 19 of file Array_Base.inl. References ACE_Array_Base< T >::cur_size_. Referenced by ACE_Array_Base< T >::ACE_Array_Base(), ACE_DLL_Handle::get_dll_names(), ACE_DLL_Handle::open(), ACE_Array_Base< T >::operator=(), ACE_Array< T >::operator==(), ACE_Vector< T, DEFAULT_SIZE >::push_back(), and ACE_Vector< T, DEFAULT_SIZE >::resize(). { return this->cur_size_; }

---

Friends And Related Function Documentation

template<class T> friend class ACE_Array_Iterator< T > [friend]

Definition at line 146 of file Array_Base.h.

---

Member Data Documentation

template<class T> ACE_Allocator* ACE_Array_Base< T >::allocator_ [protected]

Allocation strategy of the ACE_Array_Base. Definition at line 144 of file Array_Base.h.

template<class T> T* ACE_Array_Base< T >::array_ [protected]

Pointer to the array's storage buffer. Definition at line 141 of file Array_Base.h. Referenced by ACE_Array_Base< T >::ACE_Array_Base(), ACE_Array_Base< T >::get(), ACE_Array_Base< T >::max_size(), ACE_Array_Base< T >::operator=(), ACE_Array_Base< T >::operator[](), and ACE_Array_Base< T >::set().

template<class T> size_t ACE_Array_Base< T >::cur_size_ [protected]

Current size of the array. This starts out being == to . However, if we are assigned a smaller array, then will become less than . The purpose of keeping track of both sizes is to avoid reallocating memory if we don't have to. Definition at line 138 of file Array_Base.h. Referenced by ACE_Array_Base< T >::in_range(), ACE_Array_Base< T >::max_size(), ACE_Array_Base< T >::operator=(), and ACE_Array_Base< T >::size().

template<class T> size_t ACE_Array_Base< T >::max_size_ [protected]

Maximum size of the array, i.e., the total number of elements in . Definition at line 129 of file Array_Base.h. Referenced by ACE_Array_Base< T >::max_size(), and ACE_Array_Base< T >::operator=().

---

The documentation for this class was generated from the following files:

• Array_Base.h
• Array_Base.cpp
• Array_Base.inl

---