[wxWidgets.git] / src / common / dynarray.cpp

///////////////////////////////////////////////////////////////////////////////
// Name:        src/common/dynarray.cpp
// Purpose:     implementation of wxBaseArray class
// 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
///////////////////////////////////////////////////////////////////////////////

// ============================================================================
// headers
// ============================================================================

// For compilers that support precompilation, includes "wx.h".
#include  "wx/wxprec.h"

#ifdef __BORLANDC__
    #pragma hdrstop
#endif

#ifndef WX_PRECOMP
    #include "wx/dynarray.h"
    #include "wx/intl.h"
#endif //WX_PRECOMP

#include <stdlib.h>
#include <string.h> // for memmove

// 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
wxCOMPILE_TIME_ASSERT( sizeof(wxUIntPtr) <= sizeof(void *),
                       wxArraySizeOfPtrLessSizeOfLong ); // < 32 symbols

// ============================================================================
// constants
// ============================================================================

// size increment = max(50% of current size, ARRAY_MAXSIZE_INCREMENT)
#define   ARRAY_MAXSIZE_INCREMENT    4096

// ============================================================================
// implementation
// ============================================================================

// ----------------------------------------------------------------------------
// wxBaseArray - dynamic array of 'T's
// ----------------------------------------------------------------------------

#define _WX_DEFINE_BASEARRAY_COMMON(T, name)                                \
/* searches the array for an item (forward or backwards) */                 \
int name::Index(T lItem, bool bFromEnd) const                               \
{                                                                           \
  if ( bFromEnd ) {                                                         \
    if ( size() > 0 ) {                                                     \
      size_t n = size();                                                    \
      do {                                                                  \
        if ( (*this)[--n] == lItem )                                        \
          return n;                                                         \
      }                                                                     \
      while ( n != 0 );                                                     \
    }                                                                       \
  }                                                                         \
  else {                                                                    \
    for( size_t n = 0; n < size(); n++ ) {                                  \
      if( (*this)[n] == lItem )                                             \
        return n;                                                           \
    }                                                                       \
  }                                                                         \
                                                                            \
  return wxNOT_FOUND;                                                       \
}                                                                           \
                                                                            \
/* add item assuming the array is sorted with fnCompare function */         \
size_t name::Add(T lItem, CMPFUNC fnCompare)                                \
{                                                                           \
  size_t idx = IndexForInsert(lItem, fnCompare);                            \
  Insert(lItem, idx);                                                       \
  return idx;                                                               \
}

#if wxUSE_STL

#define _WX_DEFINE_BASEARRAY_NOCOMMON(T, name)                              \
size_t name::IndexForInsert(T lItem, CMPFUNC fnCompare) const               \
{                                                                           \
    Predicate p((SCMPFUNC)fnCompare);                                       \
    const_iterator it = std::lower_bound(begin(), end(), lItem, p);         \
    return it - begin();                                                    \
}                                                                           \
                                                                            \
int name::Index(T lItem, CMPFUNC fnCompare) const                           \
{                                                                           \
    Predicate p((SCMPFUNC)fnCompare);                                       \
    const_iterator it = std::lower_bound(begin(), end(), lItem, p);         \
    return (it != end() && !p(lItem, *it)) ?                                \
                             (int)(it - begin()) : wxNOT_FOUND;             \
}                                                                           \
                                                                            \
void name::Shrink()                                                         \
{                                                                           \
    name tmp(*this);                                                        \
    swap(tmp);                                                              \
}

#else // if !wxUSE_STL

#define _WX_DEFINE_BASEARRAY_NOCOMMON(T, name)                              \
/* ctor */                                                                  \
name::name()                                                                \
{                                                                           \
  m_nSize  =                                                                \
  m_nCount = 0;                                                             \
  m_pItems = (T *)NULL;                                                     \
}                                                                           \
                                                                            \
/* copy ctor */                                                             \
name::name(const name& src)                                                 \
{                                                                           \
  m_nSize  = /* not src.m_nSize to save memory */                           \
  m_nCount = src.m_nCount;                                                  \
                                                                            \
  if ( m_nSize != 0 ) {                                                     \
      m_pItems = new T[m_nSize];                                            \
      /* only copy if allocation succeeded */                               \
      if ( m_pItems ) {                                                     \
          memcpy(m_pItems, src.m_pItems, m_nCount*sizeof(T));               \
      }                                                                     \
      else {                                                                \
          m_nSize = 0;                                                      \
      }                                                                     \
  }                                                                         \
  else                                                                      \
    m_pItems = (T *) NULL;                                                  \
}                                                                           \
                                                                            \
/* assignment operator */                                                   \
name& name::operator=(const name& src)                                      \
{                                                                           \
  wxDELETEA(m_pItems);                                                      \
                                                                            \
  m_nSize  = /* not src.m_nSize to save memory */                           \
  m_nCount = src.m_nCount;                                                  \
                                                                            \
  if ( m_nSize != 0 ){                                                      \
      m_pItems = new T[m_nSize];                                            \
      /* only copy if allocation succeeded */                               \
      if ( m_pItems ) {                                                     \
          memcpy(m_pItems, src.m_pItems, m_nCount*sizeof(T));               \
      }                                                                     \
      else {                                                                \
          m_nSize = 0;                                                      \
      }                                                                     \
  }                                                                         \
  else                                                                      \
    m_pItems = (T *) NULL;                                                  \
                                                                            \
  return *this;                                                             \
}                                                                           \
                                                                            \
