Documentation updates.

git-svn-id: svn://vcs.exim.org/pcre/code/trunk@858 2f5784b3-3f2a-0410-8824-cb99058d5e15

1 files changed, 8 insertions, 7 deletions

diff --git a/doc/pcrelimits.3 b/doc/pcrelimits.3
index 028cf55..db1a333 100644
--- a/doc/pcrelimits.3
+++ b/doc/pcrelimits.3
@@ -7,15 +7,16 @@ PCRE - Perl-compatible regular expressions
 There are some size limitations in PCRE but it is hoped that they will never in
 practice be relevant.
 .P
-The maximum length of a compiled pattern is 65539 (sic) bytes if PCRE is
-compiled with the default internal linkage size of 2. If you want to process
+The maximum length of a compiled pattern is approximately 64K data units (bytes
+for the 8-bit library, 16-bit units for the 16-bit library) if PCRE is compiled
+with the default internal linkage size of 2 bytes. If you want to process
 regular expressions that are truly enormous, you can compile PCRE with an
-internal linkage size of 3 or 4 (see the \fBREADME\fP file in the source
-distribution and the
+internal linkage size of 3 or 4 (when building the 16-bit library, 3 is rounded
+up to 4). See the \fBREADME\fP file in the source distribution and the
 .\" HREF
 \fBpcrebuild\fP
 .\"
-documentation for details). In these cases the limit is substantially larger.
+documentation for details. In these cases the limit is substantially larger.
 However, the speed of execution is slower.
 .P
 All values in repeating quantifiers must be less than 65536.
@@ -57,6 +58,6 @@ Cambridge CB2 3QH, England.
 .rs
 .sp
 .nf
-Last updated: 30 November 2011
-Copyright (c) 1997-2011 University of Cambridge.
+Last updated: 08 January 2012
+Copyright (c) 1997-2012 University of Cambridge.
 .fi