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