/* allocate new buffer of the given size and move our data to it */         \
bool name::Realloc(size_t nSize)                                            \
{                                                                           \
  T *pNew = new T[nSize];                                                   \
  /* only grow if allocation succeeded */                                   \
  if ( !pNew )                                                              \
      return false;                                                         \
                                                                            \
  m_nSize = nSize;                                                          \
  /* copy data to new location */                                           \
  memcpy(pNew, m_pItems, m_nCount*sizeof(T));                               \
  delete [] m_pItems;                                                       \
  m_pItems = pNew;                                                          \
                                                                            \
  return true;                                                              \
}                                                                           \
                                                                            \
/* grow the array */                                                        \
void name::Grow(size_t nIncrement)                                          \
{                                                                           \
  /* only do it if no more place */                                         \
  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;                             \
      /* allocate some memory */                                            \
      m_pItems = new T[size];                                               \
      /* only grow if allocation succeeded */                               \
      if ( m_pItems ) {                                                     \
          m_nSize = size;                                                   \
      }                                                                     \
    }                                                                       \
    else                                                                    \
    {                                                                       \
      /* add at least 50% but not too much */                               \
      size_t ndefIncrement = m_nSize < WX_ARRAY_DEFAULT_INITIAL_SIZE        \
                            ? WX_ARRAY_DEFAULT_INITIAL_SIZE : m_nSize >> 1; \
      if ( ndefIncrement > ARRAY_MAXSIZE_INCREMENT )                        \
        ndefIncrement = ARRAY_MAXSIZE_INCREMENT;                            \
      if ( nIncrement < ndefIncrement )                                     \
        nIncrement = ndefIncrement;                                         \
      Realloc(m_nSize + nIncrement);                                        \
    }                                                                       \
  }                                                                         \
}                                                                           \
                                                                            \
/* make sure that the array has at least count elements */                  \
void name::SetCount(size_t count, T defval)                                 \
{                                                                           \
    if ( m_nSize < count )                                                  \
    {                                                                       \
        /* need to realloc memory: don't overallocate it here as if */      \
        /* SetCount() is called, it probably means that the caller  */      \
        /* knows in advance how many elements there will be in the  */      \
        /* array and so it won't be necessary to realloc it later   */      \
        if ( !Realloc(count) )                                              \
        {                                                                   \
            /* out of memory -- what can we do? */                          \
            return;                                                         \
        }                                                                   \
    }                                                                       \
                                                                            \
    /* add new elements if we extend the array */                           \
    while ( m_nCount < count )                                              \
    {                                                                       \
        m_pItems[m_nCount++] = defval;                                      \
    }                                                                       \
}                                                                           \
                                                                            \
/* dtor */                                                                  \
name::~name()                                                               \
{                                                                           \
  wxDELETEA(m_pItems);                                                      \
}                                                                           \
                                                                            \
/* clears the list */                                                       \
void name::Clear()                                                          \
{                                                                           \
  m_nSize  =                                                                \
  m_nCount = 0;                                                             \
                                                                            \
  wxDELETEA(m_pItems);                                                      \
}                                                                           \
                                                                            \
/* pre-allocates memory (frees the previous data!) */                       \
void name::Alloc(size_t nSize)                                              \
{                                                                           \
  /* only if old buffer was not big enough */                               \
  if ( nSize > m_nSize ) {                                                  \
    wxDELETEA(m_pItems);                                                    \
    m_nSize  = 0;                                                           \
    m_pItems = new T[nSize];                                                \
    /* only alloc if allocation succeeded */                                \
    if ( m_pItems ) {                                                       \
        m_nSize  = nSize;                                                   \
    }                                                                       \
  }                                                                         \
                                                                            \
  m_nCount = 0;                                                             \
}                                                                           \
                                                                            \
/* minimizes the memory usage by freeing unused memory */                   \
void name::Shrink()                                                         \
{                                                                           \
  /* only do it if we have some memory to free */                           \
  if( m_nCount < m_nSize ) {                                                \
    /* allocates exactly as much memory as we need */                       \
    T *pNew = new T[m_nCount];                                              \
    /* only shrink if allocation succeeded */                               \
    if ( pNew ) {                                                           \
        /* copy data to new location */                                     \
        memcpy(pNew, m_pItems, m_nCount*sizeof(T));                         \
        delete [] m_pItems;                                                 \
        m_pItems = pNew;                                                    \
                                                                            \
        /* update the size of the new block */                              \
        m_nSize = m_nCount;                                                 \
    }                                                                       \
    /* else: don't do anything, better keep old memory block! */            \
  }                                                                         \
}                                                                           \
                                                                            \
/* add item at the end */                                                   \
void name::Add(T lItem, size_t nInsert)                                     \
{                                                                           \
  if (nInsert == 0)                                                         \
      return;                                                               \
  Grow(nInsert);                                                            \
  for (size_t i = 0; i < nInsert; i++)                                      \
      m_pItems[m_nCount++] = lItem;                                         \
}                                                                           \
                                                                            \
