| 177 |
callouts. |
callouts. |
| 178 |
</P> |
</P> |
| 179 |
<P> |
<P> |
| 180 |
2. There is much better support for partial matching. The restrictions on the |
2. Because the alternative algorithm scans the subject string just once, and |
|
content of the pattern that apply when using the standard algorithm for partial |
|
|
matching do not apply to the alternative algorithm. For non-anchored patterns, |
|
|
the starting position of a partial match is available. |
|
|
</P> |
|
|
<P> |
|
|
3. Because the alternative algorithm scans the subject string just once, and |
|
| 181 |
never needs to backtrack, it is possible to pass very long subject strings to |
never needs to backtrack, it is possible to pass very long subject strings to |
| 182 |
the matching function in several pieces, checking for partial matching each |
the matching function in several pieces, checking for partial matching each |
| 183 |
time. |
time. |
| 209 |
</P> |
</P> |
| 210 |
<br><a name="SEC8" href="#TOC1">REVISION</a><br> |
<br><a name="SEC8" href="#TOC1">REVISION</a><br> |
| 211 |
<P> |
<P> |
| 212 |
Last updated: 19 April 2008 |
Last updated: 25 August 2009 |
| 213 |
<br> |
<br> |
| 214 |
Copyright © 1997-2008 University of Cambridge. |
Copyright © 1997-2009 University of Cambridge. |
| 215 |
<br> |
<br> |
| 216 |
<p> |
<p> |
| 217 |
Return to the <a href="index.html">PCRE index page</a>. |
Return to the <a href="index.html">PCRE index page</a>. |