#include <ace/Containers.h>
template<class T> class ACE_Array : public ACE_Array_Base<T> {
public:
typedef T TYPE;
typedef ACE_Array_Iterator<T> ITERATOR;
ACE_Array (size_t size = 0, ACE_Allocator* alloc = 0);
ACE_Array ( size_t size, const T &default_value, ACE_Allocator* alloc = 0 );
ACE_Array (const ACE_Array<T> &s);
void operator= (const ACE_Array<T> &s);
int operator== (const ACE_Array<T> &s) const;
int operator!= (const ACE_Array<T> &s) const;
};
ACE_Array (size_t size = 0, ACE_Allocator* alloc = 0);
ACE_Array (
size_t size,
const T &default_value,
ACE_Allocator* alloc = 0
);
default_value
.
ACE_Array (const ACE_Array<T> &s);
s
, i.e., *this == s will
return true.
void operator= (const ACE_Array<T> &s);
s
, i.e., *this == s will
return true. Note that if the max_size_
of array_
is = than
s.max_size_
we can copy it without reallocating. However, if
max_size_
is s.max_size_
we must delete the array_
,
reallocate a new array_
, and then copy the contents of s
.
int operator== (const ACE_Array<T> &s) const;
s
for equality. Two arrays are equal
if their size
's are equal and all the elements from 0 .. size
are equal.
int operator!= (const ACE_Array<T> &s) const;
s
for inequality such that *this
!=
s
is always the complement of the boolean return value of
*this
== s
.