// Licence: wxWindows license
/////////////////////////////////////////////////////////////////////////////
// Licence: wxWindows license
/////////////////////////////////////////////////////////////////////////////
-/**
- @todo
- the following functions are not documented; do they need to be?
- WXDLLIMPEXP_BASE int wxCMPFUNC_CONV wxStringSortAscending(wxString*, wxString*);
- WXDLLIMPEXP_BASE int wxCMPFUNC_CONV wxStringSortDescending(wxString*, wxString*);
-*/
-
- Releases the extra memory allocated by the array. This function is useful to
- minimize the array memory consumption.
-
- @todo FIX THIS LINK
+ Releases the extra memory allocated by the array.
+ This function is useful to minimize the array memory consumption.
parameters and returning an @e int value less than, equal to or greater
than 0 if the first string is less than, equal to or greater than the
second one.
parameters and returning an @e int value less than, equal to or greater
than 0 if the first string is less than, equal to or greater than the
second one.
wxSortedArrayString is an efficient container for storing wxString objects
which always keeps the string in alphabetical order.
wxSortedArrayString is an efficient container for storing wxString objects
which always keeps the string in alphabetical order.
the @a bCase and @a bFromEnd parameters.
*/
int Index(const wxString& sz, bool bCase = true,
the @a bCase and @a bFromEnd parameters.
*/
int Index(const wxString& sz, bool bCase = true,
could break the order of items and, for example, subsequent calls
to Index() would then not work!
*/
could break the order of items and, for example, subsequent calls
to Index() would then not work!
*/
break the order of items and, for example, subsequent calls to Index()
would then not work! Also, sorting a wxSortedArrayString doesn't make
sense because its elements are always already sorted.
break the order of items and, for example, subsequent calls to Index()
would then not work! Also, sorting a wxSortedArrayString doesn't make
sense because its elements are always already sorted.
// Global functions/macros
// ============================================================================
// Global functions/macros
// ============================================================================