/* add item at the given position */                                        \
void name::Insert(T lItem, size_t nIndex, size_t nInsert)                   \
{                                                                           \
  wxCHECK_RET( nIndex <= m_nCount, wxT("bad index in wxArray::Insert") );   \
  wxCHECK_RET( m_nCount <= m_nCount + nInsert,                              \
               wxT("array size overflow in wxArray::Insert") );             \
                                                                            \
  if (nInsert == 0)                                                         \
      return;                                                               \
  Grow(nInsert);                                                            \
                                                                            \
  memmove(&m_pItems[nIndex + nInsert], &m_pItems[nIndex],                   \
          (m_nCount - nIndex)*sizeof(T));                                   \
  for (size_t i = 0; i < nInsert; i++)                                      \
      m_pItems[nIndex + i] = lItem;                                         \
  m_nCount += nInsert;                                                      \
}                                                                           \
                                                                            \
/* search for a place to insert item into sorted array (binary search) */   \
size_t name::IndexForInsert(T lItem, CMPFUNC fnCompare) const               \
{                                                                           \
  size_t i,                                                                 \
       lo = 0,                                                              \
       hi = m_nCount;                                                       \
  int res;                                                                  \
                                                                            \
  while ( lo < hi ) {                                                       \
    i = (lo + hi)/2;                                                        \
                                                                            \
    res = (*fnCompare)((const void *)(wxUIntPtr)lItem,                      \
                       (const void *)(wxUIntPtr)(m_pItems[i]));             \
    if ( res < 0 )                                                          \
      hi = i;                                                               \
    else if ( res > 0 )                                                     \
      lo = i + 1;                                                           \
    else {                                                                  \
      lo = i;                                                               \
      break;                                                                \
    }                                                                       \
  }                                                                         \
                                                                            \
  return lo;                                                                \
}                                                                           \
                                                                            \
/* search for an item in a sorted array (binary search) */                  \
int name::Index(T lItem, CMPFUNC fnCompare) const                           \
{                                                                           \
    size_t n = IndexForInsert(lItem, fnCompare);                            \
                                                                            \
    return (n >= m_nCount ||                                                \
           (*fnCompare)((const void *)(wxUIntPtr)lItem,                     \
                        ((const void *)(wxUIntPtr)m_pItems[n])))            \
                        ? wxNOT_FOUND                                       \
                        : (int)n;                                           \
}                                                                           \
                                                                            \
/* removes item from array (by index) */                                    \
void name::RemoveAt(size_t nIndex, size_t nRemove)                          \
{                                                                           \
  wxCHECK_RET( nIndex < m_nCount, wxT("bad index in wxArray::RemoveAt") );  \
  wxCHECK_RET( nIndex + nRemove <= m_nCount,                                \
               wxT("removing too many elements in wxArray::RemoveAt") );    \
                                                                            \
  memmove(&m_pItems[nIndex], &m_pItems[nIndex + nRemove],                   \
          (m_nCount - nIndex - nRemove)*sizeof(T));                         \
  m_nCount -= nRemove;                                                      \
}                                                                           \
                                                                            \
/* removes item from array (by value) */                                    \
void name::Remove(T lItem)                                                  \
{                                                                           \
  int iIndex = Index(lItem);                                                \
                                                                            \
  wxCHECK_RET( iIndex != wxNOT_FOUND,                                       \
               wxT("removing inexistent item in wxArray::Remove") );        \
                                                                            \
  RemoveAt((size_t)iIndex);                                                 \
}                                                                           \
                                                                            \
/* sort array elements using passed comparaison function */                 \
void name::Sort(CMPFUNC fCmp)                                               \
{                                                                           \
  qsort(m_pItems, m_nCount, sizeof(T), fCmp);                               \
}                                                                           \
                                                                            \
void name::assign(const_iterator first, const_iterator last)                \
{                                                                           \
  clear();                                                                  \
  reserve(last - first);                                                    \
  for(; first != last; ++first)                                             \
    push_back(*first);                                                      \
}                                                                           \
                                                                            \
void name::assign(size_type n, const_reference v)                           \
{                                                                           \
  clear();                                                                  \
  reserve(n);                                                               \
  for( size_type i = 0; i < n; ++i )                                        \
    push_back(v);                                                           \
}                                                                           \
                                                                            \
void name::insert(iterator it, const_iterator first, const_iterator last)   \
{                                                                           \
  size_t nInsert = last - first, nIndex = it - begin();                     \
  if (nInsert == 0)                                                         \
      return;                                                               \
  Grow(nInsert);                                                            \
                                                                            \
  memmove(&m_pItems[nIndex + nInsert], &m_pItems[nIndex],                   \
          (m_nCount - nIndex)*sizeof(T));                                   \
  for (size_t i = 0; i < nInsert; ++i, ++it, ++first)                       \
      *it = *first;                                                         \
  m_nCount += nInsert;                                                      \
}

#endif

#define _WX_DEFINE_BASEARRAY(T, name)                                       \
        _WX_DEFINE_BASEARRAY_COMMON(T, name)                                \
        _WX_DEFINE_BASEARRAY_NOCOMMON(T, name)

#ifdef __INTELC__
    #pragma warning(push)
    #pragma warning(disable: 1684)
    #pragma warning(disable: 1572)
#endif

