// Author: Vadim Zeitlin
// Modified by:
// Created: 12.09.97
-// RCS-ID: $Id$
// Copyright: (c) 1998 Vadim Zeitlin <zeitlin@dptmaths.ens-cachan.fr>
// Licence: wxWindows licence
///////////////////////////////////////////////////////////////////////////////
#include <stdlib.h>
#include <string.h> // for memmove
-#if !wxUSE_STL
+#if !wxUSE_STD_CONTAINERS
// we cast the value to long from which we cast it to void * in IndexForInsert:
// this can't work if the pointers are not big enough
if( (m_nCount == m_nSize) || ((m_nSize - m_nCount) < nIncrement) ) { \
if( m_nSize == 0 ) { \
/* was empty, determine initial size */ \
- size_t size = WX_ARRAY_DEFAULT_INITIAL_SIZE; \
- if (size < nIncrement) size = nIncrement; \
+ size_t sz = WX_ARRAY_DEFAULT_INITIAL_SIZE; \
+ if (sz < nIncrement) sz = nIncrement; \
/* allocate some memory */ \
- m_pItems = new T[size]; \
+ m_pItems = new T[sz]; \
/* only grow if allocation succeeded */ \
if ( m_pItems ) { \
- m_nSize = size; \
+ m_nSize = sz; \
} \
} \
else \
return; \
Grow(nInsert); \
\
+ /* old iterator could have been invalidated by Grow(). */ \
+ it = begin() + nIndex; \
+ \
memmove(&m_pItems[nIndex + nInsert], &m_pItems[nIndex], \
(m_nCount - nIndex)*sizeof(T)); \
for (size_t i = 0; i < nInsert; ++i, ++it, ++first) \
#pragma warning(pop)
#endif
-#else // wxUSE_STL
+#else // wxUSE_STD_CONTAINERS
#include "wx/arrstr.h"
return it - begin();
}
-#endif // !wxUSE_STL/wxUSE_STL
+#endif // !wxUSE_STD_CONTAINERS/wxUSE_STD_CONTAINERS