]>
Commit | Line | Data |
---|---|---|
1 | \section{\class{wxArrayString}}\label{wxarraystring} | |
2 | ||
3 | wxArrayString is an efficient container for storing | |
4 | \helpref{wxString}{wxstring} objects. It has the same features as all | |
5 | \helpref{wxArray}{wxarray} classes, i.e. it dynamically expands when new items | |
6 | are added to it (so it is as easy to use as a linked list), but the access | |
7 | time to the elements is constant, instead of being linear in number of | |
8 | elements as in the case of linked lists. It is also very size efficient and | |
9 | doesn't take more space than a C array {\it wxString[]} type (wxArrayString | |
10 | uses its knowledge of internals of wxString class to achieve this). | |
11 | ||
12 | This class is used in the same way as other dynamic \helpref{arrays}{wxarray}, | |
13 | except that no {\it WX\_DEFINE\_ARRAY} declaration is needed for it. When a | |
14 | string is added or inserted in the array, a copy of the string is created, so | |
15 | the original string may be safely deleted (e.g. if it was a {\it char *} | |
16 | pointer the memory it was using can be freed immediately after this). In | |
17 | general, there is no need to worry about string memory deallocation when using | |
18 | this class - it will always free the memory it uses itself. | |
19 | ||
20 | The references returned by \helpref{Item}{wxarraystringitem}, | |
21 | \helpref{Last}{wxarraystringlast} or | |
22 | \helpref{operator[]}{wxarraystringoperatorindex} are not constant, so the | |
23 | array elements may be modified in place like this | |
24 | ||
25 | \begin{verbatim} | |
26 | array.Last().MakeUpper(); | |
27 | \end{verbatim} | |
28 | ||
29 | There is also a variant of wxArrayString called wxSortedArrayString which has | |
30 | exactly the same methods as wxArrayString, but which always keeps the string | |
31 | in it in (alphabetical) order. wxSortedArrayString uses binary search in its | |
32 | \helpref{Index}{wxarraystringindex} function (instead of linear search for | |
33 | wxArrayString::Index) which makes it much more efficient if you add strings to | |
34 | the array rarely (because, of course, you have to pay for Index() efficiency | |
35 | by having Add() be slower) but search for them often. Several methods should | |
36 | not be used with sorted array (basically, all which break the order of items) | |
37 | which is mentioned in their description. | |
38 | ||
39 | Final word: none of the methods of wxArrayString is virtual including its | |
40 | destructor, so this class should not be used as a base class. | |
41 | ||
42 | \wxheading{Derived from} | |
43 | ||
44 | Although this is not true strictly speaking, this class may be considered as a | |
45 | specialization of \helpref{wxArray}{wxarray} class for the wxString member | |
46 | data: it is not implemented like this, but it does have all of the wxArray | |
47 | functions. | |
48 | ||
49 | \wxheading{Include files} | |
50 | ||
51 | <wx/string.h> | |
52 | ||
53 | \wxheading{See also} | |
54 | ||
55 | \helpref{wxArray}{wxarray}, \helpref{wxString}{wxstring}, \helpref{wxString overview}{wxstringoverview} | |
56 | ||
57 | \latexignore{\rtfignore{\wxheading{Members}}} | |
58 | ||
59 | \membersection{wxArrayString::wxArrayString}\label{wxarraystringctor} | |
60 | ||
61 | \func{}{wxArrayString}{\void} | |
62 | ||
63 | \func{}{wxArrayString}{\param{const wxArrayString\&}{ array}} | |
64 | ||
65 | Default and copy constructors. | |
66 | ||
67 | Note that when an array is assigned to a sorted array, its contents is | |
68 | automatically sorted during construction. | |
69 | ||
70 | \membersection{wxArrayString::\destruct{wxArrayString}}\label{wxarraystringdtor} | |
71 | ||
72 | \func{}{\destruct{wxArrayString}}{} | |
73 | ||
74 | Destructor frees memory occupied by the array strings. For the performance | |
75 | reasons it is not virtual, so this class should not be derived from. | |
76 | ||
77 | \membersection{wxArrayString::operator=}\label{wxarraystringoperatorassign} | |
78 | ||
79 | \func{wxArrayString \&}{operator $=$}{\param{const wxArrayString\&}{ array}} | |
80 | ||
81 | Assignment operator. | |
82 | ||
83 | \membersection{wxArrayString::operator==}\label{wxarraystringoperatorequal} | |
84 | ||
85 | \constfunc{bool}{operator $==$}{\param{const wxArrayString\&}{ array}} | |
86 | ||
87 | Compares 2 arrays respecting the case. Returns true only if the arrays have | |
88 | the same number of elements and the same strings in the same order. | |
89 | ||
90 | \membersection{wxArrayString::operator!=}\label{wxarraystringoperatornotequal} | |
91 | ||
92 | \constfunc{bool}{operator $!=$}{\param{const wxArrayString\&}{ array}} | |
93 | ||
94 | Compares 2 arrays respecting the case. Returns true if the arrays have | |
95 | different number of elements or if the elements don't match pairwise. | |
96 | ||
97 | \membersection{wxArrayString::operator[]}\label{wxarraystringoperatorindex} | |
98 | ||
99 | \func{wxString\&}{operator[]}{\param{size\_t }{nIndex}} | |
100 | ||
101 | Return the array element at position {\it nIndex}. An assert failure will | |
102 | result from an attempt to access an element beyond the end of array in debug | |
103 | mode, but no check is done in release mode. | |
104 | ||
105 | This is the operator version of \helpref{Item}{wxarraystringitem} method. | |
106 | ||
107 | \membersection{wxArrayString::Add}\label{wxarraystringadd} | |
108 | ||
109 | \func{size\_t}{Add}{\param{const wxString\& }{str}, \param{size\_t}{ copies = $1$}} | |
110 | ||
111 | Appends the given number of {\it copies} of the new item {\it str} to the | |
112 | array and returns the index of the first new item in the array. | |
113 | ||
114 | {\bf Warning:} For sorted arrays, the index of the inserted item will not be, | |
115 | in general, equal to \helpref{GetCount()}{wxarraystringgetcount} - 1 because | |
116 | the item is inserted at the correct position to keep the array sorted and not | |
117 | appended. | |
118 | ||
119 | See also: \helpref{Insert}{wxarraystringinsert} | |
120 | ||
121 | \membersection{wxArrayString::Alloc}\label{wxarraystringalloc} | |
122 | ||
123 | \func{void}{Alloc}{\param{size\_t }{nCount}} | |
124 | ||
125 | Preallocates enough memory to store {\it nCount} items. This function may be | |
126 | used to improve array class performance before adding a known number of items | |
127 | consecutively. | |
128 | ||
129 | See also: \helpref{Dynamic array memory management}{wxarraymemorymanagement} | |
130 | ||
131 | \membersection{wxArrayString::Clear}\label{wxarraystringclear} | |
132 | ||
133 | \func{void}{Clear}{\void} | |
134 | ||
135 | Clears the array contents and frees memory. | |
136 | ||
137 | See also: \helpref{Empty}{wxarraystringempty} | |
138 | ||
139 | \membersection{wxArrayString::Count}\label{wxarraystringcount} | |
140 | ||
141 | \constfunc{size\_t}{Count}{\void} | |
142 | ||
143 | Returns the number of items in the array. This function is deprecated and is | |
144 | for backwards compatibility only, please use | |
145 | \helpref{GetCount}{wxarraystringgetcount} instead. | |
146 | ||
147 | \membersection{wxArrayString::Empty}\label{wxarraystringempty} | |
148 | ||
149 | \func{void}{Empty}{\void} | |
150 | ||
151 | Empties the array: after a call to this function | |
152 | \helpref{GetCount}{wxarraystringgetcount} will return $0$. However, this | |
153 | function does not free the memory used by the array and so should be used when | |
154 | the array is going to be reused for storing other strings. Otherwise, you | |
155 | should use \helpref{Clear}{wxarraystringclear} to empty the array and free | |
156 | memory. | |
157 | ||
158 | \membersection{wxArrayString::GetCount}\label{wxarraystringgetcount} | |
159 | ||
160 | \constfunc{size\_t}{GetCount}{\void} | |
161 | ||
162 | Returns the number of items in the array. | |
163 | ||
164 | \membersection{wxArrayString::Index}\label{wxarraystringindex} | |
165 | ||
166 | \func{int}{Index}{\param{const char *}{ sz}, \param{bool}{ bCase = true}, \param{bool}{ bFromEnd = false}} | |
167 | ||
168 | Search the element in the array, starting from the beginning if | |
169 | {\it bFromEnd} is false or from end otherwise. If {\it bCase}, comparison is | |
170 | case sensitive (default), otherwise the case is ignored. | |
171 | ||
172 | This function uses linear search for wxArrayString and binary search for | |
173 | wxSortedArrayString, but it ignores the {\it bCase} and {\it bFromEnd} | |
174 | parameters in the latter case. | |
175 | ||
176 | Returns index of the first item matched or wxNOT\_FOUND if there is no match. | |
177 | ||
178 | \membersection{wxArrayString::Insert}\label{wxarraystringinsert} | |
179 | ||
180 | \func{void}{Insert}{\param{const wxString\& }{str}, \param{size\_t}{ nIndex}, \param{size\_t }{copies = $1$}} | |
181 | ||
182 | Insert the given number of {\it copies} of the new element in the array before the position {\it nIndex}. Thus, for | |
183 | example, to insert the string in the beginning of the array you would write | |
184 | ||
185 | \begin{verbatim} | |
186 | Insert("foo", 0); | |
187 | \end{verbatim} | |
188 | ||
189 | If {\it nIndex} is equal to {\it GetCount()} this function behaves as | |
190 | \helpref{Add}{wxarraystringadd}. | |
191 | ||
192 | {\bf Warning:} this function should not be used with sorted arrays because it | |
193 | could break the order of items and, for example, subsequent calls to | |
194 | \helpref{Index()}{wxarraystringindex} would then not work! | |
195 | ||
196 | \membersection{wxArrayString::IsEmpty}\label{wxarraystringisempty} | |
197 | ||
198 | \func{}{IsEmpty}{} | |
199 | ||
200 | Returns true if the array is empty, false otherwise. This function returns the | |
201 | same result as {\it GetCount() == 0} but is probably easier to read. | |
202 | ||
203 | \membersection{wxArrayString::Item}\label{wxarraystringitem} | |
204 | ||
205 | \constfunc{wxString\&}{Item}{\param{size\_t }{nIndex}} | |
206 | ||
207 | Return the array element at position {\it nIndex}. An assert failure will | |
208 | result from an attempt to access an element beyond the end of array in debug | |
209 | mode, but no check is done in release mode. | |
210 | ||
211 | See also \helpref{operator[]}{wxarraystringoperatorindex} for the operator | |
212 | version. | |
213 | ||
214 | \membersection{wxArrayString::Last}\label{wxarraystringlast} | |
215 | ||
216 | \func{}{Last}{} | |
217 | ||
218 | Returns the last element of the array. Attempt to access the last element of | |
219 | an empty array will result in assert failure in debug build, however no checks | |
220 | are done in release mode. | |
221 | ||
222 | \membersection{wxArrayString::Remove}\label{wxarraystringremove} | |
223 | ||
224 | \func{void}{Remove}{\param{const char *}{ sz}} | |
225 | ||
226 | Removes the first item matching this value. An assert failure is provoked by | |
227 | an attempt to remove an element which does not exist in debug build. | |
228 | ||
229 | See also: \helpref{Index}{wxarraystringindex} | |
230 | ||
231 | \func{void}{Remove}{\param{size\_t }{nIndex}, \param{size\_t }{count = $1$}} | |
232 | ||
233 | Removes {\it count} items starting at position {\it nIndex} from the array. | |
234 | ||
235 | \membersection{wxArrayString::Shrink}\label{wxarraystringshrink} | |
236 | ||
237 | \func{void}{Shrink}{\void} | |
238 | ||
239 | Releases the extra memory allocated by the array. This function is useful to | |
240 | minimize the array memory consumption. | |
241 | ||
242 | See also: \helpref{Alloc}{wxarraystringalloc}, \helpref{Dynamic array memory management}{wxarraymemorymanagement} | |
243 | ||
244 | \membersection{wxArrayString::Sort}\label{wxarraystringsort} | |
245 | ||
246 | \func{void}{Sort}{\param{bool}{ reverseOrder = false}} | |
247 | ||
248 | Sorts the array in alphabetical order or in reverse alphabetical order if | |
249 | {\it reverseOrder} is true. | |
250 | ||
251 | {\bf Warning:} this function should not be used with sorted array because it | |
252 | could break the order of items and, for example, subsequent calls to | |
253 | \helpref{Index()}{wxarraystringindex} would then not work! | |
254 | ||
255 | \func{void}{Sort}{\param{CompareFunction }{compareFunction}} | |
256 | ||
257 | Sorts the array using the specified {\it compareFunction} for item comparison. | |
258 | {\it CompareFunction} is defined as a function taking two {\it const | |
259 | wxString\&} parameters and returning an {\it int} value less than, equal to or | |
260 | greater than 0 if the first string is less than, equal to or greater than the | |
261 | second one. | |
262 | ||
263 | \wxheading{Example} | |
264 | ||
265 | The following example sorts strings by their length. | |
266 | ||
267 | \begin{verbatim} | |
268 | static int CompareStringLen(const wxString& first, const wxString& second) | |
269 | { | |
270 | return first.length() - second.length(); | |
271 | } | |
272 | ||
273 | ... | |
274 | ||
275 | wxArrayString array; | |
276 | ||
277 | array.Add("one"); | |
278 | array.Add("two"); | |
279 | array.Add("three"); | |
280 | array.Add("four"); | |
281 | ||
282 | array.Sort(CompareStringLen); | |
283 | \end{verbatim} | |
284 | ||
285 | {\bf Warning:} this function should not be used with sorted array because it | |
286 | could break the order of items and, for example, subsequent calls to | |
287 | \helpref{Index()}{wxarraystringindex} would then not work! | |
288 |