ArrayList

Combination of array and list structure

All class functions are defined inline.

[ deal | Source | Keywords | Summary | Ancestors | All Members | Descendants ]

Quick Index

OVERVIEW

Class Summary

Back to the top of ArrayList

OVERVIEW

ArrayList implements a dynamic array designed for small data types T. The overhead for list structures is only one pointer for BS elements.

Back to the top of ArrayList

ArrayList() ;

Constructor creating an empty array of length 0. This array uses only memory for one pointer and grows on access to its elements

  ArrayList() ;

Function is currently defined inline.

Back to the top of ArrayList

~ArrayList() ;

Destructor.

  ~ArrayList()
                                                                                                         
;

Function is currently defined inline.

Back to the top of ArrayList

T& change(int i) ;

This r/w access function automatically expands the array to be able to hold at least i+1 items. It returns a reference to the i'th item.

  T& change(int i)
                                                   ;

Function is currently defined inline.

Back to the top of ArrayList

T operator() (int i) const ;

Read access to a data item. This function does not expand the array and therefore can only read existing items.

  T operator() (int i) const
                                                      ;

Function is currently defined inline.

Back to the top of ArrayList

All Members

Back to the top of ArrayList

Ancestors

Back to the top of ArrayList

Descendants

Back to the top of ArrayList