diff options
Diffstat (limited to 'doc/html/pcrematching.html')
| -rw-r--r-- | doc/html/pcrematching.html | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/html/pcrematching.html b/doc/html/pcrematching.html index 80945ca..3d1acf6 100644 --- a/doc/html/pcrematching.html +++ b/doc/html/pcrematching.html @@ -106,7 +106,7 @@ The scan continues until either the end of the subject is reached, or there are no more unterminated paths. At this point, terminated paths represent the different matching possibilities (if there are none, the match has failed). Thus, if there is more than one possible match, this algorithm finds all of -them, and in particular, it finds the longest. The matches are returned in +them, and in particular, it finds the longest. The matches are returned in decreasing order of length. There is an option to stop the algorithm after the first match (which is necessarily the shortest) is found. </P> @@ -190,7 +190,7 @@ time. Although it is possible to do multi-segment matching using the standard algorithm (<b>pcre_exec()</b>), by retaining partially matched substrings, it is more complicated. The <a href="pcrepartial.html"><b>pcrepartial</b></a> -documentation gives details of partial matching and discusses multi-segment +documentation gives details of partial matching and discusses multi-segment matching. </P> <br><a name="SEC6" href="#TOC1">DISADVANTAGES OF THE ALTERNATIVE ALGORITHM</a><br> |