return *this; \
} \
\
-name::name(const name& src) \
+name::name(const name& src) : wxArrayPtrVoid() \
{ \
DoCopy(src); \
} \
void name::DoEmpty() \
{ \
for ( size_t ui = 0; ui < Count(); ui++ ) \
- delete (T*)wxBaseArray::Item(ui); \
+ delete (T*)wxBaseArrayPtrVoid::Item(ui); \
} \
\
-void name::RemoveAt(size_t uiIndex) \
+void name::RemoveAt(size_t uiIndex, size_t nRemove) \
{ \
wxCHECK_RET( uiIndex < Count(), _WX_ERROR_REMOVE2(name) ); \
\
- delete (T*)wxBaseArray::Item(uiIndex); \
+ for (size_t i = 0; i < nRemove; i++ ) \
+ delete (T*)wxBaseArrayPtrVoid::Item(uiIndex + i); \
\
- wxBaseArray::RemoveAt(uiIndex); \
+ wxBaseArrayPtrVoid::RemoveAt(uiIndex, nRemove); \
} \
\
-void name::Add(const T& item) \
+void name::Add(const T& item, size_t nInsert) \
{ \
+ if (nInsert == 0) \
+ return; \
T* pItem = new T(item); \
+ size_t nOldSize = GetCount(); \
if ( pItem != NULL ) \
- Add(pItem); \
+ wxBaseArrayPtrVoid::Add(pItem, nInsert); \
+ for (size_t i = 1; i < nInsert; i++) \
+ wxBaseArrayPtrVoid::Item(nOldSize + i) = new T(item); \
} \
\
-void name::Insert(const T& item, size_t uiIndex) \
+void name::Insert(const T& item, size_t uiIndex, size_t nInsert) \
{ \
+ if (nInsert == 0) \
+ return; \
T* pItem = new T(item); \
if ( pItem != NULL ) \
- Insert(pItem, uiIndex); \
+ wxBaseArrayPtrVoid::Insert(pItem, uiIndex, nInsert); \
+ for (size_t i = 1; i < nInsert; i++) \
+ wxBaseArrayPtrVoid::Item(uiIndex + i) = new T(item); \
} \
\
int name::Index(const T& Item, bool bFromEnd) const \
if ( Count() > 0 ) { \
size_t ui = Count() - 1; \
do { \
- if ( (T*)wxBaseArray::Item(ui) == &Item ) \
+ if ( (T*)wxBaseArrayPtrVoid::Item(ui) == &Item ) \
return ui; \
ui--; \
} \
} \
else { \
for( size_t ui = 0; ui < Count(); ui++ ) { \
- if( (T*)wxBaseArray::Item(ui) == &Item ) \
+ if( (T*)wxBaseArrayPtrVoid::Item(ui) == &Item ) \
return ui; \
} \
} \