_WX_DEFINE_BASEARRAY(const void *, wxBaseArrayPtrVoid)
_WX_DEFINE_BASEARRAY(short,        wxBaseArrayShort)
_WX_DEFINE_BASEARRAY(int,          wxBaseArrayInt)
_WX_DEFINE_BASEARRAY(long,         wxBaseArrayLong)
_WX_DEFINE_BASEARRAY(size_t,       wxBaseArraySizeT)
_WX_DEFINE_BASEARRAY(double,       wxBaseArrayDouble)

#ifdef __INTELC__
    #pragma warning(pop)
#endif

#if wxUSE_STL
#include "wx/arrstr.h"

#include "wx/beforestd.h"
#include <functional>
#include "wx/afterstd.h"

_WX_DEFINE_BASEARRAY(wxString, wxBaseArrayStringBase)

// some compilers (Sun CC being the only known example) distinguish between
// extern "C" functions and the functions with C++ linkage and ptr_fun and
// wxStringCompareLess can't take wxStrcmp/wxStricmp directly as arguments in
// this case, we need the wrappers below to make this work
inline int wxStrcmpCppWrapper(const wxChar *p, const wxChar *q)
{
    return wxStrcmp(p, q);
}

inline int wxStricmpCppWrapper(const wxChar *p, const wxChar *q)
{
    return wxStricmp(p, q);
}

int wxArrayString::Index(const wxChar* sz, bool bCase, bool WXUNUSED(bFromEnd)) const
{
    wxArrayString::const_iterator it;

    if (bCase)
    {
        it = std::find_if(begin(), end(),
                          std::not1(
                              std::bind2nd(
                                  std::ptr_fun(wxStrcmpCppWrapper), sz)));
    }
    else // !bCase
    {
        it = std::find_if(begin(), end(),
                          std::not1(
                              std::bind2nd(
                                  std::ptr_fun(wxStricmpCppWrapper), sz)));
    }

    return it == end() ? wxNOT_FOUND : it - begin();
}

template<class F>
class wxStringCompareLess
{
public:
    wxStringCompareLess(F f) : m_f(f) { }
    bool operator()(const wxChar* s1, const wxChar* s2)
        { return m_f(s1, s2) < 0; }
    bool operator()(const wxString& s1, const wxString& s2)
        { return m_f(s1, s2) < 0; }
private:
    F m_f;
};

template<class F>
wxStringCompareLess<F> wxStringCompare(F f)
{
    return wxStringCompareLess<F>(f);
}

void wxArrayString::Sort(CompareFunction function)
{
    std::sort(begin(), end(), wxStringCompare(function));
}

void wxArrayString::Sort(bool reverseOrder)
{
    if (reverseOrder)
    {
        std::sort(begin(), end(), std::greater<wxString>());
    }
    else
    {
        std::sort(begin(), end());
    }
}

int wxSortedArrayString::Index(const wxChar* sz, bool bCase, bool WXUNUSED(bFromEnd)) const
{
    wxSortedArrayString::const_iterator it;
    wxString s(sz);

    if (bCase)
        it = std::lower_bound(begin(), end(), s,
                              wxStringCompare(wxStrcmpCppWrapper));
    else
        it = std::lower_bound(begin(), end(), s,
                              wxStringCompare(wxStricmpCppWrapper));

    if (it == end())
        return wxNOT_FOUND;

    if (bCase)
    {
        if (wxStrcmp(it->c_str(), sz) != 0)
            return wxNOT_FOUND;
    }
    else
    {
        if (wxStricmp(it->c_str(), sz) != 0)
            return wxNOT_FOUND;
    }

    return it - begin();
}

#endif
Commit	Line	Data
c801d85f	1	///////////////////////////////////////////////////////////////////////////////
ad9835c9	2	// Name: src/common/dynarray.cpp
c801d85f KB	3	// Purpose: implementation of wxBaseArray class
c801d85f KB	4	// Author: Vadim Zeitlin
3bfa4402	5	// Modified by:
c801d85f KB	6	// Created: 12.09.97
	7	// RCS-ID: $Id$
	8	// Copyright: (c) 1998 Vadim Zeitlin <zeitlin@dptmaths.ens-cachan.fr>
65571936	9	// Licence: wxWindows licence
c801d85f KB	10	///////////////////////////////////////////////////////////////////////////////
	11
	12	// ============================================================================
	13	// headers
	14	// ============================================================================
	15
ad9835c9	16	// For compilers that support precompilation, includes "wx.h".
3096bd2f	17	#include "wx/wxprec.h"
c801d85f KB	18
c801d85f KB	19	#ifdef __BORLANDC__
ad9835c9	20	#pragma hdrstop
c801d85f KB	21	#endif
c801d85f KB	22
ad9835c9 WS	23	#ifndef WX_PRECOMP
ad9835c9 WS	24	#include "wx/dynarray.h"
88a7a4e1	25	#include "wx/intl.h"
ad9835c9 WS	26	#endif //WX_PRECOMP
ad9835c9 WS	27
c801d85f	28	#include <stdlib.h>
3bfa4402	29	#include <string.h> // for memmove
c801d85f	30
acf88ae6 VZ	31	// we cast the value to long from which we cast it to void * in IndexForInsert:
acf88ae6 VZ	32	// this can't work if the pointers are not big enough
af5b273c	33	wxCOMPILE_TIME_ASSERT( sizeof(wxUIntPtr) <= sizeof(void *),
acf88ae6 VZ	34	wxArraySizeOfPtrLessSizeOfLong ); // < 32 symbols
acf88ae6 VZ	35
c801d85f KB	36	// ============================================================================
	37	// constants
	38	// ============================================================================
	39
	40	// size increment = max(50% of current size, ARRAY_MAXSIZE_INCREMENT)
	41	#define ARRAY_MAXSIZE_INCREMENT 4096
	42
	43	// ============================================================================
	44	// implementation
	45	// ============================================================================
	46
	47	// ----------------------------------------------------------------------------
5a1cad6e	48	// wxBaseArray - dynamic array of 'T's
c801d85f KB	49	// ----------------------------------------------------------------------------
c801d85f KB	50
df5168c4 MB	51	#define _WX_DEFINE_BASEARRAY_COMMON(T, name) \
	52	/* searches the array for an item (forward or backwards) */ \
	53	int name::Index(T lItem, bool bFromEnd) const \
	54	{ \
	55	if ( bFromEnd ) { \
	56	if ( size() > 0 ) { \
	57	size_t n = size(); \
	58	do { \
	59	if ( (*this)[--n] == lItem ) \
	60	return n; \
	61	} \
	62	while ( n != 0 ); \
	63	} \
	64	} \
	65	else { \
	66	for( size_t n = 0; n < size(); n++ ) { \
	67	if( (*this)[n] == lItem ) \
	68	return n; \
	69	} \
	70	} \
	71	\
	72	return wxNOT_FOUND; \
	73	} \
	74	\
	75	/* add item assuming the array is sorted with fnCompare function */ \
6992d326	76	size_t name::Add(T lItem, CMPFUNC fnCompare) \
df5168c4	77	{ \
6992d326 MB	78	size_t idx = IndexForInsert(lItem, fnCompare); \
	79	Insert(lItem, idx); \
	80	return idx; \
	81	}
df5168c4 MB	82
	83	#if wxUSE_STL
	84
	85	#define _WX_DEFINE_BASEARRAY_NOCOMMON(T, name) \
	86	size_t name::IndexForInsert(T lItem, CMPFUNC fnCompare) const \
	87	{ \
f700f98c	88	Predicate p((SCMPFUNC)fnCompare); \
df5168c4 MB	89	const_iterator it = std::lower_bound(begin(), end(), lItem, p); \
	90	return it - begin(); \
	91	} \
	92	\
	93	int name::Index(T lItem, CMPFUNC fnCompare) const \
	94	{ \
f700f98c MB	95	Predicate p((SCMPFUNC)fnCompare); \
f700f98c MB	96	const_iterator it = std::lower_bound(begin(), end(), lItem, p); \
10dcbe63 MB	97	return (it != end() && !p(lItem, *it)) ? \
10dcbe63 MB	98	(int)(it - begin()) : wxNOT_FOUND; \
df5168c4 MB	99	} \
	100	\
	101	void name::Shrink() \
	102	{ \
	103	name tmp(*this); \
	104	swap(tmp); \
	105	}
	106
	107	#else // if !wxUSE_STL
	108
	109	#define _WX_DEFINE_BASEARRAY_NOCOMMON(T, name) \
5a1cad6e GD	110	/* ctor */ \
	111	name::name() \
	112	{ \
	113	m_nSize = \
	114	m_nCount = 0; \
	115	m_pItems = (T *)NULL; \
	116	} \
	117	\
	118	/* copy ctor */ \
	119	name::name(const name& src) \
	120	{ \
	121	m_nSize = /* not src.m_nSize to save memory */ \
	122	m_nCount = src.m_nCount; \
	123	\
	124	if ( m_nSize != 0 ) { \
	125	m_pItems = new T[m_nSize]; \
	126	/* only copy if allocation succeeded */ \
	127	if ( m_pItems ) { \
	128	memcpy(m_pItems, src.m_pItems, m_nCount*sizeof(T)); \
	129	} \
	130	else { \
	131	m_nSize = 0; \
	132	} \
	133	} \
	134	else \
	135	m_pItems = (T *) NULL; \
	136	} \
	137	\
	138	/* assignment operator */ \
	139	name& name::operator=(const name& src) \
	140	{ \
	141	wxDELETEA(m_pItems); \
	142	\
	143	m_nSize = /* not src.m_nSize to save memory */ \
	144	m_nCount = src.m_nCount; \
	145	\
	146	if ( m_nSize != 0 ){ \
	147	m_pItems = new T[m_nSize]; \
	148	/* only copy if allocation succeeded */ \
	149	if ( m_pItems ) { \
	150	memcpy(m_pItems, src.m_pItems, m_nCount*sizeof(T)); \
	151	} \
	152	else { \
	153	m_nSize = 0; \
	154	} \
	155	} \
	156	else \
	157	m_pItems = (T *) NULL; \
	158	\
	159	return *this; \
	160	} \
	161	\
2abb9d2f VZ	162	/* allocate new buffer of the given size and move our data to it */ \
	163	bool name::Realloc(size_t nSize) \
	164	{ \
	165	T *pNew = new T[nSize]; \
	166	/* only grow if allocation succeeded */ \
	167	if ( !pNew ) \
	168	return false; \
	169	\
	170	m_nSize = nSize; \
	171	/* copy data to new location */ \
	172	memcpy(pNew, m_pItems, m_nCount*sizeof(T)); \
	173	delete [] m_pItems; \
	174	m_pItems = pNew; \
	175	\
	176	return true; \
	177	} \
	178	\
