1999-01-14 14:33:56 +00:00
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
1998-05-20 14:01:55 +00:00
|
|
|
// Name: string.h
|
1999-01-14 14:33:56 +00:00
|
|
|
// Purpose: wxString and wxArrayString classes
|
1998-05-20 14:01:55 +00:00
|
|
|
// Author: Vadim Zeitlin
|
|
|
|
// Modified by:
|
|
|
|
// Created: 29/01/98
|
|
|
|
// RCS-ID: $Id$
|
|
|
|
// Copyright: (c) 1998 Vadim Zeitlin <zeitlin@dptmaths.ens-cachan.fr>
|
1998-07-15 17:10:23 +00:00
|
|
|
// Licence: wxWindows license
|
1999-01-14 14:33:56 +00:00
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-10-04 20:15:38 +00:00
|
|
|
/*
|
|
|
|
Efficient string class [more or less] compatible with MFC CString,
|
|
|
|
wxWindows version 1 wxString and std::string and some handy functions
|
|
|
|
missing from string.h.
|
|
|
|
*/
|
|
|
|
|
1998-08-15 00:23:28 +00:00
|
|
|
#ifndef _WX_WXSTRINGH__
|
|
|
|
#define _WX_WXSTRINGH__
|
1998-05-20 14:01:55 +00:00
|
|
|
|
|
|
|
#ifdef __GNUG__
|
1999-10-04 20:15:38 +00:00
|
|
|
#pragma interface "string.h"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// conditinal compilation
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
// compile the std::string compatibility functions if defined
|
|
|
|
#define wxSTD_STRING_COMPATIBILITY
|
|
|
|
|
|
|
|
// define to derive wxString from wxObject (deprecated!)
|
|
|
|
#ifdef WXSTRING_IS_WXOBJECT
|
|
|
|
#undef WXSTRING_IS_WXOBJECT
|
1998-05-20 14:01:55 +00:00
|
|
|
#endif
|
|
|
|
|
1999-10-04 20:15:38 +00:00
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// headers
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
1999-01-01 16:22:21 +00:00
|
|
|
#ifdef __WXMAC__
|
1999-02-03 16:48:12 +00:00
|
|
|
#include <ctype.h>
|
1999-01-01 16:22:21 +00:00
|
|
|
#endif
|
1999-02-03 16:48:12 +00:00
|
|
|
|
1999-06-13 15:24:01 +00:00
|
|
|
#ifdef __EMX__
|
|
|
|
#include <std.h>
|
|
|
|
#endif
|
|
|
|
|
1998-05-20 14:01:55 +00:00
|
|
|
#include <string.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdarg.h>
|
|
|
|
#include <limits.h>
|
1998-07-15 17:10:23 +00:00
|
|
|
#include <stdlib.h>
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-03-12 19:12:49 +00:00
|
|
|
#ifdef HAVE_STRINGS_H
|
1999-03-12 15:23:00 +00:00
|
|
|
#include <strings.h> // for strcasecmp()
|
|
|
|
#endif // AIX
|
|
|
|
|
1999-10-04 20:15:38 +00:00
|
|
|
#include "wx/defs.h" // everybody should include this
|
|
|
|
#include "wx/debug.h" // for wxASSERT()
|
|
|
|
#include "wx/wxchar.h" // for wxChar
|
|
|
|
#include "wx/buffer.h" // for wxCharBuffer
|
|
|
|
#include "wx/strconv.h" // for wxConvertXXX() macros and wxMBConv classes
|
1999-02-03 16:48:12 +00:00
|
|
|
|
1999-10-04 20:15:38 +00:00
|
|
|
#ifndef WX_PRECOMP
|
1998-07-15 17:10:23 +00:00
|
|
|
#ifdef WXSTRING_IS_WXOBJECT
|
1999-10-04 20:15:38 +00:00
|
|
|
#include "wx/object.h" // base class
|
1998-07-15 17:10:23 +00:00
|
|
|
#endif
|
1999-02-03 16:48:12 +00:00
|
|
|
#endif // !PCH
|
1998-07-08 22:21:11 +00:00
|
|
|
|
1998-05-20 14:01:55 +00:00
|
|
|
// ---------------------------------------------------------------------------
|
|
|
|
// macros
|
|
|
|
// ---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
// 'naughty' cast
|
1999-04-12 21:14:46 +00:00
|
|
|
#define WXSTRINGCAST (wxChar *)(const wxChar *)
|
1999-10-04 20:15:38 +00:00
|
|
|
#define wxCSTRINGCAST (wxChar *)(const wxChar *)
|
|
|
|
#define wxMBSTRINGCAST (char *)(const char *)
|
|
|
|
#define wxWCSTRINGCAST (wchar_t *)(const wchar_t *)
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// implementation only
|
1999-04-07 17:22:19 +00:00
|
|
|
#define ASSERT_VALID_INDEX(i) wxASSERT( (unsigned)(i) <= Len() )
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-10-04 20:15:38 +00:00
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// constants
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
// maximum possible length for a string means "take all string" everywhere
|
|
|
|
// (as sizeof(StringData) is unknown here, we substract 100)
|
|
|
|
const unsigned int wxSTRING_MAXLEN = UINT_MAX - 100;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// global data
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
// global pointer to empty string
|
|
|
|
WXDLLEXPORT_DATA(extern const wxChar*) wxEmptyString;
|
1999-08-08 11:31:18 +00:00
|
|
|
|
1998-05-20 14:01:55 +00:00
|
|
|
// ---------------------------------------------------------------------------
|
1999-10-04 20:15:38 +00:00
|
|
|
// global functions complementing standard C string library replacements for
|
1999-01-14 14:33:56 +00:00
|
|
|
// strlen() and portable strcasecmp()
|
|
|
|
//---------------------------------------------------------------------------
|
1999-10-04 20:15:38 +00:00
|
|
|
|
|
|
|
// Use wxXXX() functions from wxchar.h instead! These functions are for
|
|
|
|
// backwards compatibility only.
|
1998-12-28 21:32:10 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// checks whether the passed in pointer is NULL and if the string is empty
|
1999-02-09 16:00:23 +00:00
|
|
|
inline bool WXDLLEXPORT IsEmpty(const char *p) { return (!p || !*p); }
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// safe version of strlen() (returns 0 if passed NULL pointer)
|
|
|
|
inline size_t WXDLLEXPORT Strlen(const char *psz)
|
1998-05-20 14:01:55 +00:00
|
|
|
{ return psz ? strlen(psz) : 0; }
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// portable strcasecmp/_stricmp
|
1998-07-15 17:10:23 +00:00
|
|
|
inline int WXDLLEXPORT Stricmp(const char *psz1, const char *psz2)
|
|
|
|
{
|
1999-06-13 15:24:01 +00:00
|
|
|
#if defined(__VISUALC__) || ( defined(__MWERKS__) && defined(__INTEL__) )
|
1998-07-15 17:10:23 +00:00
|
|
|
return _stricmp(psz1, psz2);
|
1999-06-13 15:24:01 +00:00
|
|
|
#elif defined(__SC__)
|
1999-01-07 08:43:47 +00:00
|
|
|
return _stricmp(psz1, psz2);
|
1999-06-13 15:24:01 +00:00
|
|
|
#elif defined(__SALFORDC__)
|
1999-01-16 00:13:58 +00:00
|
|
|
return stricmp(psz1, psz2);
|
1998-07-15 17:10:23 +00:00
|
|
|
#elif defined(__BORLANDC__)
|
|
|
|
return stricmp(psz1, psz2);
|
1998-12-18 23:18:59 +00:00
|
|
|
#elif defined(__WATCOMC__)
|
|
|
|
return stricmp(psz1, psz2);
|
1999-06-13 15:24:01 +00:00
|
|
|
#elif defined(__EMX__)
|
|
|
|
return stricmp(psz1, psz2);
|
1999-07-28 04:02:37 +00:00
|
|
|
#elif defined(__WXPM__)
|
1999-07-28 03:38:12 +00:00
|
|
|
return stricmp(psz1, psz2);
|
1999-06-13 15:24:01 +00:00
|
|
|
#elif defined(__UNIX__) || defined(__GNUWIN32__)
|
1998-07-15 17:10:23 +00:00
|
|
|
return strcasecmp(psz1, psz2);
|
1999-02-11 16:56:43 +00:00
|
|
|
#elif defined(__MWERKS__) && !defined(__INTEL__)
|
1999-01-01 16:22:21 +00:00
|
|
|
register char c1, c2;
|
|
|
|
do {
|
|
|
|
c1 = tolower(*psz1++);
|
|
|
|
c2 = tolower(*psz2++);
|
|
|
|
} while ( c1 && (c1 == c2) );
|
|
|
|
|
|
|
|
return c1 - c2;
|
1998-07-15 17:10:23 +00:00
|
|
|
#else
|
|
|
|
// almost all compilers/libraries provide this function (unfortunately under
|
|
|
|
// different names), that's why we don't implement our own which will surely
|
|
|
|
// be more efficient than this code (uncomment to use):
|
|
|
|
/*
|
|
|
|
register char c1, c2;
|
|
|
|
do {
|
|
|
|
c1 = tolower(*psz1++);
|
|
|
|
c2 = tolower(*psz2++);
|
|
|
|
} while ( c1 && (c1 == c2) );
|
|
|
|
|
|
|
|
return c1 - c2;
|
|
|
|
*/
|
|
|
|
|
|
|
|
#error "Please define string case-insensitive compare for your OS/compiler"
|
|
|
|
#endif // OS/compiler
|
|
|
|
}
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1998-07-12 22:40:00 +00:00
|
|
|
// return an empty wxString
|
1998-07-29 06:51:33 +00:00
|
|
|
class WXDLLEXPORT wxString; // not yet defined
|
1999-10-04 20:15:38 +00:00
|
|
|
inline const wxString& wxGetEmptyString() { return *(wxString *)&wxEmptyString; }
|
1998-07-12 22:40:00 +00:00
|
|
|
|
1998-05-20 14:01:55 +00:00
|
|
|
// ---------------------------------------------------------------------------
|
1998-07-12 22:40:00 +00:00
|
|
|
// string data prepended with some housekeeping info (used by wxString class),
|
1998-05-20 14:01:55 +00:00
|
|
|
// is never used directly (but had to be put here to allow inlining)
|
|
|
|
// ---------------------------------------------------------------------------
|
1999-10-04 20:15:38 +00:00
|
|
|
|
1998-05-20 14:01:55 +00:00
|
|
|
struct WXDLLEXPORT wxStringData
|
|
|
|
{
|
|
|
|
int nRefs; // reference count
|
1998-09-17 14:31:17 +00:00
|
|
|
size_t nDataLength, // actual string length
|
1998-05-20 14:01:55 +00:00
|
|
|
nAllocLength; // allocated memory size
|
|
|
|
|
1999-04-12 21:14:46 +00:00
|
|
|
// mimics declaration 'wxChar data[nAllocLength]'
|
|
|
|
wxChar* data() const { return (wxChar*)(this + 1); }
|
1998-05-20 14:01:55 +00:00
|
|
|
|
|
|
|
// empty string has a special ref count so it's never deleted
|
1999-02-09 16:00:23 +00:00
|
|
|
bool IsEmpty() const { return (nRefs == -1); }
|
|
|
|
bool IsShared() const { return (nRefs > 1); }
|
1998-05-20 14:01:55 +00:00
|
|
|
|
|
|
|
// lock/unlock
|
1998-07-15 17:10:23 +00:00
|
|
|
void Lock() { if ( !IsEmpty() ) nRefs++; }
|
|
|
|
void Unlock() { if ( !IsEmpty() && --nRefs == 0) free(this); }
|
1998-07-08 22:21:11 +00:00
|
|
|
|
1998-07-15 17:10:23 +00:00
|
|
|
// if we had taken control over string memory (GetWriteBuf), it's
|
1998-07-08 22:21:11 +00:00
|
|
|
// intentionally put in invalid state
|
1999-02-09 16:00:23 +00:00
|
|
|
void Validate(bool b) { nRefs = (b ? 1 : 0); }
|
|
|
|
bool IsValid() const { return (nRefs != 0); }
|
1998-05-20 14:01:55 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
// ---------------------------------------------------------------------------
|
1999-01-14 14:33:56 +00:00
|
|
|
// This is (yet another one) String class for C++ programmers. It doesn't use
|
|
|
|
// any of "advanced" C++ features (i.e. templates, exceptions, namespaces...)
|
|
|
|
// thus you should be able to compile it with practicaly any C++ compiler.
|
|
|
|
// This class uses copy-on-write technique, i.e. identical strings share the
|
|
|
|
// same memory as long as neither of them is changed.
|
|
|
|
//
|
|
|
|
// This class aims to be as compatible as possible with the new standard
|
|
|
|
// std::string class, but adds some additional functions and should be at
|
|
|
|
// least as efficient than the standard implementation.
|
|
|
|
//
|
|
|
|
// Performance note: it's more efficient to write functions which take "const
|
|
|
|
// String&" arguments than "const char *" if you assign the argument to
|
|
|
|
// another string.
|
|
|
|
//
|
|
|
|
// It was compiled and tested under Win32, Linux (libc 5 & 6), Solaris 5.5.
|
|
|
|
//
|
|
|
|
// To do:
|
|
|
|
// - ressource support (string tables in ressources)
|
|
|
|
// - more wide character (UNICODE) support
|
|
|
|
// - regular expressions support
|
1998-05-20 14:01:55 +00:00
|
|
|
// ---------------------------------------------------------------------------
|
1999-01-14 14:33:56 +00:00
|
|
|
|
1998-05-20 14:01:55 +00:00
|
|
|
#ifdef WXSTRING_IS_WXOBJECT
|
1999-01-14 14:33:56 +00:00
|
|
|
class WXDLLEXPORT wxString : public wxObject
|
|
|
|
{
|
1998-05-20 14:01:55 +00:00
|
|
|
DECLARE_DYNAMIC_CLASS(wxString)
|
|
|
|
#else //WXSTRING_IS_WXOBJECT
|
1999-01-14 14:33:56 +00:00
|
|
|
class WXDLLEXPORT wxString
|
|
|
|
{
|
1998-05-20 14:01:55 +00:00
|
|
|
#endif //WXSTRING_IS_WXOBJECT
|
|
|
|
|
1998-09-14 16:37:24 +00:00
|
|
|
friend class WXDLLEXPORT wxArrayString;
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// NB: special care was taken in arranging the member functions in such order
|
|
|
|
// that all inline functions can be effectively inlined, verify that all
|
|
|
|
// performace critical functions are still inlined if you change order!
|
1998-07-15 17:10:23 +00:00
|
|
|
private:
|
|
|
|
// points to data preceded by wxStringData structure with ref count info
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar *m_pchData;
|
1998-07-15 17:10:23 +00:00
|
|
|
|
|
|
|
// accessor to string data
|
|
|
|
wxStringData* GetStringData() const { return (wxStringData*)m_pchData - 1; }
|
|
|
|
|
1998-07-17 20:51:36 +00:00
|
|
|
// string (re)initialization functions
|
|
|
|
// initializes the string to the empty value (must be called only from
|
|
|
|
// ctors, use Reinit() otherwise)
|
1999-10-04 20:15:38 +00:00
|
|
|
void Init() { m_pchData = (wxChar *)wxEmptyString; }
|
1998-07-17 20:51:36 +00:00
|
|
|
// initializaes the string with (a part of) C-string
|
1999-04-12 21:14:46 +00:00
|
|
|
void InitWith(const wxChar *psz, size_t nPos = 0, size_t nLen = wxSTRING_MAXLEN);
|
1998-07-17 20:51:36 +00:00
|
|
|
// as Init, but also frees old data
|
|
|
|
void Reinit() { GetStringData()->Unlock(); Init(); }
|
|
|
|
|
|
|
|
// memory allocation
|
|
|
|
// allocates memory for string of lenght nLen
|
|
|
|
void AllocBuffer(size_t nLen);
|
|
|
|
// copies data to another string
|
|
|
|
void AllocCopy(wxString&, int, int) const;
|
|
|
|
// effectively copies data to string
|
1999-04-12 21:14:46 +00:00
|
|
|
void AssignCopy(size_t, const wxChar *);
|
1998-07-17 20:51:36 +00:00
|
|
|
|
|
|
|
// append a (sub)string
|
1999-04-12 21:14:46 +00:00
|
|
|
void ConcatSelf(int nLen, const wxChar *src);
|
1998-07-17 20:51:36 +00:00
|
|
|
|
|
|
|
// functions called before writing to the string: they copy it if there
|
|
|
|
// are other references to our data (should be the only owner when writing)
|
|
|
|
void CopyBeforeWrite();
|
|
|
|
void AllocBeforeWrite(size_t);
|
|
|
|
|
1999-02-04 16:06:01 +00:00
|
|
|
// this method is not implemented - there is _no_ conversion from int to
|
|
|
|
// string, you're doing something wrong if the compiler wants to call it!
|
|
|
|
//
|
|
|
|
// try `s << i' or `s.Printf("%d", i)' instead
|
|
|
|
wxString(int);
|
|
|
|
wxString(long);
|
|
|
|
|
1998-05-20 14:01:55 +00:00
|
|
|
public:
|
1999-01-14 14:33:56 +00:00
|
|
|
// constructors and destructor
|
|
|
|
// ctor for an empty string
|
1998-07-17 20:51:36 +00:00
|
|
|
wxString() { Init(); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// copy ctor
|
1998-07-17 20:51:36 +00:00
|
|
|
wxString(const wxString& stringSrc)
|
|
|
|
{
|
|
|
|
wxASSERT( stringSrc.GetStringData()->IsValid() );
|
|
|
|
|
|
|
|
if ( stringSrc.IsEmpty() ) {
|
|
|
|
// nothing to do for an empty string
|
|
|
|
Init();
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
m_pchData = stringSrc.m_pchData; // share same data
|
|
|
|
GetStringData()->Lock(); // => one more copy
|
|
|
|
}
|
|
|
|
}
|
1999-01-14 14:33:56 +00:00
|
|
|
// string containing nRepeat copies of ch
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString(wxChar ch, size_t nRepeat = 1);
|
1999-01-14 14:33:56 +00:00
|
|
|
// ctor takes first nLength characters from C string
|
1999-02-04 17:39:04 +00:00
|
|
|
// (default value of wxSTRING_MAXLEN means take all the string)
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString(const wxChar *psz, size_t nLength = wxSTRING_MAXLEN)
|
1998-07-17 20:51:36 +00:00
|
|
|
{ InitWith(psz, 0, nLength); }
|
1999-10-04 20:15:38 +00:00
|
|
|
|
1999-04-12 21:14:46 +00:00
|
|
|
#if wxUSE_UNICODE
|
|
|
|
// from multibyte string
|
|
|
|
// (NB: nLength is right now number of Unicode characters, not
|
|
|
|
// characters in psz! So try not to use it yet!)
|
1999-04-26 18:18:30 +00:00
|
|
|
wxString(const char *psz, wxMBConv& conv = wxConvLibc, size_t nLength = wxSTRING_MAXLEN);
|
1999-04-12 21:14:46 +00:00
|
|
|
// from wxWCharBuffer (i.e. return from wxGetString)
|
|
|
|
wxString(const wxWCharBuffer& psz)
|
|
|
|
{ InitWith(psz, 0, wxSTRING_MAXLEN); }
|
1999-10-04 20:15:38 +00:00
|
|
|
#else // ANSI
|
1999-01-14 14:33:56 +00:00
|
|
|
// from C string (for compilers using unsigned char)
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString(const unsigned char* psz, size_t nLength = wxSTRING_MAXLEN)
|
|
|
|
{ InitWith((const char*)psz, 0, nLength); }
|
1999-04-15 15:13:26 +00:00
|
|
|
// from multibyte string
|
|
|
|
wxString(const char *psz, wxMBConv& WXUNUSED(conv), size_t nLength = wxSTRING_MAXLEN)
|
|
|
|
{ InitWith(psz, 0, nLength); }
|
1999-10-04 20:15:38 +00:00
|
|
|
|
1999-04-25 12:42:55 +00:00
|
|
|
#if wxUSE_WCHAR_T
|
1999-04-12 21:14:46 +00:00
|
|
|
// from wide (Unicode) string
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString(const wchar_t *pwz);
|
1999-10-04 20:15:38 +00:00
|
|
|
#endif // !wxUSE_WCHAR_T
|
|
|
|
|
1999-04-12 21:14:46 +00:00
|
|
|
// from wxCharBuffer
|
|
|
|
wxString(const wxCharBuffer& psz)
|
|
|
|
{ InitWith(psz, 0, wxSTRING_MAXLEN); }
|
1999-10-04 20:15:38 +00:00
|
|
|
#endif // Unicode/ANSI
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// dtor is not virtual, this class must not be inherited from!
|
1998-07-17 20:51:36 +00:00
|
|
|
~wxString() { GetStringData()->Unlock(); }
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// generic attributes & operations
|
|
|
|
// as standard strlen()
|
1998-09-25 13:28:52 +00:00
|
|
|
size_t Len() const { return GetStringData()->nDataLength; }
|
1999-01-14 14:33:56 +00:00
|
|
|
// string contains any characters?
|
1998-07-15 17:10:23 +00:00
|
|
|
bool IsEmpty() const { return Len() == 0; }
|
1999-01-28 13:44:26 +00:00
|
|
|
// empty string is "FALSE", so !str will return TRUE
|
|
|
|
bool operator!() const { return IsEmpty(); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// empty string contents
|
1998-07-15 17:10:23 +00:00
|
|
|
void Empty()
|
|
|
|
{
|
1998-10-03 00:25:17 +00:00
|
|
|
if ( !IsEmpty() )
|
1998-07-15 17:10:23 +00:00
|
|
|
Reinit();
|
|
|
|
|
1998-11-24 16:08:06 +00:00
|
|
|
// should be empty
|
1998-07-15 17:10:23 +00:00
|
|
|
wxASSERT( GetStringData()->nDataLength == 0 );
|
1998-11-24 16:08:06 +00:00
|
|
|
}
|
1999-01-14 14:33:56 +00:00
|
|
|
// empty the string and free memory
|
1998-11-24 16:08:06 +00:00
|
|
|
void Clear()
|
|
|
|
{
|
|
|
|
if ( !GetStringData()->IsEmpty() )
|
|
|
|
Reinit();
|
|
|
|
|
|
|
|
wxASSERT( GetStringData()->nDataLength == 0 ); // should be empty
|
|
|
|
wxASSERT( GetStringData()->nAllocLength == 0 ); // and not own any memory
|
1998-07-15 17:10:23 +00:00
|
|
|
}
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// contents test
|
|
|
|
// Is an ascii value
|
1998-05-20 14:01:55 +00:00
|
|
|
bool IsAscii() const;
|
1999-01-14 14:33:56 +00:00
|
|
|
// Is a number
|
1998-05-20 14:01:55 +00:00
|
|
|
bool IsNumber() const;
|
1999-01-14 14:33:56 +00:00
|
|
|
// Is a word
|
1998-05-20 14:01:55 +00:00
|
|
|
bool IsWord() const;
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// data access (all indexes are 0 based)
|
|
|
|
// read access
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar GetChar(size_t n) const
|
1998-07-15 17:10:23 +00:00
|
|
|
{ ASSERT_VALID_INDEX( n ); return m_pchData[n]; }
|
1999-01-14 14:33:56 +00:00
|
|
|
// read/write access
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar& GetWritableChar(size_t n)
|
1998-07-15 17:10:23 +00:00
|
|
|
{ ASSERT_VALID_INDEX( n ); CopyBeforeWrite(); return m_pchData[n]; }
|
1999-01-14 14:33:56 +00:00
|
|
|
// write access
|
1999-04-12 21:14:46 +00:00
|
|
|
void SetChar(size_t n, wxChar ch)
|
1998-05-20 14:01:55 +00:00
|
|
|
{ ASSERT_VALID_INDEX( n ); CopyBeforeWrite(); m_pchData[n] = ch; }
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// get last character
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar Last() const
|
1998-05-20 14:01:55 +00:00
|
|
|
{ wxASSERT( !IsEmpty() ); return m_pchData[Len() - 1]; }
|
1999-01-14 14:33:56 +00:00
|
|
|
// get writable last character
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar& Last()
|
1998-05-20 14:01:55 +00:00
|
|
|
{ wxASSERT( !IsEmpty() ); CopyBeforeWrite(); return m_pchData[Len()-1]; }
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// operator version of GetChar
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar operator[](size_t n) const
|
1998-05-20 14:01:55 +00:00
|
|
|
{ ASSERT_VALID_INDEX( n ); return m_pchData[n]; }
|
1998-12-17 18:12:31 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// operator version of GetChar
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar operator[](int n) const
|
1998-05-20 14:01:55 +00:00
|
|
|
{ ASSERT_VALID_INDEX( n ); return m_pchData[n]; }
|
1999-01-14 14:33:56 +00:00
|
|
|
// operator version of GetWritableChar
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar& operator[](size_t n)
|
1998-05-20 14:01:55 +00:00
|
|
|
{ ASSERT_VALID_INDEX( n ); CopyBeforeWrite(); return m_pchData[n]; }
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// implicit conversion to C string
|
1999-04-12 21:14:46 +00:00
|
|
|
operator const wxChar*() const { return m_pchData; }
|
1999-01-14 14:33:56 +00:00
|
|
|
// explicit conversion to C string (use this with printf()!)
|
1999-04-12 21:14:46 +00:00
|
|
|
const wxChar* c_str() const { return m_pchData; }
|
1999-04-25 12:42:55 +00:00
|
|
|
// (and this with [wx]Printf()!)
|
|
|
|
const wxChar* wx_str() const { return m_pchData; }
|
1999-10-04 20:15:38 +00:00
|
|
|
// identical to c_str()
|
1999-04-12 21:14:46 +00:00
|
|
|
const wxChar* GetData() const { return m_pchData; }
|
1999-10-04 20:15:38 +00:00
|
|
|
|
|
|
|
// conversions with (possible) format convertions: have to return a
|
|
|
|
// buffer with temporary data
|
1999-04-12 21:14:46 +00:00
|
|
|
#if wxUSE_UNICODE
|
1999-04-26 18:18:30 +00:00
|
|
|
const wxCharBuffer mb_str(wxMBConv& conv = wxConvLibc) const { return conv.cWC2MB(m_pchData); }
|
1999-10-04 20:15:38 +00:00
|
|
|
const wxWX2MBbuf mbc_str() const { return mb_str(*wxConvCurrent); }
|
|
|
|
|
1999-04-26 18:18:30 +00:00
|
|
|
const wxChar* wc_str(wxMBConv& WXUNUSED(conv) = wxConvLibc) const { return m_pchData; }
|
1999-10-04 20:15:38 +00:00
|
|
|
|
1999-04-12 21:14:46 +00:00
|
|
|
#if wxMBFILES
|
1999-04-26 18:18:30 +00:00
|
|
|
const wxCharBuffer fn_str() const { return mb_str(wxConvFile); }
|
1999-10-04 20:15:38 +00:00
|
|
|
#else // !wxMBFILES
|
1999-04-12 21:14:46 +00:00
|
|
|
const wxChar* fn_str() const { return m_pchData; }
|
1999-10-04 20:15:38 +00:00
|
|
|
#endif // wxMBFILES/!wxMBFILES
|
|
|
|
#else // ANSI
|
|
|
|
#if wxUSE_MULTIBYTE
|
|
|
|
const wxChar* mb_str(wxMBConv& WXUNUSED(conv) = wxConvLibc) const
|
|
|
|
{ return m_pchData; }
|
|
|
|
const wxWX2MBbuf mbc_str() const { return mb_str(*wxConvCurrent); }
|
|
|
|
#else // !mmultibyte
|
|
|
|
const wxChar* mb_str() const { return m_pchData; }
|
|
|
|
const wxWX2MBbuf mbc_str() const { return mb_str(); }
|
|
|
|
#endif // multibyte/!multibyte
|
1999-04-25 12:42:55 +00:00
|
|
|
#if wxUSE_WCHAR_T
|
1999-04-12 21:14:46 +00:00
|
|
|
const wxWCharBuffer wc_str(wxMBConv& conv) const { return conv.cMB2WC(m_pchData); }
|
1999-10-04 20:15:38 +00:00
|
|
|
#endif // wxUSE_WCHAR_T
|
1999-04-12 21:14:46 +00:00
|
|
|
const wxChar* fn_str() const { return m_pchData; }
|
1999-10-04 20:15:38 +00:00
|
|
|
#endif // Unicode/ANSI
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// overloaded assignment
|
|
|
|
// from another wxString
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& operator=(const wxString& stringSrc);
|
1999-01-14 14:33:56 +00:00
|
|
|
// from a character
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& operator=(wxChar ch);
|
1999-01-14 14:33:56 +00:00
|
|
|
// from a C string
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& operator=(const wxChar *psz);
|
1999-04-13 07:19:59 +00:00
|
|
|
#if wxUSE_UNICODE
|
|
|
|
// from wxWCharBuffer
|
|
|
|
wxString& operator=(const wxWCharBuffer& psz) { return operator=((const wchar_t *)psz); }
|
1999-10-04 20:15:38 +00:00
|
|
|
#else // ANSI
|
1999-01-14 14:33:56 +00:00
|
|
|
// from another kind of C string
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& operator=(const unsigned char* psz);
|
1999-04-25 12:42:55 +00:00
|
|
|
#if wxUSE_WCHAR_T
|
1999-01-14 14:33:56 +00:00
|
|
|
// from a wide string
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& operator=(const wchar_t *pwz);
|
1999-04-25 12:42:55 +00:00
|
|
|
#endif
|
1999-04-13 07:19:59 +00:00
|
|
|
// from wxCharBuffer
|
|
|
|
wxString& operator=(const wxCharBuffer& psz) { return operator=((const char *)psz); }
|
1999-10-04 20:15:38 +00:00
|
|
|
#endif // Unicode/ANSI
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// string concatenation
|
|
|
|
// in place concatenation
|
|
|
|
/*
|
|
|
|
Concatenate and return the result. Note that the left to right
|
|
|
|
associativity of << allows to write things like "str << str1 << str2
|
|
|
|
<< ..." (unlike with +=)
|
|
|
|
*/
|
|
|
|
// string += string
|
1998-07-15 17:10:23 +00:00
|
|
|
wxString& operator<<(const wxString& s)
|
|
|
|
{
|
|
|
|
wxASSERT( s.GetStringData()->IsValid() );
|
|
|
|
|
|
|
|
ConcatSelf(s.Len(), s);
|
|
|
|
return *this;
|
|
|
|
}
|
1999-01-14 14:33:56 +00:00
|
|
|
// string += C string
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& operator<<(const wxChar *psz)
|
|
|
|
{ ConcatSelf(wxStrlen(psz), psz); return *this; }
|
1999-01-14 14:33:56 +00:00
|
|
|
// string += char
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& operator<<(wxChar ch) { ConcatSelf(1, &ch); return *this; }
|
1998-07-15 17:10:23 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// string += string
|
1998-07-17 20:51:36 +00:00
|
|
|
void operator+=(const wxString& s) { (void)operator<<(s); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// string += C string
|
1999-04-12 21:14:46 +00:00
|
|
|
void operator+=(const wxChar *psz) { (void)operator<<(psz); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// string += char
|
1999-04-12 21:14:46 +00:00
|
|
|
void operator+=(wxChar ch) { (void)operator<<(ch); }
|
|
|
|
|
|
|
|
// string += buffer (i.e. from wxGetString)
|
|
|
|
#if wxUSE_UNICODE
|
|
|
|
wxString& operator<<(const wxWCharBuffer& s) { (void)operator<<((const wchar_t *)s); return *this; }
|
|
|
|
void operator+=(const wxWCharBuffer& s) { (void)operator<<((const wchar_t *)s); }
|
|
|
|
#else
|
|
|
|
wxString& operator<<(const wxCharBuffer& s) { (void)operator<<((const char *)s); return *this; }
|
|
|
|
void operator+=(const wxCharBuffer& s) { (void)operator<<((const char *)s); }
|
|
|
|
#endif
|
1998-07-17 20:51:36 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// string += C string
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& Append(const wxChar* psz)
|
|
|
|
{ ConcatSelf(wxStrlen(psz), psz); return *this; }
|
1999-01-14 14:33:56 +00:00
|
|
|
// append count copies of given character
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& Append(wxChar ch, size_t count = 1u)
|
1999-01-14 14:33:56 +00:00
|
|
|
{ wxString str(ch, count); return *this << str; }
|
|
|
|
|
|
|
|
// prepend a string, return the string itself
|
|
|
|
wxString& Prepend(const wxString& str)
|
|
|
|
{ *this = str + *this; return *this; }
|
|
|
|
|
|
|
|
// non-destructive concatenation
|
|
|
|
//
|
1998-11-06 09:33:25 +00:00
|
|
|
friend wxString WXDLLEXPORT operator+(const wxString& string1, const wxString& string2);
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
friend wxString WXDLLEXPORT operator+(const wxString& string, wxChar ch);
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
friend wxString WXDLLEXPORT operator+(wxChar ch, const wxString& string);
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
friend wxString WXDLLEXPORT operator+(const wxString& string, const wxChar *psz);
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
friend wxString WXDLLEXPORT operator+(const wxChar *psz, const wxString& string);
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// stream-like functions
|
|
|
|
// insert an int into string
|
|
|
|
wxString& operator<<(int i);
|
|
|
|
// insert a float into string
|
|
|
|
wxString& operator<<(float f);
|
|
|
|
// insert a double into string
|
|
|
|
wxString& operator<<(double d);
|
1999-01-26 16:08:09 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// string comparison
|
1999-02-09 16:52:19 +00:00
|
|
|
// case-sensitive comparison (returns a value < 0, = 0 or > 0)
|
1999-06-15 22:30:44 +00:00
|
|
|
int Cmp(const wxChar *psz) const { return wxStrcmp(c_str(), psz); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// same as Cmp() but not case-sensitive
|
1999-06-15 22:30:44 +00:00
|
|
|
int CmpNoCase(const wxChar *psz) const { return wxStricmp(c_str(), psz); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// test for the string equality, either considering case or not
|
|
|
|
// (if compareWithCase then the case matters)
|
1999-04-12 21:14:46 +00:00
|
|
|
bool IsSameAs(const wxChar *psz, bool compareWithCase = TRUE) const
|
1999-01-14 14:33:56 +00:00
|
|
|
{ return (compareWithCase ? Cmp(psz) : CmpNoCase(psz)) == 0; }
|
1999-06-15 22:30:44 +00:00
|
|
|
// comparison with a signle character: returns TRUE if equal
|
|
|
|
bool IsSameAs(wxChar c, bool compareWithCase = TRUE) const
|
|
|
|
{
|
|
|
|
return (Len() == 1) && (compareWithCase ? GetChar(0u) == c
|
|
|
|
: wxToupper(GetChar(0u)) == wxToupper(c));
|
|
|
|
}
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// simple sub-string extraction
|
|
|
|
// return substring starting at nFirst of length nCount (or till the end
|
|
|
|
// if nCount = default value)
|
1999-02-04 17:39:04 +00:00
|
|
|
wxString Mid(size_t nFirst, size_t nCount = wxSTRING_MAXLEN) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// operator version of Mid()
|
|
|
|
wxString operator()(size_t start, size_t len) const
|
|
|
|
{ return Mid(start, len); }
|
|
|
|
|
|
|
|
// get first nCount characters
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString Left(size_t nCount) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
// get last nCount characters
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString Right(size_t nCount) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
// get all characters before the first occurence of ch
|
|
|
|
// (returns the whole string if ch not found)
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString BeforeFirst(wxChar ch) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
// get all characters before the last occurence of ch
|
|
|
|
// (returns empty string if ch not found)
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString BeforeLast(wxChar ch) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
// get all characters after the first occurence of ch
|
|
|
|
// (returns empty string if ch not found)
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString AfterFirst(wxChar ch) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
// get all characters after the last occurence of ch
|
|
|
|
// (returns the whole string if ch not found)
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString AfterLast(wxChar ch) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// for compatibility only, use more explicitly named functions above
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString Before(wxChar ch) const { return BeforeLast(ch); }
|
|
|
|
wxString After(wxChar ch) const { return AfterFirst(ch); }
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// case conversion
|
1999-01-26 16:08:09 +00:00
|
|
|
// convert to upper case in place, return the string itself
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& MakeUpper();
|
1999-01-26 16:08:09 +00:00
|
|
|
// convert to upper case, return the copy of the string
|
1999-01-31 11:42:58 +00:00
|
|
|
// Here's something to remember: BC++ doesn't like returns in inlines.
|
|
|
|
wxString Upper() const ;
|
1999-01-26 16:08:09 +00:00
|
|
|
// convert to lower case in place, return the string itself
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& MakeLower();
|
1999-01-26 16:08:09 +00:00
|
|
|
// convert to lower case, return the copy of the string
|
1999-01-31 11:42:58 +00:00
|
|
|
wxString Lower() const ;
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// trimming/padding whitespace (either side) and truncating
|
|
|
|
// remove spaces from left or from right (default) side
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& Trim(bool bFromRight = TRUE);
|
1999-01-14 14:33:56 +00:00
|
|
|
// add nCount copies chPad in the beginning or at the end (default)
|
1999-10-08 14:35:56 +00:00
|
|
|
wxString& Pad(size_t nCount, wxChar chPad = wxT(' '), bool bFromRight = TRUE);
|
1999-01-14 14:33:56 +00:00
|
|
|
// truncate string to given length
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& Truncate(size_t uiLen);
|
1998-07-15 17:10:23 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// searching and replacing
|
|
|
|
// searching (return starting index, or -1 if not found)
|
1999-04-12 21:14:46 +00:00
|
|
|
int Find(wxChar ch, bool bFromEnd = FALSE) const; // like strchr/strrchr
|
1999-01-14 14:33:56 +00:00
|
|
|
// searching (return starting index, or -1 if not found)
|
1999-04-12 21:14:46 +00:00
|
|
|
int Find(const wxChar *pszSub) const; // like strstr
|
1999-01-14 14:33:56 +00:00
|
|
|
// replace first (or all of bReplaceAll) occurences of substring with
|
|
|
|
// another string, returns the number of replacements made
|
1999-04-12 21:14:46 +00:00
|
|
|
size_t Replace(const wxChar *szOld,
|
|
|
|
const wxChar *szNew,
|
1999-01-14 14:33:56 +00:00
|
|
|
bool bReplaceAll = TRUE);
|
|
|
|
|
|
|
|
// check if the string contents matches a mask containing '*' and '?'
|
1999-04-12 21:14:46 +00:00
|
|
|
bool Matches(const wxChar *szMask) const;
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// formated input/output
|
|
|
|
// as sprintf(), returns the number of characters written or < 0 on error
|
1999-04-12 21:14:46 +00:00
|
|
|
int Printf(const wxChar *pszFormat, ...);
|
1999-01-14 14:33:56 +00:00
|
|
|
// as vprintf(), returns the number of characters written or < 0 on error
|
1999-04-12 21:14:46 +00:00
|
|
|
int PrintfV(const wxChar* pszFormat, va_list argptr);
|
1998-07-15 17:10:23 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// raw access to string memory
|
|
|
|
// ensure that string has space for at least nLen characters
|
1998-07-15 17:10:23 +00:00
|
|
|
// only works if the data of this string is not shared
|
1998-08-18 15:36:12 +00:00
|
|
|
void Alloc(size_t nLen);
|
1999-01-14 14:33:56 +00:00
|
|
|
// minimize the string's memory
|
1998-07-15 17:10:23 +00:00
|
|
|
// only works if the data of this string is not shared
|
|
|
|
void Shrink();
|
1999-01-14 14:33:56 +00:00
|
|
|
// get writable buffer of at least nLen bytes. Unget() *must* be called
|
|
|
|
// a.s.a.p. to put string back in a reasonable state!
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar *GetWriteBuf(size_t nLen);
|
1999-01-14 14:33:56 +00:00
|
|
|
// call this immediately after GetWriteBuf() has been used
|
1998-07-08 22:21:11 +00:00
|
|
|
void UngetWriteBuf();
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// wxWindows version 1 compatibility functions
|
|
|
|
|
|
|
|
// use Mid()
|
|
|
|
wxString SubString(size_t from, size_t to) const
|
|
|
|
{ return Mid(from, (to - from + 1)); }
|
|
|
|
// values for second parameter of CompareTo function
|
1998-05-20 14:01:55 +00:00
|
|
|
enum caseCompare {exact, ignoreCase};
|
1999-01-14 14:33:56 +00:00
|
|
|
// values for first parameter of Strip function
|
1998-05-20 14:01:55 +00:00
|
|
|
enum stripType {leading = 0x1, trailing = 0x2, both = 0x3};
|
1999-01-31 18:47:10 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// use Printf()
|
1999-04-12 21:14:46 +00:00
|
|
|
int sprintf(const wxChar *pszFormat, ...);
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// use Cmp()
|
1999-04-12 21:14:46 +00:00
|
|
|
inline int CompareTo(const wxChar* psz, caseCompare cmp = exact) const
|
1998-07-17 20:51:36 +00:00
|
|
|
{ return cmp == exact ? Cmp(psz) : CmpNoCase(psz); }
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// use Len
|
1998-05-20 14:01:55 +00:00
|
|
|
size_t Length() const { return Len(); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// Count the number of characters
|
1999-04-12 21:14:46 +00:00
|
|
|
int Freq(wxChar ch) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
// use MakeLower
|
1998-05-20 14:01:55 +00:00
|
|
|
void LowerCase() { MakeLower(); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// use MakeUpper
|
1998-05-20 14:01:55 +00:00
|
|
|
void UpperCase() { MakeUpper(); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// use Trim except that it doesn't change this string
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString Strip(stripType w = trailing) const;
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// use Find (more general variants not yet supported)
|
1999-04-12 21:14:46 +00:00
|
|
|
size_t Index(const wxChar* psz) const { return Find(psz); }
|
|
|
|
size_t Index(wxChar ch) const { return Find(ch); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// use Truncate
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& Remove(size_t pos) { return Truncate(pos); }
|
|
|
|
wxString& RemoveLast() { return Truncate(Len() - 1); }
|
|
|
|
|
1998-08-04 16:05:22 +00:00
|
|
|
wxString& Remove(size_t nStart, size_t nLen) { return erase( nStart, nLen ); }
|
1998-07-15 17:10:23 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// use Find()
|
1999-04-12 21:14:46 +00:00
|
|
|
int First( const wxChar ch ) const { return Find(ch); }
|
|
|
|
int First( const wxChar* psz ) const { return Find(psz); }
|
1998-08-04 16:05:22 +00:00
|
|
|
int First( const wxString &str ) const { return Find(str); }
|
1999-04-12 21:14:46 +00:00
|
|
|
int Last( const wxChar ch ) const { return Find(ch, TRUE); }
|
1999-01-14 14:33:56 +00:00
|
|
|
bool Contains(const wxString& str) const { return Find(str) != -1; }
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// use IsEmpty()
|
1998-05-20 14:01:55 +00:00
|
|
|
bool IsNull() const { return IsEmpty(); }
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
#ifdef wxSTD_STRING_COMPATIBILITY
|
|
|
|
// std::string compatibility functions
|
1998-07-15 17:10:23 +00:00
|
|
|
|
1999-06-03 22:46:05 +00:00
|
|
|
// standard types
|
|
|
|
typedef wxChar value_type;
|
|
|
|
typedef const value_type *const_iterator;
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// an 'invalid' value for string index
|
1998-05-20 14:01:55 +00:00
|
|
|
static const size_t npos;
|
1998-07-15 17:10:23 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// constructors
|
|
|
|
// take nLen chars starting at nPos
|
|
|
|
wxString(const wxString& str, size_t nPos, size_t nLen)
|
|
|
|
{
|
|
|
|
wxASSERT( str.GetStringData()->IsValid() );
|
|
|
|
InitWith(str.c_str(), nPos, nLen == npos ? 0 : nLen);
|
|
|
|
}
|
|
|
|
// take all characters from pStart to pEnd
|
|
|
|
wxString(const void *pStart, const void *pEnd);
|
|
|
|
|
|
|
|
// lib.string.capacity
|
|
|
|
// return the length of the string
|
|
|
|
size_t size() const { return Len(); }
|
|
|
|
// return the length of the string
|
|
|
|
size_t length() const { return Len(); }
|
|
|
|
// return the maximum size of the string
|
1999-02-04 17:39:04 +00:00
|
|
|
size_t max_size() const { return wxSTRING_MAXLEN; }
|
1999-01-14 14:33:56 +00:00
|
|
|
// resize the string, filling the space with c if c != 0
|
1999-10-08 14:35:56 +00:00
|
|
|
void resize(size_t nSize, wxChar ch = wxT('\0'));
|
1999-01-14 14:33:56 +00:00
|
|
|
// delete the contents of the string
|
|
|
|
void clear() { Empty(); }
|
|
|
|
// returns true if the string is empty
|
|
|
|
bool empty() const { return IsEmpty(); }
|
|
|
|
|
|
|
|
// lib.string.access
|
|
|
|
// return the character at position n
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar at(size_t n) const { return GetChar(n); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// returns the writable character at position n
|
1999-04-12 21:14:46 +00:00
|
|
|
wxChar& at(size_t n) { return GetWritableChar(n); }
|
1999-01-14 14:33:56 +00:00
|
|
|
|
1999-06-03 22:46:05 +00:00
|
|
|
// first valid index position
|
|
|
|
const_iterator begin() const { return wx_str(); }
|
|
|
|
// position one after the last valid one
|
|
|
|
const_iterator end() const { return wx_str() + length(); }
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// lib.string.modifiers
|
|
|
|
// append a string
|
|
|
|
wxString& append(const wxString& str)
|
|
|
|
{ *this += str; return *this; }
|
|
|
|
// append elements str[pos], ..., str[pos+n]
|
|
|
|
wxString& append(const wxString& str, size_t pos, size_t n)
|
|
|
|
{ ConcatSelf(n, str.c_str() + pos); return *this; }
|
|
|
|
// append first n (or all if n == npos) characters of sz
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& append(const wxChar *sz, size_t n = npos)
|
|
|
|
{ ConcatSelf(n == npos ? wxStrlen(sz) : n, sz); return *this; }
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// append n copies of ch
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& append(size_t n, wxChar ch) { return Pad(n, ch); }
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// same as `this_string = str'
|
|
|
|
wxString& assign(const wxString& str) { return (*this) = str; }
|
|
|
|
// same as ` = str[pos..pos + n]
|
|
|
|
wxString& assign(const wxString& str, size_t pos, size_t n)
|
1999-04-12 21:14:46 +00:00
|
|
|
{ return *this = wxString((const wxChar *)str + pos, n); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// same as `= first n (or all if n == npos) characters of sz'
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& assign(const wxChar *sz, size_t n = npos)
|
1999-01-14 14:33:56 +00:00
|
|
|
{ return *this = wxString(sz, n); }
|
|
|
|
// same as `= n copies of ch'
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& assign(size_t n, wxChar ch)
|
1999-01-14 14:33:56 +00:00
|
|
|
{ return *this = wxString(ch, n); }
|
|
|
|
|
|
|
|
// insert another string
|
|
|
|
wxString& insert(size_t nPos, const wxString& str);
|
|
|
|
// insert n chars of str starting at nStart (in str)
|
|
|
|
wxString& insert(size_t nPos, const wxString& str, size_t nStart, size_t n)
|
1999-04-12 21:14:46 +00:00
|
|
|
{ return insert(nPos, wxString((const wxChar *)str + nStart, n)); }
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// insert first n (or all if n == npos) characters of sz
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& insert(size_t nPos, const wxChar *sz, size_t n = npos)
|
1999-01-14 14:33:56 +00:00
|
|
|
{ return insert(nPos, wxString(sz, n)); }
|
|
|
|
// insert n copies of ch
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& insert(size_t nPos, size_t n, wxChar ch)
|
1999-01-14 14:33:56 +00:00
|
|
|
{ return insert(nPos, wxString(ch, n)); }
|
|
|
|
|
|
|
|
// delete characters from nStart to nStart + nLen
|
|
|
|
wxString& erase(size_t nStart = 0, size_t nLen = npos);
|
|
|
|
|
|
|
|
// replaces the substring of length nLen starting at nStart
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& replace(size_t nStart, size_t nLen, const wxChar* sz);
|
1999-01-14 14:33:56 +00:00
|
|
|
// replaces the substring with nCount copies of ch
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString& replace(size_t nStart, size_t nLen, size_t nCount, wxChar ch);
|
1999-01-14 14:33:56 +00:00
|
|
|
// replaces a substring with another substring
|
|
|
|
wxString& replace(size_t nStart, size_t nLen,
|
|
|
|
const wxString& str, size_t nStart2, size_t nLen2);
|
|
|
|
// replaces the substring with first nCount chars of sz
|
|
|
|
wxString& replace(size_t nStart, size_t nLen,
|
1999-04-12 21:14:46 +00:00
|
|
|
const wxChar* sz, size_t nCount);
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// swap two strings
|
|
|
|
void swap(wxString& str);
|
|
|
|
|
|
|
|
// All find() functions take the nStart argument which specifies the
|
|
|
|
// position to start the search on, the default value is 0. All functions
|
|
|
|
// return npos if there were no match.
|
|
|
|
|
|
|
|
// find a substring
|
|
|
|
size_t find(const wxString& str, size_t nStart = 0) const;
|
|
|
|
|
|
|
|
// VC++ 1.5 can't cope with this syntax.
|
1999-02-03 16:48:12 +00:00
|
|
|
#if !defined(__VISUALC__) || defined(__WIN32__)
|
1999-01-14 14:33:56 +00:00
|
|
|
// find first n characters of sz
|
1999-04-12 21:14:46 +00:00
|
|
|
size_t find(const wxChar* sz, size_t nStart = 0, size_t n = npos) const;
|
1998-05-27 13:56:59 +00:00
|
|
|
#endif
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// Gives a duplicate symbol (presumably a case-insensitivity problem)
|
1998-12-28 12:35:49 +00:00
|
|
|
#if !defined(__BORLANDC__)
|
1999-01-14 14:33:56 +00:00
|
|
|
// find the first occurence of character ch after nStart
|
1999-04-12 21:14:46 +00:00
|
|
|
size_t find(wxChar ch, size_t nStart = 0) const;
|
1998-12-28 12:35:49 +00:00
|
|
|
#endif
|
1999-01-14 14:33:56 +00:00
|
|
|
// rfind() family is exactly like find() but works right to left
|
|
|
|
|
|
|
|
// as find, but from the end
|
|
|
|
size_t rfind(const wxString& str, size_t nStart = npos) const;
|
|
|
|
|
|
|
|
// VC++ 1.5 can't cope with this syntax.
|
1999-02-03 16:48:12 +00:00
|
|
|
#if !defined(__VISUALC__) || defined(__WIN32__)
|
1999-01-14 14:33:56 +00:00
|
|
|
// as find, but from the end
|
1999-04-12 21:14:46 +00:00
|
|
|
size_t rfind(const wxChar* sz, size_t nStart = npos,
|
1999-01-14 14:33:56 +00:00
|
|
|
size_t n = npos) const;
|
|
|
|
// as find, but from the end
|
1999-04-12 21:14:46 +00:00
|
|
|
size_t rfind(wxChar ch, size_t nStart = npos) const;
|
1998-05-20 14:01:55 +00:00
|
|
|
#endif
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// find first/last occurence of any character in the set
|
|
|
|
|
1999-05-17 12:41:28 +00:00
|
|
|
// as strpbrk() but starts at nStart, returns npos if not found
|
|
|
|
size_t find_first_of(const wxString& str, size_t nStart = 0) const
|
|
|
|
{ return find_first_of(str.c_str(), nStart); }
|
|
|
|
// same as above
|
1999-04-12 21:14:46 +00:00
|
|
|
size_t find_first_of(const wxChar* sz, size_t nStart = 0) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
// same as find(char, size_t)
|
1999-05-17 12:41:28 +00:00
|
|
|
size_t find_first_of(wxChar c, size_t nStart = 0) const
|
|
|
|
{ return find(c, nStart); }
|
|
|
|
// find the last (starting from nStart) char from str in this string
|
|
|
|
size_t find_last_of (const wxString& str, size_t nStart = npos) const
|
|
|
|
{ return find_last_of(str.c_str(), nStart); }
|
|
|
|
// same as above
|
|
|
|
size_t find_last_of (const wxChar* sz, size_t nStart = npos) const;
|
|
|
|
// same as above
|
|
|
|
size_t find_last_of(wxChar c, size_t nStart = npos) const
|
|
|
|
{ return rfind(c, nStart); }
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// find first/last occurence of any character not in the set
|
|
|
|
|
1999-05-17 12:41:28 +00:00
|
|
|
// as strspn() (starting from nStart), returns npos on failure
|
|
|
|
size_t find_first_not_of(const wxString& str, size_t nStart = 0) const
|
|
|
|
{ return find_first_not_of(str.c_str(), nStart); }
|
|
|
|
// same as above
|
|
|
|
size_t find_first_not_of(const wxChar* sz, size_t nStart = 0) const;
|
|
|
|
// same as above
|
1999-04-12 21:14:46 +00:00
|
|
|
size_t find_first_not_of(wxChar ch, size_t nStart = 0) const;
|
1999-05-17 12:41:28 +00:00
|
|
|
// as strcspn()
|
1999-01-14 14:33:56 +00:00
|
|
|
size_t find_last_not_of(const wxString& str, size_t nStart=npos) const;
|
1999-05-17 12:41:28 +00:00
|
|
|
// same as above
|
|
|
|
size_t find_last_not_of(const wxChar* sz, size_t nStart = npos) const;
|
|
|
|
// same as above
|
1999-04-12 21:14:46 +00:00
|
|
|
size_t find_last_not_of(wxChar ch, size_t nStart = npos) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// All compare functions return -1, 0 or 1 if the [sub]string is less,
|
|
|
|
// equal or greater than the compare() argument.
|
|
|
|
|
|
|
|
// just like strcmp()
|
|
|
|
int compare(const wxString& str) const { return Cmp(str); }
|
|
|
|
// comparison with a substring
|
|
|
|
int compare(size_t nStart, size_t nLen, const wxString& str) const;
|
|
|
|
// comparison of 2 substrings
|
|
|
|
int compare(size_t nStart, size_t nLen,
|
|
|
|
const wxString& str, size_t nStart2, size_t nLen2) const;
|
|
|
|
// just like strcmp()
|
1999-04-12 21:14:46 +00:00
|
|
|
int compare(const wxChar* sz) const { return Cmp(sz); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// substring comparison with first nCount characters of sz
|
|
|
|
int compare(size_t nStart, size_t nLen,
|
1999-04-12 21:14:46 +00:00
|
|
|
const wxChar* sz, size_t nCount = npos) const;
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// substring extraction
|
|
|
|
wxString substr(size_t nStart = 0, size_t nLen = npos) const;
|
|
|
|
#endif // wxSTD_STRING_COMPATIBILITY
|
1998-05-20 14:01:55 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
1999-01-14 14:33:56 +00:00
|
|
|
// The string array uses it's knowledge of internal structure of the wxString
|
|
|
|
// class to optimize string storage. Normally, we would store pointers to
|
|
|
|
// string, but as wxString is, in fact, itself a pointer (sizeof(wxString) is
|
|
|
|
// sizeof(char *)) we store these pointers instead. The cast to "wxString *" is
|
|
|
|
// really all we need to turn such pointer into a string!
|
|
|
|
//
|
|
|
|
// Of course, it can be called a dirty hack, but we use twice less memory and
|
|
|
|
// this approach is also more speed efficient, so it's probably worth it.
|
|
|
|
//
|
|
|
|
// Usage notes: when a string is added/inserted, a new copy of it is created,
|
|
|
|
// so the original string may be safely deleted. When a string is retrieved
|
|
|
|
// from the array (operator[] or Item() method), a reference is returned.
|
1998-05-20 14:01:55 +00:00
|
|
|
// ----------------------------------------------------------------------------
|
1999-10-04 20:15:38 +00:00
|
|
|
|
1998-09-14 16:37:24 +00:00
|
|
|
class WXDLLEXPORT wxArrayString
|
1998-05-20 14:01:55 +00:00
|
|
|
{
|
|
|
|
public:
|
1999-02-09 16:52:19 +00:00
|
|
|
// type of function used by wxArrayString::Sort()
|
|
|
|
typedef int (*CompareFunction)(const wxString& first,
|
|
|
|
const wxString& second);
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// constructors and destructor
|
1999-10-22 09:24:15 +00:00
|
|
|
// default ctor: if autoSort is TRUE, the array is always sorted (in
|
|
|
|
// alphabetical order)
|
|
|
|
wxArrayString(bool autoSort = FALSE);
|
1999-01-14 14:33:56 +00:00
|
|
|
// copy ctor
|
1998-05-20 14:01:55 +00:00
|
|
|
wxArrayString(const wxArrayString& array);
|
1999-01-14 14:33:56 +00:00
|
|
|
// assignment operator
|
1998-05-20 14:01:55 +00:00
|
|
|
wxArrayString& operator=(const wxArrayString& src);
|
1999-01-14 14:33:56 +00:00
|
|
|
// not virtual, this class should not be derived from
|
1998-05-20 14:01:55 +00:00
|
|
|
~wxArrayString();
|
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
// memory management
|
|
|
|
// empties the list, but doesn't release memory
|
1998-05-20 14:01:55 +00:00
|
|
|
void Empty();
|
1999-01-14 14:33:56 +00:00
|
|
|
// empties the list and releases memory
|
1998-05-20 14:01:55 +00:00
|
|
|
void Clear();
|
1999-01-14 14:33:56 +00:00
|
|
|
// preallocates memory for given number of items
|
1998-05-20 14:01:55 +00:00
|
|
|
void Alloc(size_t nCount);
|
1999-01-14 14:33:56 +00:00
|
|
|
// minimzes the memory usage (by freeing all extra memory)
|
1998-07-15 17:10:23 +00:00
|
|
|
void Shrink();
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// simple accessors
|
|
|
|
// number of elements in the array
|
|
|
|
size_t GetCount() const { return m_nCount; }
|
|
|
|
// is it empty?
|
|
|
|
bool IsEmpty() const { return m_nCount == 0; }
|
|
|
|
// number of elements in the array (GetCount is preferred API)
|
|
|
|
size_t Count() const { return m_nCount; }
|
|
|
|
|
|
|
|
// items access (range checking is done in debug version)
|
|
|
|
// get item at position uiIndex
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& Item(size_t nIndex) const
|
|
|
|
{ wxASSERT( nIndex < m_nCount ); return *(wxString *)&(m_pItems[nIndex]); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// same as Item()
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& operator[](size_t nIndex) const { return Item(nIndex); }
|
1999-01-14 14:33:56 +00:00
|
|
|
// get last item
|
1998-05-20 14:01:55 +00:00
|
|
|
wxString& Last() const { wxASSERT( !IsEmpty() ); return Item(Count() - 1); }
|
1999-01-14 14:33:56 +00:00
|
|
|
|
|
|
|
// item management
|
|
|
|
// Search the element in the array, starting from the beginning if
|
|
|
|
// bFromEnd is FALSE or from end otherwise. If bCase, comparison is case
|
|
|
|
// sensitive (default). Returns index of the first item matched or
|
|
|
|
// wxNOT_FOUND
|
1999-04-12 21:14:46 +00:00
|
|
|
int Index (const wxChar *sz, bool bCase = TRUE, bool bFromEnd = FALSE) const;
|
1999-10-22 13:12:04 +00:00
|
|
|
// add new element at the end (if the array is not sorted), return its
|
|
|
|
// index
|
|
|
|
size_t Add(const wxString& str);
|
1999-01-14 14:33:56 +00:00
|
|
|
// add new element at given position
|
1998-08-18 15:36:12 +00:00
|
|
|
void Insert(const wxString& str, size_t uiIndex);
|
1999-01-14 14:33:56 +00:00
|
|
|
// remove first item matching this value
|
1999-04-12 21:14:46 +00:00
|
|
|
void Remove(const wxChar *sz);
|
1999-01-14 14:33:56 +00:00
|
|
|
// remove item by index
|
1998-05-20 14:01:55 +00:00
|
|
|
void Remove(size_t nIndex);
|
|
|
|
|
1999-02-09 16:52:19 +00:00
|
|
|
// sorting
|
|
|
|
// sort array elements in alphabetical order (or reversed alphabetical
|
|
|
|
// order if reverseOrder parameter is TRUE)
|
|
|
|
void Sort(bool reverseOrder = FALSE);
|
|
|
|
// sort array elements using specified comparaison function
|
|
|
|
void Sort(CompareFunction compareFunction);
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-10-22 09:24:15 +00:00
|
|
|
protected:
|
|
|
|
void Copy(const wxArrayString& src); // copies the contents of another array
|
|
|
|
|
1998-05-20 14:01:55 +00:00
|
|
|
private:
|
1999-10-22 09:24:15 +00:00
|
|
|
void Grow(); // makes array bigger if needed
|
|
|
|
void Free(); // free all the strings stored
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-10-22 09:24:15 +00:00
|
|
|
void DoSort(); // common part of all Sort() variants
|
1999-02-09 16:52:19 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
size_t m_nSize, // current size of the array
|
1998-05-20 14:01:55 +00:00
|
|
|
m_nCount; // current number of elements
|
|
|
|
|
1999-10-22 09:24:15 +00:00
|
|
|
wxChar **m_pItems; // pointer to data
|
|
|
|
|
|
|
|
bool m_autoSort; // if TRUE, keep the array always sorted
|
|
|
|
};
|
|
|
|
|
|
|
|
class WXDLLEXPORT wxSortedArrayString : public wxArrayString
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
wxSortedArrayString() : wxArrayString(TRUE)
|
|
|
|
{ }
|
|
|
|
wxSortedArrayString(const wxArrayString& array) : wxArrayString(TRUE)
|
|
|
|
{ Copy(array); }
|
1998-05-20 14:01:55 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
// ---------------------------------------------------------------------------
|
1999-01-14 14:33:56 +00:00
|
|
|
// wxString comparison functions: operator versions are always case sensitive
|
1998-05-20 14:01:55 +00:00
|
|
|
// ---------------------------------------------------------------------------
|
1999-06-15 22:30:44 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-01-16 00:13:58 +00:00
|
|
|
inline bool operator==(const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) == 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator==(const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) == 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator==(const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) == 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-01-16 00:13:58 +00:00
|
|
|
inline bool operator!=(const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) != 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator!=(const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) != 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator!=(const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) != 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-01-16 00:13:58 +00:00
|
|
|
inline bool operator< (const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) < 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator< (const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) < 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator< (const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) > 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-01-16 00:13:58 +00:00
|
|
|
inline bool operator> (const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) > 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator> (const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) > 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator> (const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) < 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-01-16 00:13:58 +00:00
|
|
|
inline bool operator<=(const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) <= 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator<=(const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) <= 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator<=(const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) >= 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-01-16 00:13:58 +00:00
|
|
|
inline bool operator>=(const wxString& s1, const wxString& s2) { return (s1.Cmp(s2) >= 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator>=(const wxString& s1, const wxChar * s2) { return (s1.Cmp(s2) >= 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
//
|
1999-04-12 21:14:46 +00:00
|
|
|
inline bool operator>=(const wxChar * s1, const wxString& s2) { return (s2.Cmp(s1) <= 0); }
|
1999-01-14 14:33:56 +00:00
|
|
|
|
1999-06-15 22:30:44 +00:00
|
|
|
// comparison with char
|
|
|
|
inline bool operator==(wxChar c, const wxString& s) { return s.IsSameAs(c); }
|
|
|
|
inline bool operator==(const wxString& s, wxChar c) { return s.IsSameAs(c); }
|
|
|
|
inline bool operator!=(wxChar c, const wxString& s) { return !s.IsSameAs(c); }
|
|
|
|
inline bool operator!=(const wxString& s, wxChar c) { return !s.IsSameAs(c); }
|
|
|
|
|
1999-06-14 14:23:18 +00:00
|
|
|
#if wxUSE_UNICODE
|
|
|
|
inline bool operator==(const wxString& s1, const wxWCharBuffer& s2)
|
1999-06-15 22:30:44 +00:00
|
|
|
{ return (s1.Cmp((const wchar_t *)s2) == 0); }
|
1999-06-14 14:23:18 +00:00
|
|
|
inline bool operator==(const wxWCharBuffer& s1, const wxString& s2)
|
1999-06-15 22:30:44 +00:00
|
|
|
{ return (s2.Cmp((const wchar_t *)s1) == 0); }
|
1999-06-14 14:23:18 +00:00
|
|
|
#else
|
|
|
|
inline bool operator==(const wxString& s1, const wxCharBuffer& s2)
|
1999-06-15 22:30:44 +00:00
|
|
|
{ return (s1.Cmp((const char *)s2) == 0); }
|
1999-06-14 14:23:18 +00:00
|
|
|
inline bool operator==(const wxCharBuffer& s1, const wxString& s2)
|
1999-06-15 22:30:44 +00:00
|
|
|
{ return (s2.Cmp((const char *)s1) == 0); }
|
1999-06-14 14:23:18 +00:00
|
|
|
#endif
|
|
|
|
|
1998-11-06 09:45:23 +00:00
|
|
|
wxString WXDLLEXPORT operator+(const wxString& string1, const wxString& string2);
|
1999-04-12 21:14:46 +00:00
|
|
|
wxString WXDLLEXPORT operator+(const wxString& string, wxChar ch);
|
|
|
|
wxString WXDLLEXPORT operator+(wxChar ch, const wxString& string);
|
|
|
|
wxString WXDLLEXPORT operator+(const wxString& string, const wxChar *psz);
|
|
|
|
wxString WXDLLEXPORT operator+(const wxChar *psz, const wxString& string);
|
1999-04-16 12:24:26 +00:00
|
|
|
#if wxUSE_UNICODE
|
1999-04-16 18:27:29 +00:00
|
|
|
inline wxString WXDLLEXPORT operator+(const wxString& string, const wxWCharBuffer& buf)
|
1999-10-04 20:15:38 +00:00
|
|
|
{ return string + (const wchar_t *)buf; }
|
1999-04-16 18:27:29 +00:00
|
|
|
inline wxString WXDLLEXPORT operator+(const wxWCharBuffer& buf, const wxString& string)
|
1999-10-04 20:15:38 +00:00
|
|
|
{ return (const wchar_t *)buf + string; }
|
1999-04-16 12:24:26 +00:00
|
|
|
#else
|
1999-04-16 18:27:29 +00:00
|
|
|
inline wxString WXDLLEXPORT operator+(const wxString& string, const wxCharBuffer& buf)
|
1999-10-04 20:15:38 +00:00
|
|
|
{ return string + (const char *)buf; }
|
1999-04-16 18:27:29 +00:00
|
|
|
inline wxString WXDLLEXPORT operator+(const wxCharBuffer& buf, const wxString& string)
|
1999-10-04 20:15:38 +00:00
|
|
|
{ return (const char *)buf + string; }
|
1999-04-16 12:24:26 +00:00
|
|
|
#endif
|
1998-07-12 22:40:00 +00:00
|
|
|
|
1998-05-20 14:01:55 +00:00
|
|
|
// ---------------------------------------------------------------------------
|
1999-01-14 14:33:56 +00:00
|
|
|
// Implementation only from here until the end of file
|
1998-05-20 14:01:55 +00:00
|
|
|
// ---------------------------------------------------------------------------
|
|
|
|
|
1999-10-04 20:15:38 +00:00
|
|
|
// don't pollute the library user's name space
|
|
|
|
#undef ASSERT_VALID_INDEX
|
|
|
|
|
1999-06-27 10:39:38 +00:00
|
|
|
#if defined(wxSTD_STRING_COMPATIBILITY) && wxUSE_STD_IOSTREAM
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-02-03 16:48:12 +00:00
|
|
|
#include "wx/ioswrap.h"
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-10-29 15:11:25 +00:00
|
|
|
WXDLLEXPORT istream& operator>>(istream&, wxString&);
|
|
|
|
WXDLLEXPORT ostream& operator<<(ostream&, const wxString&);
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1999-01-14 14:33:56 +00:00
|
|
|
#endif // wxSTD_STRING_COMPATIBILITY
|
1998-05-20 14:01:55 +00:00
|
|
|
|
1998-08-15 00:23:28 +00:00
|
|
|
#endif // _WX_WXSTRINGH__
|