include/wx/dynarray.h

   1 ///////////////////////////////////////////////////////////////////////////////
   2 // Name:        dynarray.h
   3 // Purpose:     auto-resizable (i.e. dynamic) array support
   4 // Author:      Vadim Zeitlin
   5 // Modified by:
   6 // Created:     12.09.97
   7 // RCS-ID:      $Id$
   8 // Copyright:   (c) 1998 Vadim Zeitlin <zeitlin@dptmaths.ens-cachan.fr>
   9 // Licence:     wxWindows license
  10 ///////////////////////////////////////////////////////////////////////////////
  11
  12 #ifndef   _DYNARRAY_H
  13 #define   _DYNARRAY_H
  14
  15 #ifdef __GNUG__
  16 #pragma interface "dynarray.h"
  17 #endif
  18
  19 #include "wx/defs.h"
  20 #include "wx/debug.h"
  21
  22 /** @name Dynamic arrays and object arrays (array which own their elements)
  23     @memo Arrays which grow on demand and do range checking (only in debug)
  24   */
  25 //@{
  26
  27 // ----------------------------------------------------------------------------
  28 // constants
  29 // ----------------------------------------------------------------------------
  30
  31 /**
  32  the initial size by which an array grows when an element is added
  33  default value avoids allocate one or two bytes when the array is created
  34  which is rather inefficient
  35 */
  36 #define   WX_ARRAY_DEFAULT_INITIAL_SIZE    (16)
  37
  38 // ----------------------------------------------------------------------------
  39 // types
  40 // ----------------------------------------------------------------------------
  41
  42 /**
  43  callback compare function for quick sort
  44  must return negative value, 0 or positive value if pItem1 <, = or > pItem2
  45  */
  46
  47 #if defined(__VISUALC__)
  48   #define   CMPFUNC_CONV    _cdecl
  49 #elif defined(__VISAGECPP__)
  50   #define   CMPFUNC_CONV    _Optlink
  51 #else   // !Visual C++
  52   #define   CMPFUNC_CONV
  53 #endif  // compiler
  54 typedef int (CMPFUNC_CONV *CMPFUNC)(const void* pItem1, const void* pItem2);
  55
  56 // ----------------------------------------------------------------------------
  57 /**
  58  base class managing data having size of type 'long' (not used directly)
  59
  60  NB: for efficiency this often used class has no virtual functions (hence no
  61      VTBL), even dtor is <B>not</B> virtual. If used as expected it won't
  62      create any problems because ARRAYs from DEFINE_ARRAY have no dtor at all,
  63      so it's not too important if it's not called (this happens when you cast
  64      "SomeArray *" as "BaseArray *" and then delete it)
  65
  66   @memo Base class for template array classes
  67 */
  68 // ----------------------------------------------------------------------------
  69 class WXDLLEXPORT wxBaseArray
  70 {
  71 public:
  72   /** @name ctors and dtor */
  73   //@{
  74     /// default ctor
  75   wxBaseArray();
  76     /// copy ctor
  77   wxBaseArray(const wxBaseArray& array);
  78     /// assignment operator
  79   wxBaseArray& operator=(const wxBaseArray& src);
  80     /// not virtual, see above
  81     /// EXCEPT for Gnu compiler to reduce warnings...
  82 #ifdef __GNUG__
  83  virtual
  84 #endif
  85   ~wxBaseArray();
  86   //@}
  87
  88   /** @name memory management */
  89   //@{
  90     /// empties the array, but doesn't release memory
  91   void Empty() { m_nCount = 0; }
  92     /// empties the array and releases memory
  93   void Clear();
  94     /// preallocates memory for given number of items
  95   void Alloc(size_t uiSize);
  96     /// minimizes the memory used by the array (frees unused memory)
  97   void Shrink();
  98   //@}
  99
 100   /** @name simple accessors */
 101   //@{
 102     /// number of elements in the array
 103   size_t  Count() const   { return m_nCount;      }
 104   size_t  GetCount() const   { return m_nCount;      }
 105     /// is it empty?
 106   bool  IsEmpty() const { return m_nCount == 0; }
 107   //@}
 108
 109 protected:
 110   // these methods are protected because if they were public one could
 111   // mistakenly call one of them instead of DEFINE_ARRAY's or OBJARRAY's
 112   // type safe methods
 113
 114   /** @name items access */
 115   //@{
 116     /// get item at position uiIndex (range checking is done in debug version)
 117   long& Item(size_t uiIndex) const
 118     { wxASSERT( uiIndex < m_nCount ); return m_pItems[uiIndex]; }
 119     /// same as Item()
 120   long& operator[](size_t uiIndex) const { return Item(uiIndex); }
 121   //@}
 122
 123   /** @name item management */
 124   //@{
 125     /**
 126       Search the element in the array, starting from the either side
 127       @param bFromEnd if TRUE, start from the end
 128       @return index of the first item matched or wxNOT_FOUND
 129       @see wxNOT_FOUND
 130      */
 131   int Index(long lItem, bool bFromEnd = FALSE) const;
 132     /// search for an item using binary search in a sorted array
 133   int Index(long lItem, CMPFUNC fnCompare) const;
 134     /// add new element at the end
 135   void Add(long lItem);
 136     /// add item assuming the array is sorted with fnCompare function
 137   void Add(long lItem, CMPFUNC fnCompare);
 138     /// add new element at given position (it becomes Item[uiIndex])
 139   void Insert(long lItem, size_t uiIndex);
 140     /// remove first item matching this value
 141   void Remove(long lItem);
 142     /// remove item by index
 143   void Remove(size_t uiIndex);
 144   //@}
 145
 146   /// sort array elements using given compare function
 147   void Sort(CMPFUNC fnCompare);
 148
 149 private:
 150   void    Grow();     // makes array bigger if needed
 151
 152   size_t  m_nSize,    // current size of the array
 153           m_nCount;   // current number of elements
 154
 155   long   *m_pItems;   // pointer to data
 156 };
 157
 158 // ============================================================================
 159 // template classes
 160 // ============================================================================
 161
 162 // ----------------------------------------------------------------------------
 163 // This macro generates a new array class. It is intended for storage of simple
 164 // types of sizeof()<=sizeof(long) or pointers if sizeof(pointer)<=sizeof(long)
 165 //
 166 // NB: it has only inline functions => takes no space at all
 167 // Mod by JACS: Salford C++ doesn't like 'var->operator=' syntax, as in:
 168 //    { ((wxBaseArray *)this)->operator=((const wxBaseArray&)src);
 169 // so using a temporary variable instead.
 170 // ----------------------------------------------------------------------------
 171 #define  _WX_DEFINE_ARRAY(T, name)                                  \
 172 typedef int (CMPFUNC_CONV *CMPFUNC##T)(T *pItem1, T *pItem2);       \
 173 class WXDLLEXPORT name : public wxBaseArray                         \
 174 {                                                                   \
 175 public:                                                             \
 176   name()                                                            \
 177   { size_t type = sizeof(T);                                        \
 178     size_t sizelong = sizeof(long);                                 \
 179     wxASSERT( type <= sizelong );                                   \
 180   }                                                                 \
 181                                                                     \
 182   name& operator=(const name& src)                                  \
 183     { wxBaseArray* temp = (wxBaseArray*) this;                      \
 184       (*temp) = ((const wxBaseArray&)src);                          \
 185       return *this; }                                               \
 186                                                                     \
 187   T& operator[](size_t uiIndex) const                               \
 188     { return (T&)(wxBaseArray::Item(uiIndex)); }                    \
 189   T& Item(size_t uiIndex) const                                     \
 190     { return (T&)(wxBaseArray::Item(uiIndex)); }                    \
 191   T& Last() const                                                   \
 192     { return (T&)(wxBaseArray::Item(Count() - 1)); }                \
 193                                                                     \
 194   int Index(T Item, bool bFromEnd = FALSE) const                    \
 195     { return wxBaseArray::Index((long)Item, bFromEnd); }            \
 196                                                                     \
 197   void Add(T Item)                                                  \
 198     { wxBaseArray::Add((long)Item); }                               \
 199   void Insert(T Item, size_t uiIndex)                               \
 200     { wxBaseArray::Insert((long)Item, uiIndex) ; }                  \
 201                                                                     \
 202   void Remove(size_t uiIndex) { wxBaseArray::Remove(uiIndex); }     \
 203   void Remove(T Item)                                               \
 204     { int iIndex = Index(Item);                                     \
 205       wxCHECK2_MSG( iIndex != wxNOT_FOUND, return,                  \
 206         _T("removing inexisting element in wxArray::Remove") );     \
 207       wxBaseArray::Remove((size_t)iIndex); }                        \
 208                                                                     \
 209   void Sort(CMPFUNC##T fCmp) { wxBaseArray::Sort((CMPFUNC)fCmp); }  \
 210 }
 211
 212 // ----------------------------------------------------------------------------
 213 // This is the same as the previous macro, but it defines a sorted array.
 214 // Differences:
 215 //  1) it must be given a COMPARE function in ctor which takes 2 items of type
 216 //     T* and should return -1, 0 or +1 if the first one is less/greater
 217 //     than/equal to the second one.
 218 //  2) the Add() method inserts the item in such was that the array is always
 219 //     sorted (it uses the COMPARE function)
 220 //  3) it has no Sort() method because it's always sorted
 221 //  4) Index() method is much faster (the sorted arrays use binary search
 222 //     instead of linear one), but Add() is slower.
 223 //
 224 // Summary: use this class when the speed of Index() function is important, use
 225 // the normal arrays otherwise.
 226 //
 227 // NB: it has only inline functions => takes no space at all
 228 // Mod by JACS: Salford C++ doesn't like 'var->operator=' syntax, as in:
 229 //    { ((wxBaseArray *)this)->operator=((const wxBaseArray&)src);
 230 // so using a temporary variable instead.
 231 // ----------------------------------------------------------------------------
 232 #define  _WX_DEFINE_SORTED_ARRAY(T, name)                           \
 233 typedef int (CMPFUNC_CONV *SCMPFUNC##T)(T pItem1, T pItem2);        \
 234 class WXDLLEXPORT name : public wxBaseArray                         \
 235 {                                                                   \
 236 public:                                                             \
 237   name(SCMPFUNC##T fn)                                              \
 238   { size_t type = sizeof(T);                                        \
 239     size_t sizelong = sizeof(long);                                 \
 240     wxASSERT( type <= sizelong );                                   \
 241     m_fnCompare = fn;                                               \
 242   }                                                                 \
 243                                                                     \
 244   name& operator=(const name& src)                                  \
 245     { wxBaseArray* temp = (wxBaseArray*) this;                      \
 246       (*temp) = ((const wxBaseArray&)src);                          \
 247       m_fnCompare = src.m_fnCompare;                                \
 248       return *this; }                                               \
 249                                                                     \
 250   T& operator[](size_t uiIndex) const                               \
 251     { return (T&)(wxBaseArray::Item(uiIndex)); }                    \
 252   T& Item(size_t uiIndex) const                                     \
 253     { return (T&)(wxBaseArray::Item(uiIndex)); }                    \
 254   T& Last() const                                                   \
 255     { return (T&)(wxBaseArray::Item(Count() - 1)); }                \
 256                                                                     \
 257   int Index(T Item) const                                           \
 258     { return wxBaseArray::Index((long)Item, (CMPFUNC)m_fnCompare); }\
 259                                                                     \
 260   void Add(T Item)                                                  \
 261     { wxBaseArray::Add((long)Item, (CMPFUNC)m_fnCompare); }         \
 262                                                                     \
 263   void Remove(size_t uiIndex) { wxBaseArray::Remove(uiIndex); }     \
 264   void Remove(T Item)                                               \
 265     { int iIndex = Index(Item);                                     \
 266       wxCHECK2_MSG( iIndex != wxNOT_FOUND, return,                  \
 267         _T("removing inexisting element in wxArray::Remove") );     \
 268       wxBaseArray::Remove((size_t)iIndex); }                        \
 269                                                                     \
 270 private:                                                            \
 271   SCMPFUNC##T m_fnCompare;                                          \
 272 }
 273
 274 // ----------------------------------------------------------------------------
 275 // see WX_DECLARE_OBJARRAY and WX_DEFINE_OBJARRAY
 276 // ----------------------------------------------------------------------------
 277 #define _WX_DECLARE_OBJARRAY(T, name)                               \
 278 typedef int (CMPFUNC_CONV *CMPFUNC##T)(T** pItem1, T** pItem2);     \
 279 class WXDLLEXPORT name : public wxBaseArray                         \
 280 {                                                                   \
 281 public:                                                             \
 282   name() { }                                                        \
 283   name(const name& src);                                            \
 284   name& operator=(const name& src);                                 \
 285                                                                     \
 286   ~name();                                                          \
 287                                                                     \
 288   T& operator[](size_t uiIndex) const                               \
 289     { return *(T*)wxBaseArray::Item(uiIndex); }                     \
 290   T& Item(size_t uiIndex) const                                     \
 291     { return *(T*)wxBaseArray::Item(uiIndex); }                     \
 292   T& Last() const                                                   \
 293     { return *(T*)(wxBaseArray::Item(Count() - 1)); }               \
 294                                                                     \
 295   int Index(const T& Item, bool bFromEnd = FALSE) const;            \
 296                                                                     \
 297   void Add(const T& Item);                                          \
 298   void Add(const T* pItem)                                          \
 299     { wxBaseArray::Add((long)pItem); }                              \
 300                                                                     \
 301   void Insert(const T& Item,  size_t uiIndex);                      \
 302   void Insert(const T* pItem, size_t uiIndex)                       \
 303     { wxBaseArray::Insert((long)pItem, uiIndex); }                  \
 304                                                                     \
 305   void Empty();                                                     \
 306                                                                     \
 307   T*   Detach(size_t uiIndex)                                       \
 308     { T* p = (T*)wxBaseArray::Item(uiIndex);                        \
 309       wxBaseArray::Remove(uiIndex); return p; }                     \
 310   void Remove(size_t uiIndex);                                      \
 311                                                                     \
 312   void Sort(CMPFUNC##T fCmp) { wxBaseArray::Sort((CMPFUNC)fCmp); }  \
 313                                                                     \
 314 private:                                                            \
 315   void DoCopy(const name& src);                                     \
 316 }
 317
 318 // ----------------------------------------------------------------------------
 319 /** @name Macros for definition of dynamic arrays and objarrays
 320
 321   These macros are ugly (especially if you look in the sources ;-), but they
 322   allow us to define 'template' classes without actually using templates.
 323   <BR>
 324   <BR>
 325   Range checking is performed in debug build for both arrays and objarrays.
 326   Type checking is done at compile-time. Warning: arrays <I>never</I> shrink,
 327   they only grow, so loading 10 millions in an array only to delete them 2
 328   lines below is <I>not</I> recommended. However, it does free memory when
 329   it's destroyed, so if you destroy array also, it's ok.
 330   */
 331 // ----------------------------------------------------------------------------
 332
 333 //@{
 334   /**
 335    This macro generates a new array class. It is intended for storage of simple
 336    types of sizeof()<=sizeof(long) or pointers if sizeof(pointer)<=sizeof(long)
 337    <BR>
 338    NB: it has only inline functions => takes no space at all
 339    <BR>
 340
 341    @memo declare and define array class 'name' containing elements of type 'T'
 342   */
 343 #define WX_DEFINE_ARRAY(T, name)  typedef T _A##name;                        \
 344                                   _WX_DEFINE_ARRAY(_A##name, name)
 345
 346   /**
 347    This macro does the same as WX_DEFINE_ARRAY except that the array will be
 348    sorted with the specified compare function.
 349    */
 350 #define WX_DEFINE_SORTED_ARRAY(T, name)  typedef T _A##name;                 \
 351                                   _WX_DEFINE_SORTED_ARRAY(_A##name, name)
 352
 353   /**
 354    This macro generates a new objarrays class which owns the objects it
 355    contains, i.e. it will delete them when it is destroyed. An element is of
 356    type T*, but arguments of type T& are taken (see below!) and T& is
 357    returned. <BR>
 358    Don't use this for simple types such as "int" or "long"!
 359    You _may_ use it for "double" but it's awfully inefficient.
 360    <BR>
 361    <BR>
 362    Note on Add/Insert functions:
 363    <BR>
 364     1) function(T*) gives the object to the array, i.e. it will delete the
 365        object when it's removed or in the array's dtor
 366    <BR>
 367     2) function(T&) will create a copy of the object and work with it
 368    <BR>
 369    <BR>
 370    Also:
 371    <BR>
 372     1) Remove() will delete the object after removing it from the array
 373    <BR>
 374     2) Detach() just removes the object from the array (returning pointer to it)
 375    <BR>
 376    <BR>
 377    NB1: Base type T should have an accessible copy ctor  if  Add(T&) is used,
 378    <BR>
 379    NB2: Never ever cast a array to it's base type: as dtor is <B>not</B> virtual
 380         it will provoke memory leaks
 381    <BR>
 382    <BR>
 383    some functions of this class are not inline, so it takes some space to
 384    define new class from this template.
 385
 386    @memo declare objarray class 'name' containing elements of type 'T'
 387   */
 388 #define WX_DECLARE_OBJARRAY(T, name)  typedef T _L##name;                 \
 389                                       _WX_DECLARE_OBJARRAY(_L##name, name)
 390   /**
 391     To use an objarray class you must
 392     <ll>
 393     <li>#include "dynarray.h"
 394     <li>WX_DECLARE_OBJARRAY(element_type, list_class_name)
 395     <li>#include "arrimpl.cpp"
 396     <li>WX_DEFINE_OBJARRAY(list_class_name)   // same as above!
 397     </ll>
 398     <BR><BR>
 399     This is necessary because at the moment of DEFINE_OBJARRAY class
 400     element_type must be fully defined (i.e. forward declaration is not
 401     enough), while WX_DECLARE_OBJARRAY may be done anywhere. The separation of
 402     two allows to break cicrcular dependencies with classes which have member
 403     variables of objarray type.
 404
 405     @memo define (must include arrimpl.cpp!) objarray class 'name'
 406    */
 407 #define WX_DEFINE_OBJARRAY(name)       "don't forget to include arrimpl.cpp!"
 408 //@}
 409
 410 // ----------------------------------------------------------------------------
 411 /** @name Some commonly used predefined arrays */
 412 // # overhead if not used?
 413 // ----------------------------------------------------------------------------
 414
 415 //@{
 416   /** @name ArrayInt */
 417 WX_DEFINE_ARRAY(int,    wxArrayInt);
 418   /** @name ArrayLong */
 419 WX_DEFINE_ARRAY(long,   wxArrayLong);
 420   /** @name ArrayPtrVoid */
 421 WX_DEFINE_ARRAY(void *, wxArrayPtrVoid);
 422 //@}
 423
 424 //@}
 425
 426 // -----------------------------------------------------------------------------
 427 // convinience macros
 428 // -----------------------------------------------------------------------------
 429
 430 // delete all array elements
 431 //
 432 // NB: the class declaration of the array elements must be visible from the
 433 //     place where you use this macro, otherwise the proper destructor may not
 434 //     be called (a decent compiler should give a warning about it, but don't
 435 //     count on it)!
 436 #define WX_CLEAR_ARRAY(array)                                                 \
 437     {                                                                         \
 438         size_t count = array.Count();                                         \
 439         for ( size_t n = 0; n < count; n++ )                                  \
 440         {                                                                     \
 441             delete array[n];                                                  \
 442         }                                                                     \
 443                                                                               \
 444         array.Empty();                                                        \
 445     }
 446 #endif // _DYNARRAY_H
 447