|
typedef T | Element |
|
typedef T * | Iterator |
|
|
| NPT_Array (NPT_Cardinal count) |
|
| NPT_Array (NPT_Cardinal count, const T &item) |
|
| NPT_Array (const T *items, NPT_Cardinal item_count) |
|
| NPT_Array (const NPT_Array< T > ©) |
|
NPT_Array< T > & | operator= (const NPT_Array< T > ©) |
|
bool | operator== (const NPT_Array< T > &other) const |
|
bool | operator!= (const NPT_Array< T > &other) const |
|
NPT_Cardinal | GetItemCount () const |
|
NPT_Result | Add (const T &item) |
|
T & | operator[] (NPT_Ordinal pos) |
|
const T & | operator[] (NPT_Ordinal pos) const |
|
NPT_Result | Erase (Iterator which) |
|
NPT_Result | Erase (NPT_Ordinal which) |
|
NPT_Result | Erase (Iterator first, Iterator last) |
|
NPT_Result | Erase (NPT_Ordinal first, NPT_Ordinal last) |
|
NPT_Result | Insert (Iterator where, const T &item, NPT_Cardinal count=1) |
|
NPT_Result | Reserve (NPT_Cardinal count) |
|
NPT_Cardinal | GetCapacity () const |
|
NPT_Result | Resize (NPT_Cardinal count) |
|
NPT_Result | Resize (NPT_Cardinal count, const T &fill) |
|
NPT_Result | Clear () |
|
bool | Contains (const T &data) const |
|
Iterator | GetFirstItem () const |
|
Iterator | GetLastItem () const |
|
Iterator | GetItem (NPT_Ordinal n) |
|
template<typename X > |
NPT_Result | Apply (const X &function) const |
|
template<typename X , typename P > |
NPT_Result | ApplyUntil (const X &function, const P &predicate, bool *match=NULL) const |
|
template<typename X > |
T * | Find (const X &predicate, NPT_Ordinal n=0, NPT_Ordinal *pos=NULL) const |
|
|
T * | Allocate (NPT_Cardinal count, NPT_Cardinal &allocated) |
|
|
NPT_Cardinal | m_Capacity |
|
NPT_Cardinal | m_ItemCount |
|
T * | m_Items |
|
The documentation for this class was generated from the following file: