File tidies and documentation update for 10.32-RC1 Release Candidate.

git-svn-id: svn://vcs.exim.org/pcre2/code/trunk@983 6239d852-aaf2-0410-a92c-79f79f948069

1 files changed, 11 insertions, 11 deletions

diff --git a/doc/pcre2test.1 b/doc/pcre2test.1
index 06b3dc8..f590fe1 100644
--- a/doc/pcre2test.1
+++ b/doc/pcre2test.1
@@ -266,8 +266,8 @@ number of subject lines to be matched against that pattern. In between sets of
 test data, command lines that begin with # may appear. This file format, with
 some restrictions, can also be processed by the \fBperltest.sh\fP script that
 is distributed with PCRE2 as a means of checking that the behaviour of PCRE2
-and Perl is the same. For a specification of \fBperltest.sh\fP, see the 
-comments near its beginning. 
+and Perl is the same. For a specification of \fBperltest.sh\fP, see the
+comments near its beginning.
 .P
 When the input is a terminal, \fBpcre2test\fP prompts for each line of input,
 using "re>" to prompt for regular expression patterns, and "data>" to prompt
@@ -1408,10 +1408,10 @@ the match context via \fBpcre2_set_heap_limit()\fP,
 the minimum values for each parameter that allows the match to complete without
 error. If JIT is being used, only the match limit is relevant.
 .P
-When using this modifier, the pattern should not contain any limit settings 
-such as (*LIMIT_MATCH=...) within it. If such a setting is present and is 
-lower than the minimum matching value, the minimum value cannot be found 
-because \fBpcre2_set_match_limit()\fP etc. are only able to reduce the value of 
+When using this modifier, the pattern should not contain any limit settings
+such as (*LIMIT_MATCH=...) within it. If such a setting is present and is
+lower than the minimum matching value, the minimum value cannot be found
+because \fBpcre2_set_match_limit()\fP etc. are only able to reduce the value of
 an in-pattern limit; they cannot increase it.
 .P
 For non-DFA matching, the minimum \fIdepth_limit\fP number is a measure of how
@@ -1424,12 +1424,12 @@ For non-DFA matching, the \fImatch_limit\fP number is a measure of the amount
 of backtracking that takes place, and learning the minimum value can be
 instructive. For most simple matches, the number is quite small, but for
 patterns with very large numbers of matching possibilities, it can become large
-very quickly with increasing length of subject string. In the case of DFA 
-matching, \fImatch_limit\fP controls the total number of calls, both recursive 
-and non-recursive, to the internal matching function, thus controlling the 
+very quickly with increasing length of subject string. In the case of DFA
+matching, \fImatch_limit\fP controls the total number of calls, both recursive
+and non-recursive, to the internal matching function, thus controlling the
 overall amount of computing resource that is used.
 .P
-For both kinds of matching, the \fIheap_limit\fP number, which is in kibibytes 
+For both kinds of matching, the \fIheap_limit\fP number, which is in kibibytes
 (units of 1024 bytes), limits the amount of heap memory used for matching. A
 value of zero disables the use of any heap memory; many simple pattern matches
 can be done without using the heap, so zero is not an unreasonable setting.
@@ -1897,7 +1897,7 @@ for serializing and de-serializing. They are described in the
 documentation. In this section we describe the features of \fBpcre2test\fP that
 can be used to test these functions.
 .P
-Note that "serialization" in PCRE2 does not convert compiled patterns to an 
+Note that "serialization" in PCRE2 does not convert compiled patterns to an
 abstract format like Java or .NET. It just makes a reloadable byte code stream.
 Hence the restrictions on reloading mentioned above.
 .P