5a1cad6e	179	/* grow the array */ \
3b0b5f13	180	void name::Grow(size_t nIncrement) \
5a1cad6e GD	181	{ \
5a1cad6e GD	182	/* only do it if no more place */ \
2b5f62a0	183	if( (m_nCount == m_nSize) \|\| ((m_nSize - m_nCount) < nIncrement) ) { \
5a1cad6e	184	if( m_nSize == 0 ) { \
a1db4ad4 SN	185	/* was empty, determine initial size */ \
	186	size_t size = WX_ARRAY_DEFAULT_INITIAL_SIZE; \
	187	if (size < nIncrement) size = nIncrement; \
	188	/* allocate some memory */ \
	189	m_pItems = new T[size]; \
5a1cad6e GD	190	/* only grow if allocation succeeded */ \
5a1cad6e GD	191	if ( m_pItems ) { \
a1db4ad4	192	m_nSize = size; \
5a1cad6e GD	193	} \
	194	} \
	195	else \
	196	{ \
3b0b5f13 VZ	197	/* add at least 50% but not too much */ \
	198	size_t ndefIncrement = m_nSize < WX_ARRAY_DEFAULT_INITIAL_SIZE \
	199	? WX_ARRAY_DEFAULT_INITIAL_SIZE : m_nSize >> 1; \
	200	if ( ndefIncrement > ARRAY_MAXSIZE_INCREMENT ) \
	201	ndefIncrement = ARRAY_MAXSIZE_INCREMENT; \
	202	if ( nIncrement < ndefIncrement ) \
	203	nIncrement = ndefIncrement; \
2abb9d2f	204	Realloc(m_nSize + nIncrement); \
5a1cad6e GD	205	} \
	206	} \
	207	} \
	208	\
2abb9d2f VZ	209	/* make sure that the array has at least count elements */ \
	210	void name::SetCount(size_t count, T defval) \
	211	{ \
	212	if ( m_nSize < count ) \
	213	{ \
	214	/* need to realloc memory: don't overallocate it here as if */ \
	215	/* SetCount() is called, it probably means that the caller */ \
	216	/* knows in advance how many elements there will be in the */ \
	217	/* array and so it won't be necessary to realloc it later */ \
	218	if ( !Realloc(count) ) \
	219	{ \
	220	/* out of memory -- what can we do? */ \
	221	return; \
	222	} \
	223	} \
	224	\
	225	/* add new elements if we extend the array */ \
	226	while ( m_nCount < count ) \
	227	{ \
	228	m_pItems[m_nCount++] = defval; \
	229	} \
	230	} \
	231	\
5a1cad6e GD	232	/* dtor */ \
	233	name::~name() \
	234	{ \
	235	wxDELETEA(m_pItems); \
	236	} \
	237	\
	238	/* clears the list */ \
	239	void name::Clear() \
	240	{ \
	241	m_nSize = \
	242	m_nCount = 0; \
	243	\
	244	wxDELETEA(m_pItems); \
	245	} \
	246	\
	247	/* pre-allocates memory (frees the previous data!) */ \
	248	void name::Alloc(size_t nSize) \
	249	{ \
	250	/* only if old buffer was not big enough */ \
	251	if ( nSize > m_nSize ) { \
	252	wxDELETEA(m_pItems); \
	253	m_nSize = 0; \
	254	m_pItems = new T[nSize]; \
	255	/* only alloc if allocation succeeded */ \
	256	if ( m_pItems ) { \
	257	m_nSize = nSize; \
	258	} \
	259	} \
	260	\
	261	m_nCount = 0; \
	262	} \
	263	\
	264	/* minimizes the memory usage by freeing unused memory */ \
	265	void name::Shrink() \
	266	{ \
	267	/* only do it if we have some memory to free */ \
	268	if( m_nCount < m_nSize ) { \
	269	/* allocates exactly as much memory as we need */ \
	270	T *pNew = new T[m_nCount]; \
	271	/* only shrink if allocation succeeded */ \
	272	if ( pNew ) { \
	273	/* copy data to new location */ \
	274	memcpy(pNew, m_pItems, m_nCount*sizeof(T)); \
	275	delete [] m_pItems; \
	276	m_pItems = pNew; \
79e929e7 VZ	277	\
	278	/* update the size of the new block */ \
	279	m_nSize = m_nCount; \
5a1cad6e	280	} \
79e929e7	281	/* else: don't do anything, better keep old memory block! */ \
5a1cad6e GD	282	} \
	283	} \
	284	\
df5168c4 MB	285	/* add item at the end */ \
df5168c4 MB	286	void name::Add(T lItem, size_t nInsert) \
5a1cad6e	287	{ \
df5168c4 MB	288	if (nInsert == 0) \
	289	return; \
	290	Grow(nInsert); \
	291	for (size_t i = 0; i < nInsert; i++) \
	292	m_pItems[m_nCount++] = lItem; \
	293	} \
