| 144 |
match using the standard algorithm, you have to do kludgy things with |
match using the standard algorithm, you have to do kludgy things with |
| 145 |
callouts. |
callouts. |
| 146 |
.P |
.P |
| 147 |
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 |
|
|
3. Because the alternative algorithm scans the subject string just once, and |
|
| 148 |
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 |
| 149 |
the matching function in several pieces, checking for partial matching each |
the matching function in several pieces, checking for partial matching each |
| 150 |
time. |
time. |
| 178 |
.rs |
.rs |
| 179 |
.sp |
.sp |
| 180 |
.nf |
.nf |
| 181 |
Last updated: 19 April 2008 |
Last updated: 25 August 2009 |
| 182 |
Copyright (c) 1997-2008 University of Cambridge. |
Copyright (c) 1997-2009 University of Cambridge. |
| 183 |
.fi |
.fi |