149 |
A second matching function, \fBpcre_dfa_exec()\fP, which is not |
A second matching function, \fBpcre_dfa_exec()\fP, which is not |
150 |
Perl-compatible, is also provided. This uses a different algorithm for the |
Perl-compatible, is also provided. This uses a different algorithm for the |
151 |
matching. The alternative algorithm finds all possible matches (at a given |
matching. The alternative algorithm finds all possible matches (at a given |
152 |
point in the subject), and scans the subject just once. However, this algorithm |
point in the subject), and scans the subject just once (unless there are |
153 |
does not return captured substrings. A description of the two matching |
lookbehind assertions). However, this algorithm does not return captured |
154 |
algorithms and their advantages and disadvantages is given in the |
substrings. A description of the two matching algorithms and their advantages |
155 |
|
and disadvantages is given in the |
156 |
.\" HREF |
.\" HREF |
157 |
\fBpcrematching\fP |
\fBpcrematching\fP |
158 |
.\" |
.\" |
1012 |
.sp |
.sp |
1013 |
PCRE_INFO_OKPARTIAL |
PCRE_INFO_OKPARTIAL |
1014 |
.sp |
.sp |
1015 |
Return 1 if the pattern can be used for partial matching, otherwise 0. The |
Return 1 if the pattern can be used for partial matching with |
1016 |
fourth argument should point to an \fBint\fP variable. From release 8.00, this |
\fBpcre_exec()\fP, otherwise 0. The fourth argument should point to an |
1017 |
always returns 1, because the restrictions that previously applied to partial |
\fBint\fP variable. From release 8.00, this always returns 1, because the |
1018 |
matching have been lifted. The |
restrictions that previously applied to partial matching have been lifted. The |
1019 |
.\" HREF |
.\" HREF |
1020 |
\fBpcrepartial\fP |
\fBpcrepartial\fP |
1021 |
.\" |
.\" |
1388 |
PCRE_ERROR_PARTIAL. Otherwise, if PCRE_PARTIAL_SOFT is set, matching continues |
PCRE_ERROR_PARTIAL. Otherwise, if PCRE_PARTIAL_SOFT is set, matching continues |
1389 |
by testing any other alternatives. Only if they all fail is PCRE_ERROR_PARTIAL |
by testing any other alternatives. Only if they all fail is PCRE_ERROR_PARTIAL |
1390 |
returned (instead of PCRE_ERROR_NOMATCH). The portion of the string that |
returned (instead of PCRE_ERROR_NOMATCH). The portion of the string that |
1391 |
provided the partial match is set as the first matching string. There is a more |
was inspected when the partial match was found is set as the first matching |
1392 |
detailed discussion in the |
string. There is a more detailed discussion in the |
1393 |
.\" HREF |
.\" HREF |
1394 |
\fBpcrepartial\fP |
\fBpcrepartial\fP |
1395 |
.\" |
.\" |
1835 |
just once, and does not backtrack. This has different characteristics to the |
just once, and does not backtrack. This has different characteristics to the |
1836 |
normal algorithm, and is not compatible with Perl. Some of the features of PCRE |
normal algorithm, and is not compatible with Perl. Some of the features of PCRE |
1837 |
patterns are not supported. Nevertheless, there are times when this kind of |
patterns are not supported. Nevertheless, there are times when this kind of |
1838 |
matching can be useful. For a discussion of the two matching algorithms, see |
matching can be useful. For a discussion of the two matching algorithms, and a |
1839 |
the |
list of features that \fBpcre_dfa_exec()\fP does not support, see the |
1840 |
.\" HREF |
.\" HREF |
1841 |
\fBpcrematching\fP |
\fBpcrematching\fP |
1842 |
.\" |
.\" |
1891 |
been found. When PCRE_PARTIAL_SOFT is set, the return code PCRE_ERROR_NOMATCH |
been found. When PCRE_PARTIAL_SOFT is set, the return code PCRE_ERROR_NOMATCH |
1892 |
is converted into PCRE_ERROR_PARTIAL if the end of the subject is reached, |
is converted into PCRE_ERROR_PARTIAL if the end of the subject is reached, |
1893 |
there have been no complete matches, but there is still at least one matching |
there have been no complete matches, but there is still at least one matching |
1894 |
possibility. The portion of the string that provided the longest partial match |
possibility. The portion of the string that was inspected when the longest |
1895 |
is set as the first matching string in both cases. |
partial match was found is set as the first matching string in both cases. |
1896 |
.sp |
.sp |
1897 |
PCRE_DFA_SHORTEST |
PCRE_DFA_SHORTEST |
1898 |
.sp |
.sp |
2012 |
.rs |
.rs |
2013 |
.sp |
.sp |
2014 |
.nf |
.nf |
2015 |
Last updated: 01 September 2009 |
Last updated: 05 September 2009 |
2016 |
Copyright (c) 1997-2009 University of Cambridge. |
Copyright (c) 1997-2009 University of Cambridge. |
2017 |
.fi |
.fi |