5a1cad6e	294	\
df5168c4 MB	295	/* add item at the given position */ \
	296	void name::Insert(T lItem, size_t nIndex, size_t nInsert) \
	297	{ \
	298	wxCHECK_RET( nIndex <= m_nCount, wxT("bad index in wxArray::Insert") ); \
	299	wxCHECK_RET( m_nCount <= m_nCount + nInsert, \
	300	wxT("array size overflow in wxArray::Insert") ); \
	301	\
	302	if (nInsert == 0) \
	303	return; \
	304	Grow(nInsert); \
	305	\
	306	memmove(&m_pItems[nIndex + nInsert], &m_pItems[nIndex], \
	307	(m_nCount - nIndex)*sizeof(T)); \
	308	for (size_t i = 0; i < nInsert; i++) \
	309	m_pItems[nIndex + i] = lItem; \
	310	m_nCount += nInsert; \
5a1cad6e GD	311	} \
	312	\
	313	/* search for a place to insert item into sorted array (binary search) */ \
	314	size_t name::IndexForInsert(T lItem, CMPFUNC fnCompare) const \
	315	{ \
	316	size_t i, \
	317	lo = 0, \
	318	hi = m_nCount; \
	319	int res; \
	320	\
	321	while ( lo < hi ) { \
	322	i = (lo + hi)/2; \
	323	\
af5b273c VZ	324	res = (fnCompare)((const void )(wxUIntPtr)lItem, \
af5b273c VZ	325	(const void *)(wxUIntPtr)(m_pItems[i])); \
5a1cad6e GD	326	if ( res < 0 ) \
	327	hi = i; \
	328	else if ( res > 0 ) \
	329	lo = i + 1; \
	330	else { \
	331	lo = i; \
	332	break; \
	333	} \
	334	} \
	335	\
	336	return lo; \
	337	} \
	338	\
	339	/* search for an item in a sorted array (binary search) */ \
	340	int name::Index(T lItem, CMPFUNC fnCompare) const \
	341	{ \
	342	size_t n = IndexForInsert(lItem, fnCompare); \
	343	\
bb793b0c	344	return (n >= m_nCount \|\| \
af5b273c VZ	345	(fnCompare)((const void )(wxUIntPtr)lItem, \
	346	((const void *)(wxUIntPtr)m_pItems[n]))) \
	347	? wxNOT_FOUND \
	348	: (int)n; \
5a1cad6e GD	349	} \
5a1cad6e GD	350	\
5a1cad6e	351	/* removes item from array (by index) */ \
3b0b5f13	352	void name::RemoveAt(size_t nIndex, size_t nRemove) \
5a1cad6e	353	{ \
3b0b5f13 VZ	354	wxCHECK_RET( nIndex < m_nCount, wxT("bad index in wxArray::RemoveAt") ); \
	355	wxCHECK_RET( nIndex + nRemove <= m_nCount, \
	356	wxT("removing too many elements in wxArray::RemoveAt") ); \
5a1cad6e	357	\
3b0b5f13 VZ	358	memmove(&m_pItems[nIndex], &m_pItems[nIndex + nRemove], \
	359	(m_nCount - nIndex - nRemove)*sizeof(T)); \
	360	m_nCount -= nRemove; \
5a1cad6e GD	361	} \
	362	\
	363	/* removes item from array (by value) */ \
	364	void name::Remove(T lItem) \
	365	{ \
	366	int iIndex = Index(lItem); \
	367	\
	368	wxCHECK_RET( iIndex != wxNOT_FOUND, \
	369	wxT("removing inexistent item in wxArray::Remove") ); \
	370	\
	371	RemoveAt((size_t)iIndex); \
	372	} \
	373	\
	374	/* sort array elements using passed comparaison function */ \
	375	void name::Sort(CMPFUNC fCmp) \
	376	{ \
	377	qsort(m_pItems, m_nCount, sizeof(T), fCmp); \
360b63dd MB	378	} \
	379	\
	380	void name::assign(const_iterator first, const_iterator last) \
	381	{ \
	382	clear(); \
	383	reserve(last - first); \
	384	for(; first != last; ++first) \
	385	push_back(*first); \
	386	} \
	387	\
	388	void name::assign(size_type n, const_reference v) \
	389	{ \
	390	clear(); \
	391	reserve(n); \
	392	for( size_type i = 0; i < n; ++i ) \
	393	push_back(v); \
	394	} \
	395	\
	396	void name::insert(iterator it, const_iterator first, const_iterator last) \
	397	{ \
	398	size_t nInsert = last - first, nIndex = it - begin(); \
	399	if (nInsert == 0) \
	400	return; \
	401	Grow(nInsert); \
	402	\
	403	memmove(&m_pItems[nIndex + nInsert], &m_pItems[nIndex], \
	404	(m_nCount - nIndex)*sizeof(T)); \
	405	for (size_t i = 0; i < nInsert; ++i, ++it, ++first) \
	406	it = first; \
	407	m_nCount += nInsert; \
c801d85f KB	408	}
c801d85f KB	409
df5168c4 MB	410	#endif
	411
	412	#define _WX_DEFINE_BASEARRAY(T, name) \
	413	_WX_DEFINE_BASEARRAY_COMMON(T, name) \
	414	_WX_DEFINE_BASEARRAY_NOCOMMON(T, name)
	415
17a1ebd1 VZ	416	#ifdef __INTELC__
	417	#pragma warning(push)
	418	#pragma warning(disable: 1684)
	419	#pragma warning(disable: 1572)
	420	#endif
	421
