diff options
author | ph10 <ph10@2f5784b3-3f2a-0410-8824-cb99058d5e15> | 2009-10-19 11:46:26 +0000 |
---|---|---|
committer | ph10 <ph10@2f5784b3-3f2a-0410-8824-cb99058d5e15> | 2009-10-19 11:46:26 +0000 |
commit | 606118f31912c2fbd660221f878db223287d3c5a (patch) | |
tree | 9b3ddd9545b8ede8c804e11b0150b8165498f8ae | |
parent | 351e183b094222a739b28c02779cfe400d989c1d (diff) | |
download | pcre-606118f31912c2fbd660221f878db223287d3c5a.tar.gz |
Fix typos and other things.
git-svn-id: svn://vcs.exim.org/pcre/code/trunk@468 2f5784b3-3f2a-0410-8824-cb99058d5e15
-rw-r--r-- | doc/pcrepartial.3 | 14 |
1 files changed, 9 insertions, 5 deletions
diff --git a/doc/pcrepartial.3 b/doc/pcrepartial.3 index 4f66758..097e668 100644 --- a/doc/pcrepartial.3 +++ b/doc/pcrepartial.3 @@ -139,7 +139,7 @@ so returns that when PCRE_PARTIAL_HARD is set. .SH "PARTIAL MATCHING AND WORD BOUNDARIES" .rs .sp -If a pattern ends with one of sequences \ew or \eW, which test for word +If a pattern ends with one of sequences \eb or \eB, which test for word boundaries, partial matching with PCRE_PARTIAL_SOFT can give counter-intuitive results. Consider this pattern: .sp @@ -247,7 +247,7 @@ Consider an unanchored pattern that matches dates: data> The date is 23ja\eP Partial match: 23ja .sp -The this stage, an application could discard the text preceding "23ja", add on +At this stage, an application could discard the text preceding "23ja", add on text from the next segment, and call \fBpcre_exec()\fP again. Unlike \fBpcre_dfa_exec()\fP, the entire matching string must always be available, and the complete matching process occurs for each call, so more memory and more @@ -337,7 +337,7 @@ patterns or patterns such as: 1234|ABCD .sp where no string can be a partial match for both alternatives. This is not a -problem if \fPpcre_exec()\fP is used, because the entire match has to be rerun +problem if \fBpcre_exec()\fP is used, because the entire match has to be rerun each time: .sp re> /1234|3789/ @@ -347,7 +347,11 @@ each time: 0: 3789 .sp Of course, instead of using PCRE_DFA_PARTIAL, the same technique of re-running -the entire match can also be used with \fBpcre_dfa_exec()\fP. +the entire match can also be used with \fBpcre_dfa_exec()\fP. Another +possibility is to work with two buffers. If a partial match at offset \fIn\fP +in the first buffer is followed by "no match" when PCRE_DFA_RESTART is used on +the second buffer, you can then try a new match starting at offset \fIn+1\fP in +the first buffer. . . .SH AUTHOR @@ -364,6 +368,6 @@ Cambridge CB2 3QH, England. .rs .sp .nf -Last updated: 18 October 2009 +Last updated: 19 October 2009 Copyright (c) 1997-2009 University of Cambridge. .fi |