]> git.saurik.com Git - wxWidgets.git/blame - src/common/regex.cpp
Reorganize wxCollapsiblePane event and layout code under GTK+
[wxWidgets.git] / src / common / regex.cpp
CommitLineData
e7208277
VZ
1///////////////////////////////////////////////////////////////////////////////
2// Name: src/common/regex.cpp
3// Purpose: regular expression matching
9d55bfef 4// Author: Karsten Ballueder and Vadim Zeitlin
e7208277
VZ
5// Modified by:
6// Created: 13.07.01
7// RCS-ID: $Id$
9d55bfef 8// Copyright: (c) 2000 Karsten Ballueder <ballueder@gmx.net>
e7208277 9// 2001 Vadim Zeitlin <vadim@wxwindows.org>
65571936 10// Licence: wxWindows licence
e7208277
VZ
11///////////////////////////////////////////////////////////////////////////////
12
13// ============================================================================
14// declarations
15// ============================================================================
16
17// ----------------------------------------------------------------------------
18// headers
19// ----------------------------------------------------------------------------
20
e7208277
VZ
21// For compilers that support precompilation, includes "wx.h".
22#include "wx/wxprec.h"
23
24#ifdef __BORLANDC__
25 #pragma hdrstop
26#endif
27
28#if wxUSE_REGEX
29
9d77a075
PC
30#include "wx/regex.h"
31
e7208277
VZ
32#ifndef WX_PRECOMP
33 #include "wx/object.h"
e7208277
VZ
34 #include "wx/log.h"
35 #include "wx/intl.h"
0bf751e7 36 #include "wx/crt.h"
e7208277
VZ
37#endif //WX_PRECOMP
38
04fdd873
DS
39// FreeBSD, Watcom and DMars require this, CW doesn't have nor need it.
40// Others also don't seem to need it. If you have an error related to
41// (not) including <sys/types.h> please report details to
42// wx-dev@lists.wxwindows.org
4ded51f2 43#if defined(__UNIX__) || defined(__WATCOMC__) || defined(__DIGITALMARS__)
04fdd873 44# include <sys/types.h>
0f2ecc91
VZ
45#endif
46
e7208277 47#include <regex.h>
e7208277 48
7553e636
MW
49// WXREGEX_USING_BUILTIN defined when using the built-in regex lib
50// WXREGEX_USING_RE_SEARCH defined when using re_search in the GNU regex lib
51// WXREGEX_IF_NEED_LEN() wrap the len parameter only used with the built-in
52// or GNU regex
53// WXREGEX_CONVERT_TO_MB defined when the regex lib is using chars and
54// wxChar is wide, so conversion must be done
55// WXREGEX_CHAR(x) Convert wxChar to wxRegChar
ab0f0edd 56//
c9eee7f0
MW
57#ifdef __REG_NOFRONT
58# define WXREGEX_USING_BUILTIN
ab0f0edd 59# define WXREGEX_IF_NEED_LEN(x) ,x
52de37c7 60# if wxUSE_UNICODE
bcbb0248 61# define WXREGEX_CHAR(x) (x).wc_str()
52de37c7 62# else
bcbb0248 63# define WXREGEX_CHAR(x) (x).mb_str()
52de37c7 64# endif
c9eee7f0 65#else
ab0f0edd
MW
66# ifdef HAVE_RE_SEARCH
67# define WXREGEX_IF_NEED_LEN(x) ,x
7553e636 68# define WXREGEX_USING_RE_SEARCH
2cdf2445 69# else
ab0f0edd
MW
70# define WXREGEX_IF_NEED_LEN(x)
71# endif
c9eee7f0
MW
72# if wxUSE_UNICODE
73# define WXREGEX_CONVERT_TO_MB
74# endif
bcbb0248 75# define WXREGEX_CHAR(x) (x).mb_str()
7553e636
MW
76# define wx_regfree regfree
77# define wx_regerror regerror
f302b6a4
MW
78#endif
79
e7208277
VZ
80// ----------------------------------------------------------------------------
81// private classes
82// ----------------------------------------------------------------------------
83
7553e636 84#ifndef WXREGEX_USING_RE_SEARCH
ab0f0edd
MW
85
86// the array of offsets for the matches, the usual POSIX regmatch_t array.
87class wxRegExMatches
88{
89public:
90 typedef regmatch_t *match_type;
91
2cdf2445 92 wxRegExMatches(size_t n) { m_matches = new regmatch_t[n]; }
ab0f0edd
MW
93 ~wxRegExMatches() { delete [] m_matches; }
94
2cdf2445
VZ
95 // we just use casts here because the fields of regmatch_t struct may be 64
96 // bit but we're limited to size_t in our public API and are not going to
97 // change it because operating on strings longer than 4GB using it is
9630cac5 98 // absolutely impractical anyhow
2cdf2445
VZ
99 size_t Start(size_t n) const
100 {
2cdf2445
VZ
101 return wx_truncate_cast(size_t, m_matches[n].rm_so);
102 }
103
104 size_t End(size_t n) const
105 {
2cdf2445
VZ
106 return wx_truncate_cast(size_t, m_matches[n].rm_eo);
107 }
ab0f0edd
MW
108
109 regmatch_t *get() const { return m_matches; }
110
111private:
112 regmatch_t *m_matches;
113};
114
7553e636 115#else // WXREGEX_USING_RE_SEARCH
ab0f0edd
MW
116
117// the array of offsets for the matches, the struct used by the GNU lib
118class wxRegExMatches
119{
120public:
121 typedef re_registers *match_type;
122
123 wxRegExMatches(size_t n)
124 {
125 m_matches.num_regs = n;
126 m_matches.start = new regoff_t[n];
127 m_matches.end = new regoff_t[n];
128 }
129
130 ~wxRegExMatches()
131 {
132 delete [] m_matches.start;
133 delete [] m_matches.end;
134 }
135
136 size_t Start(size_t n) const { return m_matches.start[n]; }
137 size_t End(size_t n) const { return m_matches.end[n]; }
138
139 re_registers *get() { return &m_matches; }
140
141private:
142 re_registers m_matches;
143};
144
7553e636 145#endif // WXREGEX_USING_RE_SEARCH
ab0f0edd 146
f302b6a4 147// the character type used by the regular expression engine
db9db9cd 148#ifndef WXREGEX_CONVERT_TO_MB
f302b6a4
MW
149typedef wxChar wxRegChar;
150#else
151typedef char wxRegChar;
152#endif
153
e7208277
VZ
154// the real implementation of wxRegEx
155class wxRegExImpl
156{
157public:
158 // ctor and dtor
159 wxRegExImpl();
160 ~wxRegExImpl();
161
701a0b47 162 // return true if Compile() had been called successfully
e7208277
VZ
163 bool IsValid() const { return m_isCompiled; }
164
165 // RE operations
765624f7 166 bool Compile(const wxString& expr, int flags = 0);
c9eee7f0 167 bool Matches(const wxRegChar *str, int flags
ab0f0edd 168 WXREGEX_IF_NEED_LEN(size_t len)) const;
765624f7 169 bool GetMatch(size_t *start, size_t *len, size_t index = 0) const;
86b79b93 170 size_t GetMatchCount() const;
765624f7
VZ
171 int Replace(wxString *pattern, const wxString& replacement,
172 size_t maxMatches = 0) const;
e7208277
VZ
173
174private:
175 // return the string containing the error message for the given err code
e3f9e20c 176 wxString GetErrorMsg(int errorcode, bool badconv) const;
e7208277 177
a9103a81
VZ
178 // init the members
179 void Init()
180 {
701a0b47 181 m_isCompiled = false;
a9103a81
VZ
182 m_Matches = NULL;
183 m_nMatches = 0;
184 }
185
e7208277
VZ
186 // free the RE if compiled
187 void Free()
188 {
189 if ( IsValid() )
190 {
7553e636 191 wx_regfree(&m_RegEx);
e7208277 192 }
a9103a81 193
ab0f0edd 194 delete m_Matches;
e7208277
VZ
195 }
196
a9103a81
VZ
197 // free the RE if any and reinit the members
198 void Reinit()
199 {
200 Free();
201 Init();
202 }
203
e7208277 204 // compiled RE
ab0f0edd 205 regex_t m_RegEx;
e7208277
VZ
206
207 // the subexpressions data
ab0f0edd
MW
208 wxRegExMatches *m_Matches;
209 size_t m_nMatches;
e7208277 210
701a0b47 211 // true if m_RegEx is valid
ab0f0edd 212 bool m_isCompiled;
e7208277
VZ
213};
214
ab0f0edd 215
e7208277
VZ
216// ============================================================================
217// implementation
218// ============================================================================
219
220// ----------------------------------------------------------------------------
221// wxRegExImpl
222// ----------------------------------------------------------------------------
223
224wxRegExImpl::wxRegExImpl()
225{
a9103a81 226 Init();
e7208277
VZ
227}
228
229wxRegExImpl::~wxRegExImpl()
230{
231 Free();
e7208277
VZ
232}
233
e3f9e20c 234wxString wxRegExImpl::GetErrorMsg(int errorcode, bool badconv) const
e7208277 235{
db9db9cd 236#ifdef WXREGEX_CONVERT_TO_MB
e3f9e20c
VS
237 // currently only needed when using system library in Unicode mode
238 if ( badconv )
239 {
240 return _("conversion to 8-bit encoding failed");
241 }
242#else
243 // 'use' badconv to avoid a compiler warning
244 (void)badconv;
245#endif
246
c5feba0e 247 wxString szError;
e7208277
VZ
248
249 // first get the string length needed
7553e636 250 int len = wx_regerror(errorcode, &m_RegEx, NULL, 0);
e7208277
VZ
251 if ( len > 0 )
252 {
c5feba0e 253 char* szcmbError = new char[++len];
e7208277 254
7553e636 255 (void)wx_regerror(errorcode, &m_RegEx, szcmbError, len);
9aee09a3 256
6d50049a 257 szError = wxConvLibc.cMB2WX(szcmbError);
c5feba0e 258 delete [] szcmbError;
e7208277
VZ
259 }
260 else // regerror() returned 0
261 {
c5feba0e 262 szError = _("unknown error");
e7208277
VZ
263 }
264
c5feba0e 265 return szError;
e7208277
VZ
266}
267
268bool wxRegExImpl::Compile(const wxString& expr, int flags)
269{
a9103a81 270 Reinit();
e7208277 271
e3f9e20c
VS
272#ifdef WX_NO_REGEX_ADVANCED
273# define FLAVORS wxRE_BASIC
274#else
275# define FLAVORS (wxRE_ADVANCED | wxRE_BASIC)
276 wxASSERT_MSG( (flags & FLAVORS) != FLAVORS,
277 _T("incompatible flags in wxRegEx::Compile") );
278#endif
279 wxASSERT_MSG( !(flags & ~(FLAVORS | wxRE_ICASE | wxRE_NOSUB | wxRE_NEWLINE)),
e7208277
VZ
280 _T("unrecognized flags in wxRegEx::Compile") );
281
e3f9e20c 282 // translate our flags to regcomp() ones
e7208277
VZ
283 int flagsRE = 0;
284 if ( !(flags & wxRE_BASIC) )
2a230426 285 {
e3f9e20c
VS
286#ifndef WX_NO_REGEX_ADVANCED
287 if (flags & wxRE_ADVANCED)
288 flagsRE |= REG_ADVANCED;
289 else
290#endif
291 flagsRE |= REG_EXTENDED;
2a230426 292 }
e7208277
VZ
293 if ( flags & wxRE_ICASE )
294 flagsRE |= REG_ICASE;
295 if ( flags & wxRE_NOSUB )
296 flagsRE |= REG_NOSUB;
297 if ( flags & wxRE_NEWLINE )
298 flagsRE |= REG_NEWLINE;
299
e3f9e20c 300 // compile it
c9eee7f0 301#ifdef WXREGEX_USING_BUILTIN
e3f9e20c 302 bool conv = true;
52de37c7
VS
303 // FIXME-UTF8: use wc_str() after removing ANSI build
304 int errorcode = wx_re_comp(&m_RegEx, expr.c_str(), expr.length(), flagsRE);
e3f9e20c 305#else
52de37c7
VS
306 // FIXME-UTF8: this is potentially broken, we shouldn't even try it
307 // and should always use builtin regex library (or PCRE?)
e3f9e20c
VS
308 const wxWX2MBbuf conv = expr.mbc_str();
309 int errorcode = conv ? regcomp(&m_RegEx, conv, flagsRE) : REG_BADPAT;
310#endif
49bf0b01 311
e3f9e20c 312 if ( errorcode )
e7208277
VZ
313 {
314 wxLogError(_("Invalid regular expression '%s': %s"),
e3f9e20c 315 expr.c_str(), GetErrorMsg(errorcode, !conv).c_str());
e7208277 316
701a0b47 317 m_isCompiled = false;
e7208277
VZ
318 }
319 else // ok
320 {
321 // don't allocate the matches array now, but do it later if necessary
322 if ( flags & wxRE_NOSUB )
323 {
324 // we don't need it at all
325 m_nMatches = 0;
326 }
327 else
328 {
59078e62
VZ
329 // we will alloc the array later (only if really needed) but count
330 // the number of sub-expressions in the regex right now
331
332 // there is always one for the whole expression
333 m_nMatches = 1;
334
335 // and some more for bracketed subexperessions
71b5725f 336 for ( const wxChar *cptr = expr.c_str(); *cptr; cptr++ )
59078e62 337 {
71b5725f 338 if ( *cptr == _T('\\') )
59078e62 339 {
71b5725f
VZ
340 // in basic RE syntax groups are inside \(...\)
341 if ( *++cptr == _T('(') && (flags & wxRE_BASIC) )
342 {
343 m_nMatches++;
344 }
345 }
346 else if ( *cptr == _T('(') && !(flags & wxRE_BASIC) )
347 {
348 // we know that the previous character is not an unquoted
349 // backslash because it would have been eaten above, so we
86b79b93
VS
350 // have a bare '(' and this indicates a group start for the
351 // extended syntax. '(?' is used for extensions by perl-
352 // like REs (e.g. advanced), and is not valid for POSIX
353 // extended, so ignore them always.
354 if ( cptr[1] != _T('?') )
355 m_nMatches++;
59078e62 356 }
59078e62 357 }
e7208277
VZ
358 }
359
701a0b47 360 m_isCompiled = true;
e7208277
VZ
361 }
362
363 return IsValid();
364}
365
7553e636 366#ifdef WXREGEX_USING_RE_SEARCH
ab0f0edd
MW
367
368// On GNU, regexec is implemented as a wrapper around re_search. re_search
369// requires a length parameter which the POSIX regexec does not have,
370// therefore regexec must do a strlen on the search text each time it is
371// called. This can drastically affect performance when matching is done in
372// a loop along a string, such as during a search and replace. Therefore if
373// re_search is detected by configure, it is used directly.
374//
375static int ReSearch(const regex_t *preg,
376 const char *text,
377 size_t len,
378 re_registers *matches,
379 int eflags)
380{
5c33522f 381 regex_t *pattern = const_cast<regex_t*>(preg);
ab0f0edd
MW
382
383 pattern->not_bol = (eflags & REG_NOTBOL) != 0;
384 pattern->not_eol = (eflags & REG_NOTEOL) != 0;
385 pattern->regs_allocated = REGS_FIXED;
386
387 int ret = re_search(pattern, text, len, 0, len, matches);
388 return ret >= 0 ? 0 : REG_NOMATCH;
389}
390
7553e636 391#endif // WXREGEX_USING_RE_SEARCH
ab0f0edd 392
c9eee7f0
MW
393bool wxRegExImpl::Matches(const wxRegChar *str,
394 int flags
ab0f0edd 395 WXREGEX_IF_NEED_LEN(size_t len)) const
e7208277 396{
701a0b47 397 wxCHECK_MSG( IsValid(), false, _T("must successfully Compile() first") );
e7208277
VZ
398
399 // translate our flags to regexec() ones
400 wxASSERT_MSG( !(flags & ~(wxRE_NOTBOL | wxRE_NOTEOL)),
401 _T("unrecognized flags in wxRegEx::Matches") );
402
403 int flagsRE = 0;
404 if ( flags & wxRE_NOTBOL )
405 flagsRE |= REG_NOTBOL;
406 if ( flags & wxRE_NOTEOL )
407 flagsRE |= REG_NOTEOL;
408
409 // allocate matches array if needed
410 wxRegExImpl *self = wxConstCast(this, wxRegExImpl);
411 if ( !m_Matches && m_nMatches )
412 {
ab0f0edd 413 self->m_Matches = new wxRegExMatches(m_nMatches);
e7208277
VZ
414 }
415
ab0f0edd
MW
416 wxRegExMatches::match_type matches = m_Matches ? m_Matches->get() : NULL;
417
e7208277 418 // do match it
ab0f0edd
MW
419#if defined WXREGEX_USING_BUILTIN
420 int rc = wx_re_exec(&self->m_RegEx, str, len, NULL, m_nMatches, matches, flagsRE);
7553e636 421#elif defined WXREGEX_USING_RE_SEARCH
ab0f0edd 422 int rc = str ? ReSearch(&self->m_RegEx, str, len, matches, flagsRE) : REG_BADPAT;
e3f9e20c 423#else
ab0f0edd 424 int rc = str ? regexec(&self->m_RegEx, str, m_nMatches, matches, flagsRE) : REG_BADPAT;
e3f9e20c 425#endif
e7208277
VZ
426
427 switch ( rc )
428 {
429 case 0:
430 // matched successfully
701a0b47 431 return true;
e7208277
VZ
432
433 default:
3103e8a9 434 // an error occurred
f302b6a4
MW
435 wxLogError(_("Failed to find match for regular expression: %s"),
436 GetErrorMsg(rc, !str).c_str());
e7208277
VZ
437 // fall through
438
439 case REG_NOMATCH:
440 // no match
701a0b47 441 return false;
e7208277
VZ
442 }
443}
444
445bool wxRegExImpl::GetMatch(size_t *start, size_t *len, size_t index) const
446{
701a0b47
WS
447 wxCHECK_MSG( IsValid(), false, _T("must successfully Compile() first") );
448 wxCHECK_MSG( m_nMatches, false, _T("can't use with wxRE_NOSUB") );
449 wxCHECK_MSG( m_Matches, false, _T("must call Matches() first") );
450 wxCHECK_MSG( index < m_nMatches, false, _T("invalid match index") );
e7208277 451
e7208277 452 if ( start )
ab0f0edd 453 *start = m_Matches->Start(index);
e7208277 454 if ( len )
ab0f0edd 455 *len = m_Matches->End(index) - m_Matches->Start(index);
e7208277 456
701a0b47 457 return true;
e7208277
VZ
458}
459
86b79b93
VS
460size_t wxRegExImpl::GetMatchCount() const
461{
462 wxCHECK_MSG( IsValid(), 0, _T("must successfully Compile() first") );
463 wxCHECK_MSG( m_nMatches, 0, _T("can't use with wxRE_NOSUB") );
464
465 return m_nMatches;
466}
467
765624f7
VZ
468int wxRegExImpl::Replace(wxString *text,
469 const wxString& replacement,
470 size_t maxMatches) const
e7208277 471{
701a0b47
WS
472 wxCHECK_MSG( text, wxNOT_FOUND, _T("NULL text in wxRegEx::Replace") );
473 wxCHECK_MSG( IsValid(), wxNOT_FOUND, _T("must successfully Compile() first") );
e7208277 474
f302b6a4 475 // the input string
db9db9cd 476#ifndef WXREGEX_CONVERT_TO_MB
f302b6a4
MW
477 const wxChar *textstr = text->c_str();
478 size_t textlen = text->length();
479#else
ab0f0edd 480 const wxWX2MBbuf textstr = WXREGEX_CHAR(*text);
f302b6a4
MW
481 if (!textstr)
482 {
483 wxLogError(_("Failed to find match for regular expression: %s"),
484 GetErrorMsg(0, true).c_str());
485 return 0;
486 }
487 size_t textlen = strlen(textstr);
488 text->clear();
489#endif
490
765624f7
VZ
491 // the replacement text
492 wxString textNew;
e7208277 493
f302b6a4
MW
494 // the result, allow 25% extra
495 wxString result;
496 result.reserve(5 * textlen / 4);
497
765624f7
VZ
498 // attempt at optimization: don't iterate over the string if it doesn't
499 // contain back references at all
500 bool mayHaveBackrefs =
501 replacement.find_first_of(_T("\\&")) != wxString::npos;
e7208277 502
765624f7 503 if ( !mayHaveBackrefs )
e7208277 504 {
765624f7 505 textNew = replacement;
e7208277 506 }
765624f7
VZ
507
508 // the position where we start looking for the match
765624f7
VZ
509 size_t matchStart = 0;
510
511 // number of replacement made: we won't make more than maxMatches of them
512 // (unless maxMatches is 0 which doesn't limit the number of replacements)
513 size_t countRepl = 0;
514
515 // note that "^" shouldn't match after the first call to Matches() so we
516 // use wxRE_NOTBOL to prevent it from happening
517 while ( (!maxMatches || countRepl < maxMatches) &&
0d79a679 518 Matches(
7e1df0e6 519#ifndef WXREGEX_CONVERT_TO_MB
0d79a679 520 textstr + matchStart,
7e1df0e6 521#else
0d79a679 522 textstr.data() + matchStart,
7e1df0e6 523#endif
c9eee7f0 524 countRepl ? wxRE_NOTBOL : 0
ab0f0edd 525 WXREGEX_IF_NEED_LEN(textlen - matchStart)) )
765624f7
VZ
526 {
527 // the string possibly contains back references: we need to calculate
528 // the replacement text anew after each match
529 if ( mayHaveBackrefs )
530 {
701a0b47 531 mayHaveBackrefs = false;
765624f7
VZ
532 textNew.clear();
533 textNew.reserve(replacement.length());
534
535 for ( const wxChar *p = replacement.c_str(); *p; p++ )
536 {
537 size_t index = (size_t)-1;
538
539 if ( *p == _T('\\') )
540 {
541 if ( wxIsdigit(*++p) )
542 {
543 // back reference
544 wxChar *end;
545 index = (size_t)wxStrtoul(p, &end, 10);
546 p = end - 1; // -1 to compensate for p++ in the loop
547 }
548 //else: backslash used as escape character
549 }
550 else if ( *p == _T('&') )
551 {
552 // treat this as "\0" for compatbility with ed and such
553 index = 0;
554 }
555
556 // do we have a back reference?
557 if ( index != (size_t)-1 )
558 {
559 // yes, get its text
560 size_t start, len;
561 if ( !GetMatch(&start, &len, index) )
562 {
59078e62 563 wxFAIL_MSG( _T("invalid back reference") );
765624f7
VZ
564
565 // just eat it...
566 }
567 else
568 {
7e1df0e6 569#ifndef WXREGEX_CONVERT_TO_MB
f302b6a4 570 textNew += wxString(textstr + matchStart + start,
7e1df0e6
VS
571#else
572 textNew += wxString(textstr.data() + matchStart +
573 start,
574#endif
f302b6a4 575 *wxConvCurrent, len);
765624f7 576
701a0b47 577 mayHaveBackrefs = true;
765624f7
VZ
578 }
579 }
580 else // ordinary character
581 {
582 textNew += *p;
583 }
584 }
585 }
586
587 size_t start, len;
588 if ( !GetMatch(&start, &len) )
589 {
590 // we did have match as Matches() returned true above!
591 wxFAIL_MSG( _T("internal logic error in wxRegEx::Replace") );
592
701a0b47 593 return wxNOT_FOUND;
765624f7
VZ
594 }
595
f302b6a4
MW
596 // an insurance against implementations that don't grow exponentially
597 // to ensure building the result takes linear time
598 if (result.capacity() < result.length() + start + textNew.length())
599 result.reserve(2 * result.length());
600
db9db9cd 601#ifndef WXREGEX_CONVERT_TO_MB
f302b6a4
MW
602 result.append(*text, matchStart, start);
603#else
7e1df0e6
VS
604 result.append(wxString(textstr.data() + matchStart, *wxConvCurrent,
605 start));
f302b6a4 606#endif
765624f7 607 matchStart += start;
f302b6a4 608 result.append(textNew);
765624f7
VZ
609
610 countRepl++;
611
f302b6a4 612 matchStart += len;
765624f7
VZ
613 }
614
db9db9cd 615#ifndef WXREGEX_CONVERT_TO_MB
f302b6a4
MW
616 result.append(*text, matchStart, wxString::npos);
617#else
7e1df0e6 618 result.append(wxString(textstr.data() + matchStart, *wxConvCurrent));
f302b6a4
MW
619#endif
620 *text = result;
621
765624f7 622 return countRepl;
e7208277
VZ
623}
624
625// ----------------------------------------------------------------------------
626// wxRegEx: all methods are mostly forwarded to wxRegExImpl
627// ----------------------------------------------------------------------------
628
629void wxRegEx::Init()
630{
631 m_impl = NULL;
632}
633
e7208277
VZ
634wxRegEx::~wxRegEx()
635{
636 delete m_impl;
637}
638
639bool wxRegEx::Compile(const wxString& expr, int flags)
640{
641 if ( !m_impl )
642 {
643 m_impl = new wxRegExImpl;
644 }
645
646 if ( !m_impl->Compile(expr, flags) )
647 {
648 // error message already given in wxRegExImpl::Compile
649 delete m_impl;
650 m_impl = NULL;
651
701a0b47 652 return false;
e7208277
VZ
653 }
654
701a0b47 655 return true;
e7208277
VZ
656}
657
63465885 658bool wxRegEx::Matches(const wxString& str, int flags) const
c9eee7f0
MW
659{
660 wxCHECK_MSG( IsValid(), false, _T("must successfully Compile() first") );
c9eee7f0 661
63465885
VZ
662 return m_impl->Matches(WXREGEX_CHAR(str), flags
663 WXREGEX_IF_NEED_LEN(str.length()));
e7208277
VZ
664}
665
666bool wxRegEx::GetMatch(size_t *start, size_t *len, size_t index) const
667{
701a0b47 668 wxCHECK_MSG( IsValid(), false, _T("must successfully Compile() first") );
e7208277
VZ
669
670 return m_impl->GetMatch(start, len, index);
671}
672
00e6c2bd
VZ
673wxString wxRegEx::GetMatch(const wxString& text, size_t index) const
674{
675 size_t start, len;
676 if ( !GetMatch(&start, &len, index) )
677 return wxEmptyString;
678
679 return text.Mid(start, len);
680}
681
86b79b93
VS
682size_t wxRegEx::GetMatchCount() const
683{
684 wxCHECK_MSG( IsValid(), 0, _T("must successfully Compile() first") );
685
686 return m_impl->GetMatchCount();
687}
688
765624f7
VZ
689int wxRegEx::Replace(wxString *pattern,
690 const wxString& replacement,
691 size_t maxMatches) const
e7208277 692{
701a0b47 693 wxCHECK_MSG( IsValid(), wxNOT_FOUND, _T("must successfully Compile() first") );
e7208277 694
765624f7 695 return m_impl->Replace(pattern, replacement, maxMatches);
e7208277
VZ
696}
697
698#endif // wxUSE_REGEX