f1322419 VZ	422	_WX_DEFINE_BASEARRAY(const void *, wxBaseArrayPtrVoid)
	423	_WX_DEFINE_BASEARRAY(short, wxBaseArrayShort)
	424	_WX_DEFINE_BASEARRAY(int, wxBaseArrayInt)
	425	_WX_DEFINE_BASEARRAY(long, wxBaseArrayLong)
e55e9486	426	_WX_DEFINE_BASEARRAY(size_t, wxBaseArraySizeT)
360b63dd	427	_WX_DEFINE_BASEARRAY(double, wxBaseArrayDouble)
c801d85f	428
17a1ebd1 VZ	429	#ifdef __INTELC__
	430	#pragma warning(pop)
	431	#endif
	432
df5168c4 MB	433	#if wxUSE_STL
	434	#include "wx/arrstr.h"
	435
2da2f941 MB	436	#include "wx/beforestd.h"
	437	#include <functional>
	438	#include "wx/afterstd.h"
	439
e786a78b	440	_WX_DEFINE_BASEARRAY(wxString, wxBaseArrayStringBase)
2da2f941	441
48e4ba4f VZ	442	// some compilers (Sun CC being the only known example) distinguish between
	443	// extern "C" functions and the functions with C++ linkage and ptr_fun and
	444	// wxStringCompareLess can't take wxStrcmp/wxStricmp directly as arguments in
	445	// this case, we need the wrappers below to make this work
	446	inline int wxStrcmpCppWrapper(const wxChar p, const wxChar q)
	447	{
	448	return wxStrcmp(p, q);
	449	}
	450
	451	inline int wxStricmpCppWrapper(const wxChar p, const wxChar q)
	452	{
	453	return wxStricmp(p, q);
	454	}
	455
a1d48124	456	int wxArrayString::Index(const wxChar* sz, bool bCase, bool WXUNUSED(bFromEnd)) const
2da2f941 MB	457	{
	458	wxArrayString::const_iterator it;
	459
	460	if (bCase)
48e4ba4f	461	{
2da2f941	462	it = std::find_if(begin(), end(),
48e4ba4f VZ	463	std::not1(
	464	std::bind2nd(
	465	std::ptr_fun(wxStrcmpCppWrapper), sz)));
	466	}
	467	else // !bCase
	468	{
2da2f941	469	it = std::find_if(begin(), end(),
48e4ba4f VZ	470	std::not1(
	471	std::bind2nd(
	472	std::ptr_fun(wxStricmpCppWrapper), sz)));
	473	}
2da2f941 MB	474
	475	return it == end() ? wxNOT_FOUND : it - begin();
	476	}
	477
4e75b65f	478	template<class F>
2da2f941 MB	479	class wxStringCompareLess
	480	{
	481	public:
4e75b65f	482	wxStringCompareLess(F f) : m_f(f) { }
2da2f941 MB	483	bool operator()(const wxChar* s1, const wxChar* s2)
2da2f941 MB	484	{ return m_f(s1, s2) < 0; }
4e75b65f MB	485	bool operator()(const wxString& s1, const wxString& s2)
4e75b65f MB	486	{ return m_f(s1, s2) < 0; }
2da2f941	487	private:
4e75b65f	488	F m_f;
2da2f941 MB	489	};
2da2f941 MB	490
4e75b65f MB	491	template<class F>
	492	wxStringCompareLess<F> wxStringCompare(F f)
	493	{
	494	return wxStringCompareLess<F>(f);
	495	}
	496
	497	void wxArrayString::Sort(CompareFunction function)
	498	{
	499	std::sort(begin(), end(), wxStringCompare(function));
	500	}
	501
	502	void wxArrayString::Sort(bool reverseOrder)
	503	{
	504	if (reverseOrder)
	505	{
	506	std::sort(begin(), end(), std::greater<wxString>());
	507	}
	508	else
	509	{
	510	std::sort(begin(), end());
	511	}
	512	}
	513
a1d48124	514	int wxSortedArrayString::Index(const wxChar* sz, bool bCase, bool WXUNUSED(bFromEnd)) const
2da2f941 MB	515	{
2da2f941 MB	516	wxSortedArrayString::const_iterator it;
4e75b65f	517	wxString s(sz);
2da2f941 MB	518
2da2f941 MB	519	if (bCase)
4e75b65f MB	520	it = std::lower_bound(begin(), end(), s,
4e75b65f MB	521	wxStringCompare(wxStrcmpCppWrapper));
2da2f941	522	else
4e75b65f MB	523	it = std::lower_bound(begin(), end(), s,
4e75b65f MB	524	wxStringCompare(wxStricmpCppWrapper));
2da2f941	525
e11d2abe	526	if (it == end())
2da2f941	527	return wxNOT_FOUND;
e11d2abe WS	528
	529	if (bCase)
	530	{
	531	if (wxStrcmp(it->c_str(), sz) != 0)
	532	return wxNOT_FOUND;
	533	}
	534	else
	535	{
	536	if (wxStricmp(it->c_str(), sz) != 0)
	537	return wxNOT_FOUND;
	538	}
	539
2da2f941 MB	540	return it - begin();
2da2f941 MB	541	}
df5168c4 MB	542
df5168c4 MB	543	#endif