]> git.saurik.com Git - wxWidgets.git/blame - docs/latex/wx/array.tex
removed unused variable
[wxWidgets.git] / docs / latex / wx / array.tex
CommitLineData
6e6110ee
VZ
1\section{\class{wxArray}}\label{wxarray}
2
247aba10
VZ
3This section describes the so called {\it dynamic arrays}. This is a C
4array-like data structure i.e. the member access time is constant (and not
06ad8636 5linear according to the number of container elements as for linked lists). However, these
247aba10
VZ
6arrays are dynamic in the sense that they will automatically allocate more
7memory if there is not enough of it for adding a new element. They also perform
8range checking on the index values but in debug mode only, so please be sure to
437c49b2
JS
9compile your application in debug mode to use it (see \helpref{debugging overview}{debuggingoverview} for
10details). So, unlike the arrays in some other
247aba10
VZ
11languages, attempt to access an element beyond the arrays bound doesn't
12automatically expand the array but provokes an assertion failure instead in
13debug build and does nothing (except possibly crashing your program) in the
14release build.
15
16The array classes were designed to be reasonably efficient, both in terms of
17run-time speed and memory consumption and the executable size. The speed of
06ad8636 18array item access is, of course, constant (independent of the number of elements)
247aba10
VZ
19making them much more efficient than linked lists (\helpref{wxList}{wxlist}).
20Adding items to the arrays is also implemented in more or less constant time -
437c49b2
JS
21but the price is preallocating the memory in advance. In the \helpref{memory management}{wxarraymemorymanagement} section
22you may find some useful hints about optimizing wxArray memory usage. As for executable size, all
247aba10
VZ
23wxArray functions are inline, so they do not take {\it any space at all}.
24
25wxWindows has three different kinds of array. All of them derive from
26wxBaseArray class which works with untyped data and can not be used directly.
27The standard macros WX\_DEFINE\_ARRAY(), WX\_DEFINE\_SORTED\_ARRAY() and
28WX\_DEFINE\_OBJARRAY() are used to define a new class deriving from it. The
29classes declared will be called in this documentation wxArray, wxSortedArray and
30wxObjArray but you should keep in mind that no classes with such names actually
31exist, each time you use one of WX\_DEFINE\_XXXARRAY macro you define a class
32with a new name. In fact, these names are "template" names and each usage of one
33of the macros mentioned above creates a template specialization for the given
34element type.
35
36wxArray is suitable for storing integer types and pointers which it does not
37treat as objects in any way, i.e. the element pointed to by the pointer is not
06ad8636
JS
38deleted when the element is removed from the array. It should be noted that
39all of wxArray's functions are inline, so it costs strictly nothing to define as
247aba10
VZ
40many array types as you want (either in terms of the executable size or the
41speed) as long as at least one of them is defined and this is always the case
b2ff82b9
VZ
42because wxArrays are used by wxWindows internally. This class has one serious
43limitation: it can only be used for storing integral types (bool, char, short,
44int, long and their unsigned variants) or pointers (of any kind). An attempt
45to use with objects of sizeof() greater than sizeof(long) will provoke a
46runtime assertion failure, however declaring a wxArray of floats will not (on
47the machines where sizeof(float) <= sizeof(long)), yet it will {\bf not} work,
48please use wxObjArray for storing floats and doubles (NB: a more efficient
49wxArrayDouble class is scheduled for the next release of wxWindows).
247aba10
VZ
50
51wxSortedArray is a wxArray variant which should be used when searching in the
52array is a frequently used operation. It requires you to define an additional
53function for comparing two elements of the array element type and always stores
f6bcfd97 54its items in the sorted order (according to this function). Thus, it is
437c49b2 55 \helpref{Index()}{wxarrayindex} function execution time is $O(log(N))$ instead of
247aba10
VZ
56$O(N)$ for the usual arrays but the \helpref{Add()}{wxarrayadd} method is
57slower: it is $O(log(N))$ instead of constant time (neglecting time spent in
58memory allocation routine). However, in a usual situation elements are added to
59an array much less often than searched inside it, so wxSortedArray may lead to
d1b5756b 60huge performance improvements compared to wxArray. Finally, it should be
b2ff82b9
VZ
61noticed that, as wxArray, wxSortedArray can be only used for storing integral
62types or pointers.
247aba10
VZ
63
64wxObjArray class treats its elements like "objects". It may delete them when
65they are removed from the array (invoking the correct destructor) and copies
66them using the objects copy constructor. In order to implement this behaviour
67the definition of the wxObjArray arrays is split in two parts: first, you should
68declare the new wxObjArray class using WX\_DECLARE\_OBJARRAY() macro and then
69you must include the file defining the implementation of template type:
70<wx/arrimpl.cpp> and define the array class with WX\_DEFINE\_OBJARRAY() macro
71from a point where the full (as opposed to `forward') declaration of the array
72elements class is in scope. As it probably sounds very complicated here is an
73example:
74
75\begin{verbatim}
76#include <wx/dynarray.h>
77
f6bcfd97 78// we must forward declare the array because it is used inside the class
247aba10
VZ
79// declaration
80class MyDirectory;
81class MyFile;
82
83// this defines two new types: ArrayOfDirectories and ArrayOfFiles which can be
84// now used as shown below
85WX_DECLARE_OBJARRAY(MyDirectory, ArrayOfDirectories);
86WX_DECLARE_OBJARRAY(MyFile, ArrayOfFiles);
87
88class MyDirectory
89{
90...
91 ArrayOfDirectories m_subdirectories; // all subdirectories
92 ArrayOfFiles m_files; // all files in this directory
93};
94
95...
96
97// now that we have MyDirectory declaration in scope we may finish the
43c9c17d
VZ
98// definition of ArrayOfDirectories -- note that this expands into some C++
99// code and so should only be compiled once (i.e., don't put this in the
2edb0bde 100// header, but into a source file or you will get linking errors)
247aba10
VZ
101#include <wx/arrimpl.cpp> // this is a magic incantation which must be done!
102WX_DEFINE_OBJARRAY(ArrayOfDirectories);
103
104// that's all!
247aba10
VZ
105\end{verbatim}
106
107It is not as elegant as writing
108
109\begin{verbatim}
110typedef std::vector<MyDirectory> ArrayOfDirectories;
111\end{verbatim}
437c49b2 112
247aba10
VZ
113but is not that complicated and allows the code to be compiled with any, however
114dumb, C++ compiler in the world.
115
06ad8636 116Things are much simpler for wxArray and wxSortedArray however: it is enough
247aba10
VZ
117just to write
118
119\begin{verbatim}
1cc603c1
VZ
120WX_DEFINE_ARRAY(int, ArrayOfDirectories);
121WX_DEFINE_SORTED_ARRAY(int, ArrayOfFiles);
247aba10
VZ
122\end{verbatim}
123
1cc603c1
VZ
124i.e. there is only one {\tt DEFINE} macro and no need for separate
125{\tt DECLARE} one.
126
127
247aba10
VZ
128\wxheading{See also:}
129
130\helpref{Container classes overview}{wxcontaineroverview}, \helpref{wxList}{wxlist}
131
babc9758 132\wxheading{Include files}
247aba10
VZ
133
134<wx/dynarray.h> for wxArray and wxSortedArray and additionally <wx/arrimpl.cpp>
135for wxObjArray.
136
137\latexignore{\rtfignore{\wxheading{Function groups}}}
138
139\membersection{Macros for template array definition}
140
141To use an array you must first define the array class. This is done with the
142help of the macros in this section. The class of array elements must be (at
143least) forward declared for WX\_DEFINE\_ARRAY, WX\_DEFINE\_SORTED\_ARRAY and
144WX\_DECLARE\_OBJARRAY macros and must be fully declared before you use
145WX\_DEFINE\_OBJARRAY macro.
146
147\helpref{WX\_DEFINE\_ARRAY}{wxdefinearray}\\
fbd27854 148\helpref{WX\_DEFINE\_EXPORTED\_ARRAY}{wxdefinearray}\\
a9241e60 149\helpref{WX\_DEFINE\_USER\_EXPORTED\_ARRAY}{wxdefinearray}\\
247aba10 150\helpref{WX\_DEFINE\_SORTED\_ARRAY}{wxdefinesortedarray}\\
fbd27854 151\helpref{WX\_DEFINE\_SORTED\_EXPORTED\_ARRAY}{wxdefinesortedarray}\\
a9241e60 152\helpref{WX\_DEFINE\_SORTED\_USER\_EXPORTED\_ARRAY}{wxdefinesortedarray}\\
fbd27854 153\helpref{WX\_DECLARE\_EXPORTED\_OBJARRAY}{wxdeclareobjarray}\\
a9241e60
RL
154\helpref{WX\_DECLARE\_USER\_EXPORTED\_OBJARRAY}{wxdeclareobjarray}\\
155\helpref{WX\_DEFINE\_OBJARRAY}{wxdefineobjarray}\\
156\helpref{WX\_DEFINE\_EXPORTED\_OBJARRAY}{wxdefineobjarray}\\
157\helpref{WX\_DEFINE\_USER\_EXPORTED\_OBJARRAY}{wxdefineobjarray}
247aba10 158
1cc603c1
VZ
159To slightly complicate the matters even further, the operator $->$ defined by
160default for the array iterators by these macros only makes sense if the array
161element type is not a pointer itself and, although it still works, this
162provokes warnings from some compilers and to avoid them you should use the
163{\tt \_PTR} versions of the macros above. For example, to define an array of
164pointers to {\tt double} you should use
165
166\begin{verbatim}
167WX_DEFINE_ARRAY_PTR(double *, MyArrayOfDoublePointers);
168\end{verbatim}
169
247aba10
VZ
170\membersection{Constructors and destructors}
171
172Array classes are 100\% C++ objects and as such they have the appropriate copy
173constructors and assignment operators. Copying wxArray just copies the elements
174but copying wxObjArray copies the arrays items. However, for memory-efficiency
175sake, neither of these classes has virtual destructor. It is not very important
176for wxArray which has trivial destructor anyhow, but it does mean that you
177should avoid deleting wxObjArray through a wxBaseArray pointer (as you would
178never use wxBaseArray anyhow it shouldn't be a problem) and that you should not
179derive your own classes from the array classes.
180
437c49b2
JS
181\helpref{wxArray default constructor}{wxarrayctordef}\\
182\helpref{wxArray copy constructors and assignment operators}{wxarrayctorcopy}\\
247aba10
VZ
183\helpref{\destruct{wxArray}}{wxarraydtor}
184
185\membersection{Memory management}\label{wxarraymemorymanagement}
186
187Automatic array memory management is quite trivial: the array starts by
188preallocating some minimal amount of memory (defined by
189WX\_ARRAY\_DEFAULT\_INITIAL\_SIZE) and when further new items exhaust already
190allocated memory it reallocates it adding 50\% of the currently allocated
191amount, but no more than some maximal number which is defined by
192ARRAY\_MAXSIZE\_INCREMENT constant. Of course, this may lead to some memory
193being wasted (ARRAY\_MAXSIZE\_INCREMENT in the worst case, i.e. 4Kb in the
437c49b2 194current implementation), so the \helpref{Shrink()}{wxarrayshrink} function is
2edb0bde 195provided to deallocate the extra memory. The \helpref{Alloc()}{wxarrayalloc}
247aba10
VZ
196function can also be quite useful if you know in advance how many items you are
197going to put in the array and will prevent the array code from reallocating the
198memory more times than needed.
199
200\helpref{Alloc}{wxarrayalloc}\\
201\helpref{Shrink}{wxarrayshrink}
202
203\membersection{Number of elements and simple item access}
204
205Functions in this section return the total number of array elements and allow to
206retrieve them - possibly using just the C array indexing $[]$ operator which
207does exactly the same as \helpref{Item()}{wxarrayitem} method.
208
209\helpref{Count}{wxarraycount}\\
210\helpref{GetCount}{wxarraygetcount}\\
211\helpref{IsEmpty}{wxarrayisempty}\\
212\helpref{Item}{wxarrayitem}\\
213\helpref{Last}{wxarraylast}
214
215\membersection{Adding items}
437c49b2 216
247aba10 217\helpref{Add}{wxarrayadd}\\
4f6aed9c 218\helpref{Insert}{wxarrayinsert}\\
2abb9d2f 219\helpref{SetCount}{wxarraysetcount}\\
4f6aed9c 220\helpref{WX\_APPEND\_ARRAY}{wxappendarray}
247aba10
VZ
221
222\membersection{Removing items}
437c49b2 223
247aba10
VZ
224\helpref{WX\_CLEAR\_ARRAY}{wxcleararray}\\
225\helpref{Empty}{wxarrayempty}\\
226\helpref{Clear}{wxarrayclear}\\
8a729bb8 227\helpref{RemoveAt}{wxarrayremoveat}\\
247aba10
VZ
228\helpref{Remove}{wxarrayremove}
229
230\membersection{Searching and sorting}
437c49b2 231
247aba10
VZ
232\helpref{Index}{wxarrayindex}\\
233\helpref{Sort}{wxarraysort}
234
235%%%%% MEMBERS HERE %%%%%
236\helponly{\insertatlevel{2}{
237
238\wxheading{Members}
239
240}}
241
242\membersection{WX\_DEFINE\_ARRAY}\label{wxdefinearray}
437c49b2 243
06ad8636 244\func{}{WX\_DEFINE\_ARRAY}{\param{}{T}, \param{}{name}}
247aba10 245
fbd27854
VS
246\func{}{WX\_DEFINE\_EXPORTED\_ARRAY}{\param{}{T}, \param{}{name}}
247
a9241e60
RL
248\func{}{WX\_DEFINE\_USER\_EXPORTED\_ARRAY}{\param{}{T}, \param{}{name}, \param{}{exportspec}}
249
247aba10 250This macro defines a new array class named {\it name} and containing the
a9241e60
RL
251elements of type {\it T}. The second form is used when compiling wxWindows as
252a DLL under Windows and array needs to be visible outside the DLL. The third is
253needed for exporting an array from a user DLL.
254
fbd27854 255Example:
437c49b2 256
247aba10
VZ
257\begin{verbatim}
258WX_DEFINE_ARRAY(int, wxArrayInt);
259
260class MyClass;
261WX_DEFINE_ARRAY(MyClass *, wxArrayOfMyClass);
262\end{verbatim}
263
264Note that wxWindows predefines the following standard array classes: wxArrayInt,
265wxArrayLong and wxArrayPtrVoid.
266
267\membersection{WX\_DEFINE\_SORTED\_ARRAY}\label{wxdefinesortedarray}
437c49b2
JS
268
269\func{}{WX\_DEFINE\_SORTED\_ARRAY}{\param{}{T}, \param{}{name}}
247aba10 270
fbd27854
VS
271\func{}{WX\_DEFINE\_SORTED\_EXPORTED\_ARRAY}{\param{}{T}, \param{}{name}}
272
a9241e60
RL
273\func{}{WX\_DEFINE\_SORTED\_USER\_EXPORTED\_ARRAY}{\param{}{T}, \param{}{name}}
274
247aba10 275This macro defines a new sorted array class named {\it name} and containing
a9241e60
RL
276the elements of type {\it T}. The second form is used when compiling wxWindows as
277a DLL under Windows and array needs to be visible outside the DLL. The third is
278needed for exporting an array from a user DLL.
fbd27854 279
fbd27854 280Example:
437c49b2 281
247aba10 282\begin{verbatim}
43c9c17d 283WX_DEFINE_SORTED_ARRAY(int, wxSortedArrayInt);
247aba10
VZ
284
285class MyClass;
286WX_DEFINE_SORTED_ARRAY(MyClass *, wxArrayOfMyClass);
287\end{verbatim}
288
f6bcfd97 289You will have to initialize the objects of this class by passing a comparison
247aba10 290function to the array object constructor like this:
fa482912 291
247aba10
VZ
292\begin{verbatim}
293int CompareInts(int n1, int n2)
294{
295 return n1 - n2;
296}
297
43c9c17d 298wxSortedArrayInt sorted(CompareInts);
247aba10
VZ
299
300int CompareMyClassObjects(MyClass *item1, MyClass *item2)
301{
302 // sort the items by their address...
303 return Stricmp(item1->GetAddress(), item2->GetAddress());
304}
305
306wxArrayOfMyClass another(CompareMyClassObjects);
307\end{verbatim}
308
309\membersection{WX\_DECLARE\_OBJARRAY}\label{wxdeclareobjarray}
437c49b2
JS
310
311\func{}{WX\_DECLARE\_OBJARRAY}{\param{}{T}, \param{}{name}}
247aba10 312
fbd27854
VS
313\func{}{WX\_DECLARE\_EXPORTED\_OBJARRAY}{\param{}{T}, \param{}{name}}
314
a9241e60
RL
315\func{}{WX\_DECLARE\_USER\_EXPORTED\_OBJARRAY}{\param{}{T}, \param{}{name}}
316
247aba10 317This macro declares a new object array class named {\it name} and containing
a9241e60
RL
318the elements of type {\it T}. The second form is used when compiling wxWindows as
319a DLL under Windows and array needs to be visible outside the DLL. The third is
320needed for exporting an array from a user DLL.
fbd27854
VS
321
322Example:
6be663cf 323
247aba10
VZ
324\begin{verbatim}
325class MyClass;
4756503a 326WX_DECLARE_OBJARRAY(MyClass, wxArrayOfMyClass); // note: not "MyClass *"!
247aba10 327\end{verbatim}
6be663cf 328
247aba10
VZ
329You must use \helpref{WX\_DEFINE\_OBJARRAY()}{wxdefineobjarray} macro to define
330the array class - otherwise you would get link errors.
331
332\membersection{WX\_DEFINE\_OBJARRAY}\label{wxdefineobjarray}
437c49b2
JS
333
334\func{}{WX\_DEFINE\_OBJARRAY}{\param{}{name}}
247aba10 335
a9241e60
RL
336\func{}{WX\_DEFINE\_EXPORTED\_OBJARRAY}{\param{}{name}}
337
338\func{}{WX\_DEFINE\_USER\_EXPORTED\_OBJARRAY}{\param{}{name}}
339
247aba10
VZ
340This macro defines the methods of the array class {\it name} not defined by the
341\helpref{WX\_DECLARE\_OBJARRAY()}{wxdeclareobjarray} macro. You must include the
342file <wx/arrimpl.cpp> before using this macro and you must have the full
343declaration of the class of array elements in scope! If you forget to do the
344first, the error will be caught by the compiler, but, unfortunately, many
345compilers will not give any warnings if you forget to do the second - but the
346objects of the class will not be copied correctly and their real destructor will
a9241e60
RL
347not be called. The latter two forms are merely aliases of the first to satisfy
348some people's sense of symmetry when using the exported declarations.
247aba10
VZ
349
350Example of usage:
437c49b2 351
247aba10
VZ
352\begin{verbatim}
353// first declare the class!
354class MyClass
355{
356public:
357 MyClass(const MyClass&);
358
359 ...
360
361 virtual ~MyClass();
362};
363
364#include <wx/arrimpl.cpp>
365WX_DEFINE_OBJARRAY(wxArrayOfMyClass);
366\end{verbatim}
367
4f6aed9c
VZ
368\membersection{WX\_APPEND\_ARRAY}\label{wxappendarray}
369
370\func{void}{WX\_APPEND\_ARRAY}{\param{wxArray\& }{array}, \param{wxArray\& }{other}}
371
372This macro may be used to append all elements of the {\it other} array to the
373{\it array}. The two arrays must be of the same type.
374
247aba10 375\membersection{WX\_CLEAR\_ARRAY}\label{wxcleararray}
437c49b2 376
e2a6f233 377\func{void}{WX\_CLEAR\_ARRAY}{\param{wxArray\& }{array}}
247aba10
VZ
378
379This macro may be used to delete all elements of the array before emptying it.
380It can not be used with wxObjArrays - but they will delete their elements anyhow
381when you call Empty().
382
6be663cf 383\membersection{Default constructors}\label{wxarrayctordef}
437c49b2 384
e2a6f233 385\func{}{wxArray}{\void}
437c49b2 386
e2a6f233 387\func{}{wxObjArray}{\void}
247aba10
VZ
388
389Default constructor initializes an empty array object.
390
391\func{}{wxSortedArray}{\param{int (*)(T first, T second)}{compareFunction}}
392
393There is no default constructor for wxSortedArray classes - you must initialize it
f6bcfd97 394with a function to use for item comparison. It is a function which is passed
247aba10
VZ
395two arguments of type {\it T} where {\it T} is the array element type and which
396should return a negative, zero or positive value according to whether the first
397element passed to it is less than, equal to or greater than the second one.
398
6be663cf 399\membersection{wxArray copy constructor and assignment operator}\label{wxarrayctorcopy}
437c49b2 400
247aba10 401\func{}{wxArray}{\param{const wxArray\& }{array}}
437c49b2 402
247aba10 403\func{}{wxSortedArray}{\param{const wxSortedArray\& }{array}}
437c49b2 404
247aba10
VZ
405\func{}{wxObjArray}{\param{const wxObjArray\& }{array}}
406
06ad8636 407\func{wxArray\&}{operator$=$}{\param{const wxArray\& }{array}}
437c49b2 408
06ad8636 409\func{wxSortedArray\&}{operator$=$}{\param{const wxSortedArray\& }{array}}
437c49b2 410
06ad8636 411\func{wxObjArray\&}{operator$=$}{\param{const wxObjArray\& }{array}}
247aba10
VZ
412
413The copy constructors and assignment operators perform a shallow array copy
414(i.e. they don't copy the objects pointed to even if the source array contains
415the items of pointer type) for wxArray and wxSortedArray and a deep copy (i.e.
416the array element are copied too) for wxObjArray.
417
418\membersection{wxArray::\destruct{wxArray}}\label{wxarraydtor}
437c49b2 419
06ad8636 420\func{}{\destruct{wxArray}}{\void}
437c49b2 421
06ad8636 422\func{}{\destruct{wxSortedArray}}{\void}
437c49b2 423
06ad8636 424\func{}{\destruct{wxObjArray}}{\void}
247aba10
VZ
425
426The wxObjArray destructor deletes all the items owned by the array. This is not
427done by wxArray and wxSortedArray versions - you may use
428\helpref{WX\_CLEAR\_ARRAY}{wxcleararray} macro for this.
429
430\membersection{wxArray::Add}\label{wxarrayadd}
437c49b2 431
2863d6b0 432\func{void}{Add}{\param{T }{item}, \param{size\_t}{ copies = $1$}}
437c49b2 433
e2a6f233 434\func{void}{Add}{\param{T *}{item}}
437c49b2 435
2863d6b0 436\func{void}{Add}{\param{T \&}{item}, \param{size\_t}{ copies = $1$}}
247aba10 437
2863d6b0
VZ
438Appends the given number of {\it copies} of the {\it item} to the array
439consisting of the elements of type {\it T}.
247aba10
VZ
440
441The first version is used with wxArray and wxSortedArray. The second and the
e2a6f233 442third are used with wxObjArray. There is an important difference between
247aba10
VZ
443them: if you give a pointer to the array, it will take ownership of it, i.e.
444will delete it when the item is deleted from the array. If you give a reference
445to the array, however, the array will make a copy of the item and will not take
446ownership of the original item. Once again, it only makes sense for wxObjArrays
2863d6b0
VZ
447because the other array types never take ownership of their elements. Also note
448that you cannot append more than one pointer as reusing it would lead to
449deleting it twice (or more) and hence to a crash.
247aba10 450
4f6aed9c 451You may also use \helpref{WX\_APPEND\_ARRAY}{wxappendarray} macro to append all
2863d6b0
VZ
452elements of one array to another one but it is more efficient to use
453{\it copies} parameter and modify the elements in place later if you plan to
454append a lot of items.
4f6aed9c 455
247aba10 456\membersection{wxArray::Alloc}\label{wxarrayalloc}
437c49b2 457
e2a6f233 458\func{void}{Alloc}{\param{size\_t }{count}}
247aba10
VZ
459
460Preallocates memory for a given number of array elements. It is worth calling
461when the number of items which are going to be added to the array is known in
462advance because it will save unneeded memory reallocation. If the array already
463has enough memory for the given number of items, nothing happens.
464
465\membersection{wxArray::Clear}\label{wxarrayclear}
437c49b2 466
e2a6f233 467\func{void}{Clear}{\void}
247aba10
VZ
468
469This function does the same as \helpref{Empty()}{wxarrayempty} and additionally
470frees the memory allocated to the array.
471
472\membersection{wxArray::Count}\label{wxarraycount}
437c49b2 473
247aba10
VZ
474\constfunc{size\_t}{Count}{\void}
475
476Same as \helpref{GetCount()}{wxarraygetcount}. This function is deprecated -
477it exists only for compatibility.
478
479\membersection{wxObjArray::Detach}\label{wxobjarraydetach}
437c49b2 480
247aba10
VZ
481\func{T *}{Detach}{\param{size\_t }{index}}
482
483Removes the element from the array, but, unlike,
484\helpref{Remove()}{wxarrayremove} doesn't delete it. The function returns the
485pointer to the removed element.
486
487\membersection{wxArray::Empty}\label{wxarrayempty}
437c49b2 488
e2a6f233 489\func{void}{Empty}{\void}
247aba10
VZ
490
491Empties the array. For wxObjArray classes, this destroys all of the array
492elements. For wxArray and wxSortedArray this does nothing except marking the
e2a6f233 493array of being empty - this function does not free the allocated memory, use
247aba10
VZ
494\helpref{Clear()}{wxarrayclear} for this.
495
496\membersection{wxArray::GetCount}\label{wxarraygetcount}
437c49b2 497
247aba10
VZ
498\constfunc{size\_t}{GetCount}{\void}
499
500Return the number of items in the array.
501
502\membersection{wxArray::Index}\label{wxarrayindex}
437c49b2 503
cc81d32f 504\func{int}{Index}{\param{T\& }{item}, \param{bool }{searchFromEnd = false}}
437c49b2 505
247aba10
VZ
506\func{int}{Index}{\param{T\& }{item}}
507
508The first version of the function is for wxArray and wxObjArray, the second is
509for wxSortedArray only.
510
511Searches the element in the array, starting from either beginning or the end
512depending on the value of {\it searchFromEnd} parameter. wxNOT\_FOUND is
513returned if the element is not found, otherwise the index of the element is
514returned.
515
516Linear search is used for the wxArray and wxObjArray classes but binary search
517in the sorted array is used for wxSortedArray (this is why searchFromEnd
518parameter doesn't make sense for it).
519
2cd31b57
VZ
520{\bf NB:} even for wxObjArray classes, the operator==() of the elements in the
521array is {\bf not} used by this function. It searches exactly the given
522element in the array and so will only succeed if this element had been
523previously added to the array, but fail even if another, identical, element is
524in the array.
525
247aba10 526\membersection{wxArray::Insert}\label{wxarrayinsert}
437c49b2 527
2863d6b0 528\func{void}{Insert}{\param{T }{item}, \param{size\_t }{n}, \param{size\_t }{copies = $1$}}
437c49b2 529
e2a6f233 530\func{void}{Insert}{\param{T *}{item}, \param{size\_t }{n}}
437c49b2 531
2863d6b0 532\func{void}{Insert}{\param{T \&}{item}, \param{size\_t }{n}, \param{size\_t }{copies = $1$}}
247aba10 533
2863d6b0
VZ
534Insert the given number of {\it copies} of the {\it item} into the array before
535the existing item {\it n} - thus, {\it Insert(something, 0u)} will insert an
536item in such way that it will become the first array element.
247aba10
VZ
537
538Please see \helpref{Add()}{wxarrayadd} for explanation of the differences
539between the overloaded versions of this function.
540
541\membersection{wxArray::IsEmpty}\label{wxarrayisempty}
437c49b2 542
e2a6f233 543\constfunc{bool}{IsEmpty}{\void}
247aba10 544
cc81d32f 545Returns true if the array is empty, false otherwise.
247aba10
VZ
546
547\membersection{wxArray::Item}\label{wxarrayitem}
437c49b2 548
247aba10
VZ
549\constfunc{T\&}{Item}{\param{size\_t }{index}}
550
551Returns the item at the given position in the array. If {\it index} is out of
552bounds, an assert failure is raised in the debug builds but nothing special is
553done in the release build.
554
555The returned value is of type "reference to the array element type" for all of
556the array classes.
557
558\membersection{wxArray::Last}\label{wxarraylast}
437c49b2 559
247aba10
VZ
560\constfunc{T\&}{Last}{\void}
561
562Returns the last element in the array, i.e. is the same as Item(GetCount() - 1).
563An assert failure is raised in the debug mode if the array is empty.
564
565The returned value is of type "reference to the array element type" for all of
566the array classes.
567
568\membersection{wxArray::Remove}\label{wxarrayremove}
437c49b2 569
247aba10
VZ
570\func{\void}{Remove}{\param{T }{item}}
571
f6bcfd97 572Removes an element from the array by value: the first item of the
8a729bb8
VZ
573array equal to {\it item} is removed, an assert failure will result from an
574attempt to remove an item which doesn't exist in the array.
575
576When an element is removed from wxObjArray it is deleted by the array - use
247aba10
VZ
577\helpref{Detach()}{wxobjarraydetach} if you don't want this to happen. On the
578other hand, when an object is removed from a wxArray nothing happens - you
f6bcfd97 579should delete it manually if required:
437c49b2 580
247aba10
VZ
581\begin{verbatim}
582T *item = array[n];
583delete item;
584array.Remove(n)
585\end{verbatim}
586
587See also \helpref{WX\_CLEAR\_ARRAY}{wxcleararray} macro which deletes all
588elements of a wxArray (supposed to contain pointers).
589
8a729bb8
VZ
590\membersection{wxArray::RemoveAt}\label{wxarrayremoveat}
591
d1f1e77a 592\func{\void}{RemoveAt}{\param{size\_t }{index}, \param{size\_t }{count = $1$}}
8a729bb8 593
2863d6b0
VZ
594Removes {\it count} elements starting at {\it index} from the array. When an
595element is removed from wxObjArray it is deleted by the array - use
596\helpref{Detach()}{wxobjarraydetach} if you don't want this to happen. On
597the other hand, when an object is removed from a wxArray nothing happens -
598you should delete it manually if required:
8a729bb8
VZ
599
600\begin{verbatim}
601T *item = array[n];
602delete item;
603array.RemoveAt(n)
604\end{verbatim}
605
606See also \helpref{WX\_CLEAR\_ARRAY}{wxcleararray} macro which deletes all
607elements of a wxArray (supposed to contain pointers).
608
2abb9d2f
VZ
609\membersection{wxArray::SetCount}\label{wxarraysetcount}
610
611\func{void}{SetCount}{\param{size\_t }{count}, \param{T }{defval = T($0$)}}
612
613This function ensures that the number of array elements is at least
614{\it count}. If the array has already {\it count} or mroe items, nothing is
615done. Otherwise, {\tt count - GetCount()} elements are added and initialized to
616the value {\it defval}.
617
618\wxheading{See also}
619
620\helpref{GetCount}{wxarraygetcount}
621
247aba10 622\membersection{wxArray::Shrink}\label{wxarrayshrink}
437c49b2 623
e2a6f233 624\func{void}{Shrink}{\void}
247aba10
VZ
625
626Frees all memory unused by the array. If the program knows that no new items
627will be added to the array it may call Shrink() to reduce its memory usage.
628However, if a new item is added to the array, some extra memory will be
629allocated again.
630
631\membersection{wxArray::Sort}\label{wxarraysort}
437c49b2 632
e2a6f233 633\func{void}{Sort}{\param{CMPFUNC<T> }{compareFunction}}
247aba10
VZ
634
635The notation CMPFUNC<T> should be read as if we had the following declaration:
437c49b2 636
247aba10
VZ
637\begin{verbatim}
638template int CMPFUNC(T *first, T *second);
639\end{verbatim}
437c49b2 640
e2a6f233 641where {\it T} is the type of the array elements. I.e. it is a function returning
247aba10
VZ
642{\it int} which is passed two arguments of type {\it T *}.
643
644Sorts the array using the specified compare function: this function should
645return a negative, zero or positive value according to whether the first element
646passed to it is less than, equal to or greater than the second one.
647
648wxSortedArray doesn't have this function because it is always sorted.
437c49b2 649