NAME

ACE_Array - Implement a dynamic array class.

SYNOPSIS

#include <ace/Array.h>

template<class T> class ACE_Array { public: typedef T TYPE; ACE_Array (size_t size); ACE_Array (size_t size, const T &default_value); ACE_Array (const ACE_Array<T> &s); void operator= (const ACE_Array<T> &s); ~ACE_Array (void); T &operator [] (size_t index); const T &operator [] (size_t index) const; int set (const T &new_item, size_t index); int get (T &item, size_t index) const; size_t size (void) const; int operator== (const ACE_Array<T> &s) const; int operator!= (const ACE_Array<T> &s) const; private: int in_range (size_t index) const; size_t max_size_; size_t cur_size_; T *array_; friend class ACE_Array_Iterator<T>; };

Exceptions.

Initialization and termination methods.

ACE_Array (size_t size);

ACE_Array (size_t size, const T &default_value);

ACE_Array (const ACE_Array<T> &s);

void operator= (const ACE_Array<T> &s);

~ACE_Array (void);

Set/get methods.

T &operator [] (size_t index);

const T &operator [] (size_t index) const;

int set (const T &new_item, size_t index);

int get (T &item, size_t index) const;

size_t size (void) const;

int operator== (const ACE_Array<T> &s) const;

int operator!= (const ACE_Array<T> &s) const;

AUTHOR

Doug Schmidt

LIBRARY

ace