]> git.saurik.com Git - wxWidgets.git/blame - interface/wx/arrstr.h
Applied minor documentation corrections to wxRegKey from charles (fixes #10407).
[wxWidgets.git] / interface / wx / arrstr.h
CommitLineData
23324ae1
FM
1/////////////////////////////////////////////////////////////////////////////
2// Name: arrstr.h
e54c96f1 3// Purpose: interface of wxArrayString
23324ae1
FM
4// Author: wxWidgets team
5// RCS-ID: $Id$
6// Licence: wxWindows license
7/////////////////////////////////////////////////////////////////////////////
8
9/**
10 @class wxArrayString
7c913512 11
39fb8056
FM
12 wxArrayString is an efficient container for storing wxString objects.
13
14 It has the same features as all wxArray classes, i.e. it dynamically expands
15 when new items are added to it (so it is as easy to use as a linked list),
16 but the access time to the elements is constant, instead of being linear in
17 number of elements as in the case of linked lists. It is also very size
18 efficient and doesn't take more space than a C array @e wxString[] type
19 (wxArrayString uses its knowledge of internals of wxString class to achieve this).
20
21 This class is used in the same way as other dynamic arrays(), except that no
71f8a117 22 ::WX_DEFINE_ARRAY declaration is needed for it.
39fb8056
FM
23 When a string is added or inserted in the array, a copy of the string is created,
24 so the original string may be safely deleted (e.g. if it was a @e wxChar *
25 pointer the memory it was using can be freed immediately after this).
26 In general, there is no need to worry about string memory deallocation when using
23324ae1 27 this class - it will always free the memory it uses itself.
7c913512 28
39fb8056
FM
29 The references returned by wxArrayString::Item, wxArrayString::Last or
30 wxArrayString::operator[] are not constant, so the array elements may
31 be modified in place like this:
7c913512 32
23324ae1
FM
33 @code
34 array.Last().MakeUpper();
35 @endcode
7c913512 36
39fb8056
FM
37 @note none of the methods of wxArrayString is virtual including its
38 destructor, so this class should not be used as a base class.
39
40 Although this is not true strictly speaking, this class may be considered as
41 a specialization of wxArray class for the wxString member data: it is not
42 implemented like this, but it does have all of the wxArray functions.
7c913512 43
b7c50e37
FM
44 @todo what about stl? how does it integrate?
45
23324ae1
FM
46 @library{wxbase}
47 @category{containers}
7c913512 48
f045c7f5 49 @see wxArray<T>, wxString, @ref overview_string
23324ae1
FM
50*/
51class wxArrayString : public wxArray
52{
53public:
f045c7f5
FM
54 /**
55 The function type used with wxArrayString::Sort function.
56 */
57 typedef int (*CompareFunction)(const wxString& first, const wxString& second);
58
23324ae1 59 /**
39fb8056 60 Default constructor.
23324ae1
FM
61 */
62 wxArrayString();
39fb8056
FM
63
64 /**
b7c50e37 65 Copy constructor.
39fb8056 66 */
7c913512 67 wxArrayString(const wxArrayString& array);
39fb8056
FM
68
69 //@{
70 /**
71f8a117 71 Constructor from a C string array. Pass a size @a sz and an array @a arr.
39fb8056 72 **/
7c913512
FM
73 wxArrayString(size_t sz, const char** arr);
74 wxArrayString(size_t sz, const wchar_t** arr);
23324ae1
FM
75 //@}
76
77 /**
71f8a117 78 Constructor from a wxString array. Pass a size @a sz and array @a arr.
39fb8056
FM
79 */
80 wxArrayString(size_t sz, const wxString* arr);
81
82 /**
83 Destructor frees memory occupied by the array strings. For performance
23324ae1
FM
84 reasons it is not virtual, so this class should not be derived from.
85 */
86 ~wxArrayString();
87
88 /**
4cc4bfaf 89 Appends the given number of @a copies of the new item @a str to the
23324ae1 90 array and returns the index of the first new item in the array.
39fb8056 91
39fb8056 92 @see Insert()
23324ae1 93 */
4cc4bfaf 94 size_t Add(const wxString& str, size_t copies = 1);
23324ae1
FM
95
96 /**
76e9224e 97 Preallocates enough memory to store @a nCount items.
39fb8056 98
76e9224e
FM
99 This function may be used to improve array class performance before
100 adding a known number of items consecutively.
23324ae1
FM
101 */
102 void Alloc(size_t nCount);
103
104 /**
105 Clears the array contents and frees memory.
39fb8056
FM
106
107 @see Empty()
23324ae1
FM
108 */
109 void Clear();
110
111 /**
39fb8056 112 Empties the array: after a call to this function GetCount() will return 0.
3c4f71cc 113 However, this function does not free the memory used by the array and so
39fb8056
FM
114 should be used when the array is going to be reused for storing other strings.
115 Otherwise, you should use Clear() to empty the array and free memory.
23324ae1
FM
116 */
117 void Empty();
118
119 /**
120 Returns the number of items in the array.
121 */
328f5751 122 size_t GetCount() const;
23324ae1
FM
123
124 /**
39fb8056 125 Search the element in the array, starting from the beginning if @a bFromEnd
71f8a117 126 is @false or from end otherwise. If @a bCase, comparison is case sensitive
39fb8056
FM
127 (default), otherwise the case is ignored.
128
b7c50e37 129 This function uses linear search for wxArrayString.
23324ae1
FM
130 Returns index of the first item matched or @c wxNOT_FOUND if there is no match.
131 */
8d483c9b 132 int Index(const wxString& sz, bool bCase = true, bool bFromEnd = false) const;
23324ae1
FM
133
134 /**
4cc4bfaf 135 Insert the given number of @a copies of the new element in the array before the
71f8a117 136 position @a nIndex. Thus, for example, to insert the string in the beginning of
39fb8056
FM
137 the array you would write:
138
139 @code
140 Insert("foo", 0);
141 @endcode
3c4f71cc 142
71f8a117 143 If @a nIndex is equal to GetCount() this function behaves as Add().
23324ae1 144 */
382f12e4 145 void Insert(wxString lItem, size_t nIndex, size_t copies = 1);
23324ae1
FM
146
147 /**
148 Returns @true if the array is empty, @false otherwise. This function returns the
71f8a117 149 same result as GetCount() == 0 but is probably easier to read.
23324ae1 150 */
8d483c9b 151 bool IsEmpty() const;
23324ae1
FM
152
153 /**
8d483c9b 154 Return the array element at position @a nIndex. An assert failure will
23324ae1
FM
155 result from an attempt to access an element beyond the end of array in debug
156 mode, but no check is done in release mode.
39fb8056
FM
157
158 @see operator[] for the operator version.
23324ae1 159 */
8d483c9b 160 wxString& Item(size_t nIndex) const;
23324ae1
FM
161
162 /**
163 Returns the last element of the array. Attempt to access the last element of
164 an empty array will result in assert failure in debug build, however no checks
165 are done in release mode.
166 */
8d483c9b 167 wxString& Last() const;
23324ae1
FM
168
169 /**
170 Removes the first item matching this value. An assert failure is provoked by
171 an attempt to remove an element which does not exist in debug build.
39fb8056
FM
172
173 @see Index()
23324ae1
FM
174 */
175 void Remove(const wxString& sz);
176
177 /**
4cc4bfaf 178 Removes @a count items starting at position @a nIndex from the array.
23324ae1
FM
179 */
180 void RemoveAt(size_t nIndex, size_t count = 1);
181
182 /**
76e9224e
FM
183 Releases the extra memory allocated by the array.
184 This function is useful to minimize the array memory consumption.
39fb8056 185
76e9224e 186 @see Alloc()
23324ae1
FM
187 */
188 void Shrink();
189
39fb8056
FM
190 /**
191 Sorts the array in alphabetical order or in reverse alphabetical order if
192 @a reverseOrder is @true. The sort is case-sensitive.
39fb8056 193 */
39fb8056
FM
194 void Sort(bool reverseOrder = false);
195
23324ae1 196 /**
4cc4bfaf 197 Sorts the array using the specified @a compareFunction for item comparison.
f045c7f5 198 @a CompareFunction is defined as a function taking two <em>const wxString&</em>
3c4f71cc 199 parameters and returning an @e int value less than, equal to or greater
39fb8056 200 than 0 if the first string is less than, equal to or greater than the
23324ae1 201 second one.
39fb8056
FM
202
203 Example:
204 The following example sorts strings by their length.
205
206 @code
207 static int CompareStringLen(const wxString& first, const wxString& second)
208 {
209 return first.length() - second.length();
210 }
3c4f71cc 211
39fb8056 212 ...
3c4f71cc 213
39fb8056 214 wxArrayString array;
3c4f71cc 215
39fb8056
FM
216 array.Add("one");
217 array.Add("two");
218 array.Add("three");
219 array.Add("four");
3c4f71cc 220
39fb8056
FM
221 array.Sort(CompareStringLen);
222 @endcode
23324ae1 223 */
7c913512 224 void Sort(CompareFunction compareFunction);
23324ae1
FM
225
226 /**
227 Compares 2 arrays respecting the case. Returns @true if the arrays have
228 different number of elements or if the elements don't match pairwise.
229 */
328f5751 230 bool operator !=(const wxArrayString& array) const;
23324ae1
FM
231
232 /**
233 Assignment operator.
234 */
8d483c9b 235 wxArrayString& operator=(const wxArrayString&);
23324ae1
FM
236
237 /**
238 Compares 2 arrays respecting the case. Returns @true only if the arrays have
239 the same number of elements and the same strings in the same order.
240 */
328f5751 241 bool operator ==(const wxArrayString& array) const;
23324ae1
FM
242
243 /**
8d483c9b 244 Return the array element at position @a nIndex. An assert failure will
39fb8056
FM
245 result from an attempt to access an element beyond the end of array in
246 debug mode, but no check is done in release mode.
247
248 This is the operator version of the Item() method.
23324ae1 249 */
8d483c9b 250 wxString& operator[](size_t nIndex) const;
23324ae1
FM
251};
252
253
b7c50e37
FM
254/**
255 @class wxSortedArrayString
b7c50e37
FM
256
257 wxSortedArrayString is an efficient container for storing wxString objects
258 which always keeps the string in alphabetical order.
259
260 wxSortedArrayString uses binary search in its wxArrayString::Index() function
261 (instead of linear search for wxArrayString::Index()) which makes it much more
262 efficient if you add strings to the array rarely (because, of course, you have
263 to pay for Index() efficiency by having Add() be slower) but search for them
264 often. Several methods should not be used with sorted array (basically, all
265 those which break the order of items) which is mentioned in their description.
266
267 @todo what about STL? who does it integrates?
268
269 @library{wxbase}
270 @category{containers}
271
272 @see wxArray, wxString, @ref overview_string
273*/
274class wxSortedArrayString : public wxArrayString
275{
276public:
277
278 /**
279 Copy constructor. Note that when an array is assigned to a sorted array,
280 its contents is automatically sorted during construction.
281 */
282 wxArrayString(const wxArrayString& array);
283
284 /**
285 @copydoc wxArrayString::Add()
286
287 @warning
288 For sorted arrays, the index of the inserted item will not be, in general,
289 equal to GetCount() - 1 because the item is inserted at the correct position
290 to keep the array sorted and not appended.
291 */
292 size_t Add(const wxString& str, size_t copies = 1);
293
294
295 /**
296 @copydoc wxArrayString::Index()
297
3c4f71cc 298 This function uses binary search for wxSortedArrayString, but it ignores
b7c50e37
FM
299 the @a bCase and @a bFromEnd parameters.
300 */
301 int Index(const wxString& sz, bool bCase = true,
fadc2df6 302 bool bFromEnd = false) const;
b7c50e37
FM
303
304 /**
f045c7f5 305 @warning This function should not be used with sorted arrays because it
b7c50e37
FM
306 could break the order of items and, for example, subsequent calls
307 to Index() would then not work!
308 */
309 void Insert(const wxString& str, size_t nIndex,
310 size_t copies = 1);
311
b02f1c86 312 //@{
b7c50e37 313 /**
f045c7f5 314 @warning This function should not be used with sorted array because it could
b7c50e37 315 break the order of items and, for example, subsequent calls to Index()
b02f1c86
FM
316 would then not work! Also, sorting a wxSortedArrayString doesn't make
317 sense because its elements are always already sorted.
b7c50e37
FM
318 */
319 void Sort(bool reverseOrder = false);
b7c50e37 320 void Sort(CompareFunction compareFunction);
b02f1c86 321 //@}
b7c50e37
FM
322};
323
e54c96f1 324
23324ae1
FM
325// ============================================================================
326// Global functions/macros
327// ============================================================================
328
b21126db 329/** @addtogroup group_funcmacro_string */
39fb8056
FM
330//@{
331
23324ae1 332/**
4cc4bfaf 333 Splits the given wxString object using the separator @a sep and returns the
23324ae1 334 result as a wxArrayString.
39fb8056 335
4cc4bfaf 336 If the @a escape character is non-@NULL, then the occurrences of @a sep
39fb8056 337 immediately prefixed with @a escape are not considered as separators.
23324ae1
FM
338 Note that empty tokens will be generated if there are two or more adjacent
339 separators.
7c913512 340
e54c96f1 341 @see wxJoin()
3950d49c
BP
342
343 @header{wx/arrstr.h}
23324ae1
FM
344*/
345wxArrayString wxSplit(const wxString& str, const wxChar sep,
39fb8056 346 const wxChar escape = '\\');
23324ae1
FM
347
348/**
39fb8056
FM
349 Concatenate all lines of the given wxArrayString object using the separator
350 @a sep and returns the result as a wxString.
351
4cc4bfaf 352 If the @a escape character is non-@NULL, then it's used as prefix for each
71f8a117 353 occurrence of @a sep in the strings contained in @a arr before joining them
3950d49c
BP
354 which is necessary in order to be able to recover the original array
355 contents from the string later using wxSplit().
39fb8056
FM
356
357 @see wxSplit()
3950d49c
BP
358
359 @header{wx/arrstr.h}
23324ae1
FM
360*/
361wxString wxJoin(const wxArrayString& arr, const wxChar sep,
39fb8056 362 const wxChar escape = '\\');
23324ae1 363
39fb8056 364//@}
3950d49c 365