summaryrefslogtreecommitdiff
path: root/doc/html/pcrepartial.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/pcrepartial.html')
-rw-r--r--doc/html/pcrepartial.html2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/html/pcrepartial.html b/doc/html/pcrepartial.html
index 449c36c..d54ed23 100644
--- a/doc/html/pcrepartial.html
+++ b/doc/html/pcrepartial.html
@@ -178,7 +178,7 @@ bytes at the start of the buffer.
always produce exactly the same result as matching over one single long string.
The difference arises when there are multiple matching possibilities, because a
partial match result is given only when there are no completed matches in a
-call to fBpcre_dfa_exec()\fP. This means that as soon as the shortest match has
+call to <b>pcre_dfa_exec()</b>. This means that as soon as the shortest match has
been found, continuation to a new subject segment is no longer possible.
Consider this <b>pcretest</b> example:
<pre>