version 1.1.1.4, 2013/07/22 08:25:56
|
version 1.1.1.5, 2014/06/15 19:46:04
|
Line 1
|
Line 1
|
.TH PCREPARTIAL 3 "20 February 2013" "PCRE 8.33" | .TH PCREPARTIAL 3 "02 July 2013" "PCRE 8.34" |
.SH NAME |
.SH NAME |
PCRE - Perl-compatible regular expressions |
PCRE - Perl-compatible regular expressions |
.SH "PARTIAL MATCHING IN PCRE" |
.SH "PARTIAL MATCHING IN PCRE" |
Line 280 Notice that when the match is complete, only the last
|
Line 280 Notice that when the match is complete, only the last
|
not retain the previously partially-matched string. It is up to the calling |
not retain the previously partially-matched string. It is up to the calling |
program to do that if it needs to. |
program to do that if it needs to. |
.P |
.P |
|
That means that, for an unanchored pattern, if a continued match fails, it is |
|
not possible to try again at a new starting point. All this facility is capable |
|
of doing is continuing with the previous match attempt. In the previous |
|
example, if the second set of data is "ug23" the result is no match, even |
|
though there would be a match for "aug23" if the entire string were given at |
|
once. Depending on the application, this may or may not be what you want. |
|
The only way to allow for starting again at the next character is to retain the |
|
matched part of the subject and try a new complete match. |
|
.P |
You can set the PCRE_PARTIAL_SOFT or PCRE_PARTIAL_HARD options with |
You can set the PCRE_PARTIAL_SOFT or PCRE_PARTIAL_HARD options with |
PCRE_DFA_RESTART to continue partial matching over multiple segments. This |
PCRE_DFA_RESTART to continue partial matching over multiple segments. This |
facility can be used to pass very long subject strings to the DFA matching |
facility can be used to pass very long subject strings to the DFA matching |
Line 462 Cambridge CB2 3QH, England.
|
Line 471 Cambridge CB2 3QH, England.
|
.rs |
.rs |
.sp |
.sp |
.nf |
.nf |
Last updated: 20 February 2013 | Last updated: 02 July 2013 |
Copyright (c) 1997-2013 University of Cambridge. |
Copyright (c) 1997-2013 University of Cambridge. |
.fi |
.fi |